Abstract
The basic objective of a Collaborative Filtering (CF) algorithm is to suggest items to a particular user based on his/her preferences and users with similar interests. Although, there is an apparently strong demand for CF techniques, and many algorithms have been recently proposed, very few articles comparing these techniques can be found. Our paper is oriented towards the study of a sample of algorithms to representing differents stages in the evolutive process of CF.
Experiments were conducted on two datasets with different characteristics, using two protocols and three evaluation metrics for the different algorithms. The results indicate that, in general, the Online-Learning (WMA, MWM) and the Support Vector Machines algorithms have a better performance that the other algorithms, on both datasets. Considering the amount of information, the less sparse such information is, the higher the coverage and accuracy of general models tend to be; however, the behavior under sparse data is closer to what is observed in a real system if we have in mind that users usually rate an amount of records much smaller than the total available.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D. Billsus and M. Pazzani. Learning collaborative information filters. In Proceedings of the Fifteenth International Conference on Machine Learning, pages 43–52, 1998.
Avrim Blum. Empirical support for winnow and weighted-majority algorithms: Results on a calendar scheduling domain. Proc. 12th International Conference on Machine Learning, (240):265–23, 1997.
J. S. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence, Madison, WI, pages 43–52. Morgan Kaufman Eds., 1998.
M. Brown, W. Grundy, D. Lin, N. Cristianini, C. Sugnet, M. Ares, and D. Haussler. Support vector machine classification of microarray gene expression data. Technical report UCSC-CRL99-09, Department of Computer Science, University of California, Santa Cruz, 1999.
C. Burgues. A tutorial on Support Vector Machines for Pattern Recognition. Kluwer Academic Publishers, Boston, 1998.
C. Chang and C. Lin. Libsvm: a library for support vector machines (version 2.33). Technical report, Department of Computer Science and Information Engineering, National Taiwan University.
J. Delgado and N. Ishii. Memory-based weighted-majority prediction for recom-mender systems. In Proceedings of the ACM SIGIR-99, Recommender Systems Workshop, August 1999, UC Berkeley, pages 1–5, 1999.
D. Fisher, K. Hildrum, J. Hong, M. Newman, M. Thomas, and R. Vuduc. Swami (poster session): a framework for collaborative filtering algorithm development and evaluation. In Proceedings of the 22nd Annual International ACM SIGIR, 2000, Athens, Greece, pages 366–368. ACM, 2000.
K. Goldberg, T. Roeder, D. Gupta, and C. Perkins. Eigentaste: A constant time collaborative filtering algorithm. Technical report m00/41., University of California, Berkeley, 2000.
D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for inference, collaborative filtering and data visualization. Journal of Machine Learning Research, 1:49–75, 2000.
J. L. Herlocker, J. A. Konstan, A. Borchers, and J. Riedl. An algorithmic framework for performing collaborative filtering. In Proceedings of the 22nd Annual International ACM SIGIR, August 15–19, 1999, Berkeley, CA, USA, pages 230–237. ACM, 1999.
T. Hofmann and J. Puzicha. Latent class model from collaborative filtering. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence. Morgan Kaufman Eds., 1999.
N. Littelstone and M. K. Warmuth. The weighted-majority algorithm. Information and Computation, 108(2):212–261, 1994.
P. McJonese. Eachmovie collaborative filtering data set. DEC Systems Research Center., 1997.
P. Resnick, N. Iacovou, M. Suchak, P. Bergstorm, and J. Riedl. GroupLens: An Open Architecture for Collaborative Filtering of Netnews. In Proceedings of ACM 1994 Conference on Computer Supported Cooperative Work, pages 175–186, Chapel Hill, North Carolina, 1994. ACM.
A. Shein and L. Popescul, A.and Ungar. Pennaspect: A two-way aspect model implementation. Technical Report MS-CIS-01-25, The University of Pennsylvania., 2001.
I. Witten and E. Frank. Data Mining, Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann Publishers, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González-Caro, C.N., Calderón-Benavides, M.L., Pérez-Alcázar, J.d.J., García-Díaz, J.C., Delgado, J. (2002). Towards a More Comprehensive Comparison of Collaborative Filtering Algorithms. In: Laender, A.H.F., Oliveira, A.L. (eds) String Processing and Information Retrieval. SPIRE 2002. Lecture Notes in Computer Science, vol 2476. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45735-6_22
Download citation
DOI: https://doi.org/10.1007/3-540-45735-6_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-44158-8
Online ISBN: 978-3-540-45735-0
eBook Packages: Springer Book Archive