10.1145/564376.564390acmconferencesArticle/Chapter ViewAbstractPublication PagesirConference Proceedingsconference-collections
Article

Predicting category accesses for a user in a structured information space

Online:11 August 2002Publication History

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

  1. Amazon.com. http://www.amazon.comGoogle ScholarGoogle Scholar
  2. Chen, M. S., Park, J. S., and Yu, P. S. Efficient Data Mining for Path Traversal Patterns. IEEE Trans. on Knowledge and Data Engineering, 10(2): 209--221, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. Chi. E. H., Pirolli, P., Chen, K., and Pitkow, J. Using Information Scent to Model User Information Needs and Actions on the Web. CHI 2001, Vol. 3, Issue 1, 490--497. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. Cooley, R., Mobasher, B., and Srivastava, J. Data Preparation for Mining World Wide Web Browsing Patterns. Knowledge and Information Systems, 1(1), 1999.Google ScholarGoogle Scholar
  5. Cutting, D. R., Karger, D. R., Pedersen, J. O., and Tukey, J. W. Scatter/gather: A cluster-based approach to browsing large document collections. In Proc. of SIGIR'92, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. Deshpande, M. and Karypis, G. Selective Markov Models for Predicting Web-Page Accesses. First SIAM International Conference on Data Mining (SDM'2001), 2001.Google ScholarGoogle Scholar
  7. eBay.com. http://www.ebay.comGoogle ScholarGoogle Scholar
  8. Epinions.com. http://www.epinions.comGoogle ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  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.Google ScholarGoogle Scholar
  11. Konstan, J. A., Miller, B. N., Maltz, D., Herlocker, J. L., Gordon, L. R., and Riedl, J. GroupLens: Applying Collaborative Filtering to Usenet News. Communications of ACM, Vol. 40, No. 3, 77--87, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. Lam, W. and Mostafa, J. Modeling User Interest Shift Using a Bayesian Approach. Journal of the American Society For Information Science and Technology, 52(5): 416--429, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. Li, T. Y., Yang, Q. and Wang K. Classification Pruning for Web-request Prediction. In Proceedings of WWW 10, 2001.Google ScholarGoogle Scholar
  14. Lieberman, H. Letizia: An Agent That Assists Web Browsing. Proceedings of the 1995 International Joint Conference on Artificial Intelligent, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. Nanopoulos, A., Katsaros, D., and Manolopoulos, Y. Effective Prediction of Web-user Accesses: A Data Mining Approach. WEBKDD'01, 2001.Google ScholarGoogle Scholar
  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. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Pitkow, J and Pirolli, P. Life, Death, and Lawfulness on the Electronic Frontier. In Proceedings of CHI'97, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Pirolli, P., Pitkow, J., and Rao, R. Silk from a Sow's Ear: Extracting Useable Structures from the Web. In Proceedings of CHI '96, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Stratify Company. (2002) http://www.stratify.com/Google ScholarGoogle Scholar
  20. Srivastava, J., Cooley, R., Deshpande, M., and Tan, P. N. Web Usage Mining: Discovery and Applications of Usage Patterns from Web Data. SIGKDD Explorations 1(2), 12--23, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Su, Z., Yang, Q. and Zhang, H. J. A prediction system for multimedia pre-fetching in Internet. In Proceedings of the ACM Multimedia Conference 2000, 2000. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. Yan, T. W., Jacobsen, M., Garcia-Molina, H. and Dayal, U. From User Access Patterns to Dynamic Hypertext Linking. In Proceedings of WWW5, 1996. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Zukerman, I., Albrecht, D. W., and Nicholson, A. E. Predicting Users' Request on the WWW. In Proceedings of the International Conference on User Modeling (UM99). Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Predicting category accesses for a user in a structured information space

              Comments

              Login options

              Check if you have access through your login credentials or your institution to get full access on this article.

              Sign in

              PDF Format

              View or Download as a PDF file.

              PDF

              eReader

              View online with eReader.

              eReader
              About Cookies On This Site

              We use cookies to ensure that we give you the best experience on our website.

              Learn more

              Got it!