Adaptive KNN based Recommender System through Mining of User Preferences

被引:58
作者
Subramaniyaswamy, V. [1 ]
Logesh, R. [1 ]
机构
[1] SASTRA Univ, Sch Comp, Thanjavur, India
关键词
Recommender system; Personalization; Adaptive KNN; Ontology; Web mining; Clustering; NEAREST-NEIGHBOR CLASSIFIERS;
D O I
10.1007/s11277-017-4605-5
中图分类号
TN [电子技术、通信技术];
学科分类号
0809 ;
摘要
Research for the generation of reliable recommendations has been the main goal focused by many researchers in recent years. Though many recommendation approaches have been developed to assist users in the selection of their interesting items in the online world, still the personalization problem exists. In this paper, we present a new recommendation approach to address the problems such as scalability, sparsity, and cold-start in a collective way. We have developed a knowledge-based domain specific ontology for the generation of personalized recommendations. We have also introduced two different ontology-based predictive models as minion representation model and prominent representation model for the effective generation of recommendations to all types of users. The prediction models are induced by data mining algorithms by correlating the user preferences and features of items for user modeling. We have proposed a new variant of KNN algorithm as Adaptive KNN for the collaborative filtering based recommender system. The proposed recommendation approach is validated with standard MovieLens dataset and obtained results are evaluated with Precision, Recall, F-Measure, and Accuracy. The experimental results had proved the better performance of our proposed AKNN algorithm over other algorithms with the highly sparse data taken for the recommendation generation.
引用
收藏
页码:2229 / 2247
页数:19
相关论文
共 51 条
[1]   Burn Depth Analysis Using Multidimensional Scaling Applied to Psychophysical Experiment Data [J].
Acha, Begona ;
Serrano, Carmen ;
Fondon, Irene ;
Gomez-Cia, Tomas .
IEEE TRANSACTIONS ON MEDICAL IMAGING, 2013, 32 (06) :1111-1120
[2]   Ensembling evidential k-nearest neighbor classifiers through multi-modal perturbation [J].
Altincay, Hakan .
APPLIED SOFT COMPUTING, 2007, 7 (03) :1072-1083
[3]  
[Anonymous], 1999, P ACM SIGIR WORKSH R
[4]  
[Anonymous], 2001, WWW, DOI 10.1145/371920.372071
[5]  
[Anonymous], 2001, P 3 INT WORKSH WEB I, DOI [10.1145/502932.502935, DOI 10.1145/502933.502935]
[6]   About Neighborhood Counting Measure Metric and Minimum Risk Metric [J].
Argentini, Andrea ;
Blanzieri, Enrico .
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2010, 32 (04) :763-765
[7]   A hybrid content-based and item-based collaborative filtering approach to recommend TV programs enhanced with singular value decomposition [J].
Belen Barragans-Martinez, Ana ;
Costa-Montenegro, Enrique ;
Burguillo, Juan C. ;
Rey-Lopez, Marta ;
Mikic-Fonte, Fernando A. ;
Peleteiro, Ana .
INFORMATION SCIENCES, 2010, 180 (22) :4290-4311
[8]   E-commerce recommendation applications [J].
Ben Schafer, J ;
Konstan, JA ;
Riedl, J .
DATA MINING AND KNOWLEDGE DISCOVERY, 2001, 5 (1-2) :115-153
[9]  
Bhatia N, 2010, Survey of nearest neighbor techniques
[10]  
Billsus D., 1998, Machine Learning. Proceedings of the Fifteenth International Conference (ICML'98), P46