首页 | 官方网站   微博 | 高级检索  
     

基于Web日志挖掘用户的浏览兴趣路径
引用本文:王思宝,李银胜.基于Web日志挖掘用户的浏览兴趣路径[J].计算机应用与软件,2012(1):164-167.
作者姓名:王思宝  李银胜
作者单位:复旦大学软件学院
摘    要:提出一种基于Web日志发现用户浏览偏爱路径算法。引入了支持-兴趣度概念。建立用户访问矩阵以表示用户浏览网页行为,并获得访问矩阵的海明距离矩阵。通过对距离矩阵与相似度阈值的计算获得偏爱路径的候选2项子路径,再利用支持-兴趣度对候选集做进一步的过滤,最后进行合并并生产浏览偏爱路径。实验表明该算法可以有效地反映用户的浏览兴趣。

关 键 词:偏爱浏览路径  访问矩阵  海明距离  支持-兴趣度

MINING USER PREFERRED BROWSING PATHS BASED ON WEB LOGS
Wang Sibao Li Yinsheng.MINING USER PREFERRED BROWSING PATHS BASED ON WEB LOGS[J].Computer Applications and Software,2012(1):164-167.
Authors:Wang Sibao Li Yinsheng
Affiliation:Wang Sibao Li Yinsheng(School of Software,Fudan University,Shanghai 200433,China)
Abstract:This paper puts forward an algorithm of discovering user preferred browsing paths from Web logs.The algorithm imports support-preference concept.By creating user access matrix,user’s webpage browsing behaviour is represented,and the Hamming distance matrix of access matrix is obtained.The distance matrix and similarity threshold are computed,so the candidate preference sub-path 2-items set is gotten.According to support-preference threshold,the candidate sub-path set is further filtered.At last the preferred browsing paths are generated by merging sub-paths.Applying the algorithm in experiment,its effectiveness in reflecting users browsing interests is proved.
Keywords:Preferred browsing paths Access matrix Hamming distance Support-preference
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号