基于关联关系的数字家庭服务资源推荐体系  

Recommendation System of Digital Home Service Resources Based on Association Relationships

作　　者：聂规划[1] 游怀杰[1] 孟洁[1] 

机构地区：[1]武汉理工大学经济学院,湖北武汉430070

出　　处：《武汉理工大学学报（信息与管理工程版）》2013年第3期444-447,共4页Journal of Wuhan University of Technology：Information & Management Engineering

基　　金：国家自然科学基金资助项目(71172043;71072077);国家科技支撑计划资助项目(2011BAH16B02);中央高校基本科研业务费专项资金资助项目(2012-YB-20);武汉理工大学教学研究基金资助项目

摘　　要：针对目前在数字家庭服务资源推荐研究中存在的单一性、片面性和弱针对性的问题,通过考虑数字家庭服务资源类型及其用户消费特征,基于Apriori改进算法和时序挖掘技术,提出了在数字家庭中建立结合关联规则和时序关联规则的推荐体系,并对所涉及的关键技术做了详细描述。通过这种方法,用户能够发现其感兴趣的服务资源,这对正处于发展初期的数字家庭推荐系统具有一定的借鉴意义。The singleness,lopsidedness and weak pertinence do exist in the studies of the digital home service recommendation at present.To address this problem,after considering the digital home service resources and consuming characteristics,a recommendation system was proposed based on the modified Apriori algorithm and temporal mining technology,which combines the association rules and temporal association rules.And the relevant key technologies were also specifically described.Through this method,users are able to locate the service resources they have interest in,and it is of significance to the digital home recommendation system which is still at the preliminary stage of development.

关 键 词：数字家庭 服务资源 关联推荐 时序关联 数据挖掘 

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