A new classification model for online predicting users’ future movements
暂无分享,去创建一个
[1] Alberto Apostolico,et al. String Editing and Longest Common Subsequences , 1997, Handbook of Formal Languages.
[2] Fabrizio Silvestri,et al. Dynamic personalization of web sites without user intervention , 2007, CACM.
[3] Umeshwar Dayal,et al. From User Access Patterns to Dynamic Hypertext Linking , 1996, Comput. Networks.
[4] Michael J. Fischer,et al. The String-to-String Correction Problem , 1974, JACM.
[5] Grzegorz Rozenberg,et al. Linear modeling : background and application , 1997 .
[6] Jaideep Srivastava,et al. Automatic personalization based on Web usage mining , 2000, CACM.
[7] Haibin Liu,et al. Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests , 2007, Data Knowl. Eng..
[8] Enrique Frías-Martínez,et al. Reduction of user perceived latency for a dynamic and personalized site using web-mining techniques , 2003 .
[9] Vladimír Dancík,et al. Expected length of longest common subsequences , 1994 .
[10] Mehrdad Jalali,et al. OPWUMP: An Architecture for Online Predicting in WUM-Based Personalization System , 2008 .
[11] Fabrizio Silvestri,et al. An Online Recommender System for Large Web Sites , 2004, IEEE/WIC/ACM International Conference on Web Intelligence (WI'04).
[12] Alfred V. Aho,et al. Bounds on the Complexity of the Longest Common Subsequence Problem , 1976, J. ACM.
[13] Daniel S. Hirschberg,et al. Algorithms for the Longest Common Subsequence Problem , 1977, JACM.
[14] Bamshad Mobasher,et al. A Hybrid Web Personalization Model Based on Site Connectivity , 2003 .