Instance-Based Learning Algorithms
Machine Learning
Selecting typical instances in instance-based learning
ML92 Proceedings of the ninth international workshop on Machine learning
GroupLens: an open architecture for collaborative filtering of netnews
CSCW '94 Proceedings of the 1994 ACM conference on Computer supported cooperative work
Social information filtering: algorithms for automating “word of mouth”
CHI '95 Proceedings of the SIGCHI Conference on Human Factors in Computing Systems
Reduction Techniques for Instance-BasedLearning Algorithms
Machine Learning
Instance Selection and Construction for Data Mining
Instance Selection and Construction for Data Mining
Learning Collaborative Information Filters
ICML '98 Proceedings of the Fifteenth International Conference on Machine Learning
Collaborative Filtering by Personality Diagnosis: A Hybrid Memory and Model-Based Approach
UAI '00 Proceedings of the 16th Conference on Uncertainty in Artificial Intelligence
Recommender systems using linear classifiers
The Journal of Machine Learning Research
Empirical analysis of predictive algorithms for collaborative filtering
UAI'98 Proceedings of the Fourteenth conference on Uncertainty in artificial intelligence
Data Mining for Web Intelligence
Computer
| Hi-index | 0.00 |
The application range of memory-based collaborative filtering (CF) is limited due to CF's high memory consumption and long runtime. The approach presented in this paper removes redundant and inconsistent instances (users) from the data. This paper aims to distinguish informative instances (users) from large raw user preference database and thus alleviate the memory and runtime cost of the widely used memory-based collaborative filtering (CF) algorithm. Our work shows that a satisfactory accuracy can be achieved by using only a small portion of the original data set, thereby alleviating the storage and runtime cost of the CF algorithm. In our approach, we consider instance selection as the problem of selecting informative data that increase the We begin by discussing the instance selection problem in a general sense that is to increase a posteriori probability of the optimal model by selecting informative data. We evaluate the empirical performance of our approach PF on two real-world data sets and attain very promisingpositive experimental results. The dData size and the prediction time are significantly reduced, while the prediction accuracy is on a par with almost the same as the results achieved by using the complete database.