通信学报2011，Vol.32Issue(1)：72-78,7.
基于主题的用户兴趣域算法
Domain of interests clustering algorithm based on users' preferred topics
摘要
Abstract
In order to solve the problem of users' preferences changing frequently, an iterative computing method was presented to gain the weights of users' preferences as time goes. A bipartite graph was constructed to show the relations of users' interests and topic classes. On this base, a novel topic-based clustering (TBC) algorithm was proposed to group the nearest neighbors according to users' interests, which had changed the usual hard partition method meaning “one or the other” for the clustering items. And the partitioned domains of users' interests based on multiple topics was also established by the algorithm, which not only fully profiled users' interests and the relations of topics indirectly reflected in different domains, but also could adaptively track the changes of users' interests. Experimental results show that TBC method has better declustering outcome of users' interests than both the traditional K-Means algorithm and FCM method belonged to the soft clustering, and the TBC algorithm also has higher recommendation quality and better efficiency in personalized recommender services.关键词
主题/兴趣域/聚类/协同过滤Key words
topic/ domain of interests/ clustering/ collaborative filtering分类
信息技术与安全科学引用本文复制引用
龚卫华,杨良怀,金蓉,丁维龙..基于主题的用户兴趣域算法[J].通信学报,2011,32(1):72-78,7.基金项目
浙江省自然科学基金资助项目(Y1080102,Y1090096) （Y1080102,Y1090096）
国家自然科学基金资助项目(60901081) （60901081）
