ACM Home Page
Please provide us with feedback. Feedback
Predicting category accesses for a user in a structured information space
Full text PdfPdf (256 KB)
Source Annual ACM Conference on Research and Development in Information Retrieval archive
Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval table of contents
Tampere, Finland
SESSION: User Studies table of contents
Pages: 65 - 72  
Year of Publication: 2002
ISBN:1-58113-561-0
Authors
Mao Chen  Princeton University, Princeton, NJ
Andrea S. LaPaugh  Princeton University, Princeton, NJ
Jaswinder Pal Singh  Princeton University, Princeton, NJ
Sponsor
SIGIR: ACM Special Interest Group on Information Retrieval
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 44,   Citation Count: 6
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/564376.564390
What is a DOI?

ABSTRACT

In a categorized information space, predicting users' information needs at the category level can facilitate personalization, caching and other topic-oriented services. This paper presents a two-phase model to predict the category of a user's next access based on previous accesses. Phase 1 generates a snapshot of a user's preferences among categories based on a temporal and frequency analysis of the user's access history. Phase 2 uses the computed preferences to make predictions at different category granularities. Several alternatives for each phase are evaluated, using the rating behaviors of on-line raters as the form of access considered. The results show that a method based on re-access pattern and frequency analysis of a user's whole history has the best prediction quality, even over a path-based method (Markov model) that uses the combined history of all users.


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
Amazon.com. http://www.amazon.com
 
2
3
 
4
Cooley, R., Mobasher, B., and Srivastava, J. Data Preparation for Mining World Wide Web Browsing Patterns. Knowledge and Information Systems, 1(1), 1999.
5
 
6
Deshpande, M. and Karypis, G. Selective Markov Models for Predicting Web-Page Accesses. First SIAM International Conference on Data Mining (SDM'2001), 2001.
 
7
eBay.com. http://www.ebay.com
 
8
Epinions.com. http://www.epinions.com
 
9
Fu,Y., Sandhu, K., and Shih, M. Fast Clustering of Web Users Based on Navigation Patterns. World Multiconference on Systemics, Cybernetics and Informatics (SCI/ISAS'99), Vol. 5, 560--567, 1999.
 
10
He, D and Goker, A. Detecting Session Boundaries from Web User Logs. In Proceedings of the IRSG 22nd Annual Colloquium on Information Retrieval Research, 2000.
11
 
12
 
13
Li, T. Y., Yang, Q. and Wang K. Classification Pruning for Web-request Prediction. In Proceedings of WWW 10, 2001.
 
14
Lieberman, H. Letizia: An Agent That Assists Web Browsing. Proceedings of the 1995 International Joint Conference on Artificial Intelligent, 1995.
 
15
Nanopoulos, A., Katsaros, D., and Manolopoulos, Y. Effective Prediction of Web-user Accesses: A Data Mining Approach. WEBKDD'01, 2001.
 
16
Pitkow, J. and Pirolli, P. Mining Longest Repeating Subsequences to Predict World Wide Web Surfing. In Proceedings of USITS'99: The 2nd USENIX Symposium on Internet Technologies & Systems, 1999.
17
18
 
19
Stratify Company. (2002) http://www.stratify.com/
20
21
 
22
 
23


Collaborative Colleagues:
Mao Chen: colleagues
Andrea S. LaPaugh: colleagues
Jaswinder Pal Singh: colleagues