首页 | 本学科首页   官方微博 | 高级检索  
     

基于主题的用户兴趣域算法
引用本文:龚卫华,杨良怀,金 蓉,丁维龙. 基于主题的用户兴趣域算法[J]. 通信学报, 2011, 32(1): 72-78
作者姓名:龚卫华  杨良怀  金 蓉  丁维龙
作者单位:1. 浙江工业大学,计算机学院,浙江,杭州,310023
2. 浙江理工大学,计算机教研部,浙江,杭州,310018
基金项目:浙江省自然科学基金资助项目,国家自然科学基金资助项目
摘    要:针对用户兴趣偏好多变问题,提出一种兴趣特征权重随时间而变化的迭代计算方法。构造了用户兴趣特征与主题类间的二部图关系,并在此基础上提出了一种基于主题的用户兴趣聚类算法(TBC),改变了聚类对象"非此即彼"的硬划分方式。该算法所形成的基于主题的用户兴趣域结构,不仅充分表达了用户的多域兴趣特征和域间主题的联系,还能适应用户兴趣变化。实验表明,TBC算法比传统的K-Means算法以及属于软划分方式的FCM聚类具有更好的用户兴趣划分效果,并且在个性化推荐服务中表现出更高的推荐质量和效率。

关 键 词:主题  兴趣域  聚类  协同过滤

Domain of interests clustering algorithm based on users' Preferred topics
GONG Wei-hua,YANG Liang-huai,JIN Rong,DING Wei-long. Domain of interests clustering algorithm based on users' Preferred topics[J]. Journal on Communications, 2011, 32(1): 72-78
Authors:GONG Wei-hua  YANG Liang-huai  JIN Rong  DING Wei-long
Affiliation:GONG Wei-hua1,YANG Liang-huai1,JIN Rong2,DING Wei-long1(1.College of Computer Science and Technology,Zhejiang University of Technology,Hangzhou 310023,China,2.Department of Computer Teaching&Research,Zhejiang University of Science and Technology,Hangzhou 310018,China)
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 partit...
Keywords:topic  domain of interests  clustering  collaborative filtering  
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《通信学报》浏览原始摘要信息
点击此处可从《通信学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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