A comparison of collaborative-filtering recommendation algorithms for e-commerce

被引:184
|
作者
Huang, Zan
Zeng, Daniel
Chen, Hsinchen
机构
[1] Penn State Univ, Smeal Coll Business, Dept Supply Chain & Informat Syst, University Pk, PA 16802 USA
[2] Univ Arizona, Dept Management Informat Syst, Tucson, AZ 85721 USA
基金
美国国家科学基金会; 中国国家自然科学基金;
关键词
D O I
10.1109/MIS.2007.4338497
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Various Collaborative Filtering (CF) recommendation algorithms characterize consumers and products by the data available about consumer-product interactions in e-commerce applications. The user-based algorithm predicts a target consumer's future transactions by aggregating the observed transactions of similar consumers. The item-based algorithm computes product similarities instead of consumer similarities and gives the products' potential scores for reach consumer. The generative-model algorithm uses latent class variables to explain the patterns of interactions between consumers and products. The spreading-activation algorithm addresses the sparsity problem by exploring transitive associations between consumers and products in a bipartite consumer-product graph. The link-analysis algorithms adapts Hypertext-Induced Topic Selection (HITS) algorithm in the recommendation context.
引用
收藏
页码:68 / 78
页数:11
相关论文
共 50 条