Mining web logs for personalized site maps

被引:0
作者
Toolan, F [1 ]
Kusmerick, N [1 ]
机构
[1] Univ Coll Dublin, Smart Media Inst, Dublin 2, Ireland
来源
WISE 2002: PROCEEDINGS OF THE THIRD INTERNATIONAL CONFERENCE ON WEB INFORMATION SYSTEMS ENGINEERING (WORKSHOPS) | 2002年
关键词
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Navigating through a large Web site can be a frustrating exercise. Many sites employ Site Maps to help visitors understand the overall structure of the site. However by their very nature, unpersonalized Site Maps show most visitors large amounts of irrelevant content. We propose techniques based on Web usage mining to deliver Personalized Site Maps that are specialized to the interests of each individual visitor The key challenge is to resolve the tension between simplicity (showing just relevant content), and comprehensibility (showing sufficient context so that the visitors can understand how the content is related to the overall structure of the site). We develop two baseline algorithms (one that displays just shortest paths, and one that mines the server log for popular paths), and compare them to a novel approach that mines the server log for popular path fragments that can be dynamically assembled to reconstruct popular paths. Our experiments with two large Web sites confirm that the mined path fragments provide much better coverage of visitors sessions than the baseline approach of mining entire paths.
引用
收藏
页码:232 / 237
页数:6
相关论文
共 9 条
  • [1] COOLEY R, 2001, THESIS U MINNESOTA
  • [2] GAUL W, 2000, P WORKSH WEB MIN E C
  • [3] LI WS, 2001, P WWW10 HONG KONG
  • [4] MCGINTY L, 2000, P 11 C ART INT COGN
  • [5] SRIKANT R, 1996, P 5 INT C EXT DAT SY
  • [6] Srivastava J., 2000, SIGKDD EXPLOR, V1, P12, DOI [10.1145/846183.846188, DOI 10.1145/846183.846188]
  • [7] WEXELBLAT A, 1999, P CHI 99 C HUM FACT
  • [8] Yang Q., 2001, 7 ACM SIGKDD INT C K
  • [9] YPMA A, 2002, P INT WORKSH WEB KNO