Learning Hierarchical User Interest Models from Web Pages  

作　　者：YANG Feng-qin SUN Tie-li SUN Ji-gui 

机构地区：[1]College of Computer Science and Technology, Jilin University, Changchun 130012, Jilin, China [2]Key Laboratory for Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 120012, Jilin, China [3]Department of Computer Science, Northeast Normal University, Changchun 130024, Jilin, China

出　　处：《Wuhan University Journal of Natural Sciences》2006年第1期6-10,共5页武汉大学学报（自然科学英文版）

基　　金：Supported by the National Natural Science Funda-tion of China (69973012 ,60273080)

摘　　要：We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.We propose an algorithm for learning hierarchical user interest models according to the Web pages users have browsed. In this algorithm, the interests of a user are represented into a tree which is called a user interest tree, the content and the structure of which can change simultaneously to adapt to the changes in a user＇s interests. This expression represents a user＇s specific and general interests as a continuurn. In some sense, specific interests correspond to shortterm interests, while general interests correspond to longterm interests. So this representation more really reflects the users＇ interests. The algorithm can automatically model a us er＇s multiple interest domains, dynamically generate the in terest models and prune a user interest tree when the number of the nodes in it exceeds given value. Finally, we show the experiment results in a Chinese Web Site.

关 键 词：PERSONALIZATION user interest model vector space model agglomerate clustering method 

分 类 号：TP393.092[自动化与计算机技术—计算机应用技术]