ACM Home Page
Please provide us with feedback. Feedback
A clickstream-based collaborative filtering personalization model: towards a better performance
Full text PdfPdf (184 KB)
Source Workshop On Web Information And Data Management archive
Proceedings of the 6th annual ACM international workshop on Web information and data management table of contents
Washington DC, USA
SESSION: Web personalization table of contents
Pages: 88 - 95  
Year of Publication: 2004
ISBN:1-58113-978-0
Authors
Dong-Ho Kim  Rutgers University
Vijayalakshmi Atluri  Rutgers University
Michael Bieber  New Jersey Institute of Technology
Nabil Adam  Rutgers University
Yelena Yesha  University of Maryland at Baltimore County
Sponsors
ACM: Association for Computing Machinery
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 102,   Citation Count: 9
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1031453.1031470
What is a DOI?

ABSTRACT

In recent years, clickstream-based Web personalization models for collaborative filtering recommendation have received much attention mainly due to their scalability [10,16,19]. The common personalization models are the Markov model, (sequential) association rule, and clustering. These models have shown strengths and weaknesses in their performance: for instance, the Markov model has higher precision and lower recall than (sequential) association rule and clustering, and vice versa [22]. In order to address the trade-off relationship of precision and recall, some study has combined two or more different models [22] or applied multi-order models [24,27]. The performance increases by these models, however, are at best marginal and still there is room for improving the performance because of their first order (one model type) application in making recommendation. We propose a new hybrid model for improving the performance, especially recall. The proposed hybrid model applies four prediction models - the Markov model, sequential association rule, association rule, and a default model [1,17] - in tandem in their precision order. We evaluated our model with Web usage data, and the result is promising.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
A. Banerjee and J. Ghosh (2001). Clickstream clustering using weighted longest common subsequences. In Proceedings of the Web Mining Workshop at the 1st SIAM Conference on Data Mining, Chicago, April 2001, pages 33--40.
 
5
 
6
 
7
Mark Claypool, Anuja Cokhale, Tim Miranda, Pavel Murnikov, Dmitry Netes and Mattew Sartin (1999). Combining Content-Based and Collaborative Filters in an Online Newspaper. ACM SIGIR Workshop on Recommender Systems - Implementation and Evaluation, August 19, 1999.
8
 
9
Ayhan Demiriz (2002). Analyzing Service Order Data using Association Mining. Technical paper, Information Technology, Verizon Inc.2002.
 
10
M. Deshpande and G. Karypis (2001). Selective Markov models for predicting Web-page accesses. First SIAM International Conference on Data Mining (SDM'2001), 2001.
 
11
M. Deshpande and G. Karypis (2001). Item-Based Top-N Recommendation Algorithms. Technical Paper, University of Minnesota, 2001.
 
12
Yongjian Fu, Kanwalpreet Sandhu, and Ming-Yi Shih (2000). Clustering of Web Users Based on Access Patterns. Technical Paper, Computer Science Department, University of Missouri-Rolla, 2000.
 
13
Enrique Frias-Martinez and Vijay Karamcheti (2002). A Prediction Model for User Access Sequences. Proc. WEBKDD Workshop: Web Mining for Usage Patterns and User Profiles.
 
14
Weiyang Lin, Sergio A. Alvarez, and Carolina Ruiz (2000). Collaborative Recommendation via Adaptive Association Rule Mining. Technical Paper, Dept. of Computer Science, Worcester Polytechnic Institute, 2000.
 
15
 
16
 
17
Ian Tian Yi Li, Qiang Yang, and Ke Wang (2001). Classification Pruning for Web-request Prediction. In Poster Proceedings of the 10th World Wide Web Conference (WWW10), May 2-4, 2001. Hong Kong, China.
 
18
Bamshad Mobasher (2004). Web Usage Mining and Personalization, Practical Handbook of Internet Computing, Munindar P. Singh (ed.), CRC Press, forthcoming in 2004.
19
20
 
21
 
22
Miki Nakagawa, Bamshad Mobasher (2003). A Hybrid Web Personalization Model Based on Site Connectivity. WEBKDD 2003, Washington USA, August 28, 2003, pages 59--70.
 
23
A. Nanopoulos, D. Kastsaros, Y. Manolopoulos (2001). Effective Prediction of Web-user Accesses: A Data Mining Approach, WEBKDD'01, 2001.
 
24
J. Pitkow and P. Pirolli (1999). Mining longest repeating subsequences to Predict WWW Surfing. In Proceedings of the 1999 USENIX Annual Technical Conference, 1999, pages 139--150.
 
25
26
27
 
28
 
29
 
30
31

CITED BY  9

Collaborative Colleagues:
Dong-Ho Kim: colleagues
Vijayalakshmi Atluri: colleagues
Michael Bieber: colleagues
Nabil Adam: colleagues
Yelena Yesha: colleagues