Cumulative Probability Distribution Model for Evaluating User Behavior Prediction Algorithms

User behavior analysis and prediction has been widely applied in personalized search, advertising precise delivery and other personalized services. It is a core problem how to evaluate the performance of prediction models or algorithms. The most used off-line experiment is a simple and convenient evaluation strategy. However, the existing assessment measures are most based on arithmetic average value theory, such as precision, recall, F measure, mean absolute error (MAE), root mean squared error (RMSE) etc. These approaches have two drawbacks. First, they cannot depict the prediction performance within a more fine-grained view and they only provide one average value to compare different algorithms' performances. Second, they are not reasonable if the evaluation results are not follow normal distribution. In this paper, according to analyze a mass of prediction evaluation results, we find that some performance evaluation results follow approximate power low distribution but not normal distribution. Therefore, the paper proposes a cumulative probability distribution model to evaluate the performance of prediction algorithms. The model first calculates the probability of each evaluation results. And then, it depicts the cumulative probability distribution function. Moreover, we further present an evaluation expectation value (EEV) to represent the overall performance of the prediction algorithms. Experiments on two real data sets show that the proposed model can provide deeper and more accurate assessment results.

[1]  Fernando Ortega,et al.  A collaborative filtering similarity measure based on singularities , 2012, Inf. Process. Manag..

[2]  Robert Meersman,et al.  On the Move to Meaningful Internet Systems 2004: CoopIS, DOA, and ODBASE , 2004, Lecture Notes in Computer Science.

[3]  Vittorio Loreto,et al.  Folksonomies, the semantic web, and movie recommendation , 2007 .

[4]  M. Tamer Özsu,et al.  A Web page prediction model based on click-stream tree representation of user behavior , 2003, KDD '03.

[5]  Diego Fernández,et al.  Comparison of collaborative filtering algorithms , 2011, ACM Trans. Web.

[6]  Paolo Avesani,et al.  Trust-Aware Collaborative Filtering for Recommender Systems , 2004, CoopIS/DOA/ODBASE.

[7]  James Bennett,et al.  The Netflix Prize , 2007 .

[8]  Zhenzhen Zhao,et al.  A survey of user generated service , 2009, 2009 IEEE International Conference on Network Infrastructure and Digital Content.

[9]  Kamal Kant Bharadwaj,et al.  Utilizing various sparsity measures for enhancing accuracy of collaborative recommender systems based on local and global similarities , 2011, Expert Syst. Appl..

[10]  Xabiel G. Pañeda,et al.  User behavior analysis of a video-on-demand service with a wide variety of subjects and lengths , 2005 .

[11]  Jonathan L. Herlocker,et al.  Evaluating collaborative filtering recommender systems , 2004, TOIS.

[12]  Toon De Pessemier,et al.  Context aware recommendations for user-generated content on a social network site , 2009, EuroITV '09.

[13]  Hui Tian,et al.  An Adaptive Social Influence Propagation Model Based on Local Network Topology , 2013, EC-Web.

[14]  C. Lee Giles,et al.  Probabilistic user behavior models , 2003, Third IEEE International Conference on Data Mining.

[15]  Yi-Cheng Zhang,et al.  Effect of initial configuration on network-based recommendation , 2007, 0711.2506.

[16]  John Riedl,et al.  Item-based collaborative filtering recommendation algorithms , 2001, WWW '01.

[17]  Michael J. Pazzani,et al.  Learning and Revising User Profiles: The Identification of Interesting Web Sites , 1997, Machine Learning.

[18]  Susan T. Dumais,et al.  Learning user interaction models for predicting web search result preferences , 2006, SIGIR.

[19]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[20]  Kirsten Swearingen,et al.  Beyond Algorithms: An HCI Perspective on Recommender Systems , 2001 .