ACM Home Page
Please provide us with feedback. Feedback
A Web page prediction model based on click-stream tree representation of user behavior
Full text PdfPdf (139 KB)
Source International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Washington, D.C.
POSTER SESSION: Research track table of contents
Pages: 535 - 540  
Year of Publication: 2003
ISBN:1-58113-737-0
Authors
Şule Gündüz  Istanbul Technical University, Istanbul, Turkey
M. Tamer Özsu  University of Waterloo, Waterloo, Ontario, Canada
Sponsors
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 16,   Downloads (12 Months): 143,   Citation Count: 12
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/956750.956815
What is a DOI?

ABSTRACT

Predicting the next request of a user as she visits Web pages has gained importance as Web-based activity increases. Markov models and their variations, or models based on sequence mining have been found well suited for this problem. However, higher order Markov models are extremely complicated due to their large number of states whereas lower order Markov models do not capture the entire behavior of a user in a session. The models that are based on sequential pattern mining only consider the frequent sequences in the data set, making it difficult to predict the next request following a page that is not in the sequential pattern. Furthermore, it is hard to find models for mining two different kinds of information of a user session. We propose a new model that considers both the order information of pages in a session and the time spent on them. We cluster user sessions based on their pair-wise similarity and represent the resulting clusters by a click-stream tree. The new user session is then assigned to a cluster based on a similarity measure. The click-stream tree of that cluster is used to generate the recommendation set. The model can be used as part of a cache prefetching system as well as a recommendation model.


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
A. Banerjee and J. Ghosh. Clickstream clustering using weighted longest common subsequences. In Proceedings of the Wokshop on Web Mining, SIAM Conference on Data Mining, pages 33--40, 2001. Chicago, IL.
 
3
K. Cahrter, J. Schaeffer, and D. Szafron. Sequence alignment using fastlsa. In Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Sciences (METMBS'2000), pages 239--245, 2000.
 
4
Cluto. http://www-users.cs.umn.edu/ karypis/cluto/index.html.
 
5
Dan Cosley, Steve Lawrence, and David M. Pennock. REFEREE: An open framework for practical testing of recommender systems using researchindex. In Proceedings of 28th International Conference on Very Large Databases, VLDB 2002, Hong Kong, August 20--23 2002.
 
6
Chris Ding, Xiaofeng He, Hongyuan Zha, Minh Gu, and Horst Simon. Spectral min-max cut for graph partitioning and data clustering. 2001. Technical Report TR-2001-XX, Lawrence Berkeley National Laboratory, University of CaliforniaBerkeley, CA.
7
 
8
ClarkNet WWW Server Log. http://ita.ee.lbl.gov/html/contrib/ClarkNet-HTTP.html.
 
9
NASA Kennedy Space Center Log. http://ita.ee.lbl.gov/html/contrib/NASA-HTTP.html.
 
10
B. Mobasher, H. Dai, T. Luo, and M. Nakagawa. Discovery of aggregate usage profiles for web personalization. In Proceedings of the Web Mining for E-Commerce Workshop (WebKDD'2000), 2000.
11
 
12
 
13
14

CITED BY  12

Collaborative Colleagues:
Şule Gündüz: colleagues
M. Tamer Özsu: colleagues