Explaining collaborative filtering recommendations
CSCW '00 Proceedings of the 2000 ACM conference on Computer supported cooperative work
Optimization of Association Word Knowledge Base through Genetic Algorithm
DaWaK 2000 Proceedings of the 4th International Conference on Data Warehousing and Knowledge Discovery
Evaluating collaborative filtering recommender systems
ACM Transactions on Information Systems (TOIS)
Enhancing digital libraries with TechLens+
Proceedings of the 4th ACM/IEEE-CS joint conference on Digital libraries
K-means clustering via principal component analysis
ICML '04 Proceedings of the twenty-first international conference on Machine learning
EMNLP '03 Proceedings of the 2003 conference on Empirical methods in natural language processing
Improving Prediction Quality in Collaborative Filtering Based on Clustering
WI-IAT '08 Proceedings of the 2008 IEEE/WIC/ACM International Conference on Web Intelligence and Intelligent Agent Technology - Volume 01
Context-based recommendation service in ubiquitous commerce
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part II
A user-item relevance model for log-based collaborative filtering
ECIR'06 Proceedings of the 28th European conference on Advances in Information Retrieval
Hi-index | 0.00 |
Ubiquitous recommendation systems predict new items of interest for a user, based on predictive relationship discovered between the user and other participants in Ubiquitous Commerce. In this paper, optimal associative neighbor mining, using attributes, for the purpose of improving accuracy and performance in ubiquitous recommendation systems, is proposed. This optimal associative neighbor mining selects the associative users that have similar preferences by extracting the attributes that most affect preferences. The associative user pattern comprising 3-AUs (groups of associative users composed of 3-users), is grouped through the ARHP algorithm. The approach is empirically evaluated, for comparison with the nearest-neighbor model and k-means clustering, using the MovieLens datasets. This method can solve the large-scale dataset problem without deteriorating accuracy quality.