一种基于条件相对平均熵的个性化推荐算法  

A personalized recommendation algorithm based on conditional relative average entropy

作　　者：吴柳[1] 陈萌[1] 石永革[1] 

机构地区：[1]南昌大学信息工程学院,江西南昌330031

出　　处：《河北大学学报（自然科学版）》2016年第4期438-443,共6页Journal of Hebei University(Natural Science Edition)

基　　金：国家自然科学基金资助项目(61163005)

摘　　要：为了提高现有推荐算法的准确性,提出一种基于条件相对平均熵的个性化推荐算法.首先,采用加权的CNM算法构建复杂网络,挖掘该网络的社团结构,作为商品待推荐域;其次,利用条件互信息和条件相对平均熵生成有效的节点次序,以提升贝叶斯网络构建的准确性;然后采用K2算法学习贝叶斯网络,分析出用户的消费性格,并判断待推荐域中商品与消费性格的联系,向用户提供感兴趣和合理的推荐;最后,基于电信运营商的实际数据进行实证分析,验证了该算法的有效性.In order to improve the accuracy of recommendation algorithm, one personalized recommen- dation algorithm based on conditional relative average entropy is presented.First of all, through weighted CNM algorithm we construct complex network and excavate the network＇s community structure. The re- sult is regarded as the uncertain recommendation domain. Further more , conditional mutual information and conditional relative average entropy are used to determine the effective node ordering as input of K2 al- gorithm ,which can improve the accuracy of Bayesian network construction, and then learn Bayesian net- work by K2 algorithm and analyze the consumer characteristics. We use the relationship between the commodity and the consumer characteristics to confirm the recommendation domain.Finally,the empirical analysis of the actual data of the telecom operators is carried out to verify the validity of the above algorithm.

关 键 词：条件相对平均熵 个性化推荐 消费性格 社团结构 

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