Abstract
Recommender systems use historical data on user preferences and other available data on users (e.g., demographics) and items (e.g., taxonomy) to predict items a new user might like. Applications of these methods include recommending items for purchase and personalizing the browsing experience on a web-site. Collaborative filtering methods have focused on using just the history of user preferences to make the recommendations. These methods have been categorized as memory-based if they operate over the entire data to make predictions and as model-based if they use the data to build a model which is then used for predictions. In this paper, we propose the use of linear classifiers in a model-based recommender system. We compare our method with another model-based method using decision trees and with memory-based methods using data from various domains. Our experimental results indicate that these linear models are well suited for this application. They outperform the commonly proposed approach using a memory-based method in accuracy and also have a better tradeoff between off-line and on-line computational requirements.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
P. Resnick, N. Iacovou, M. Suchak, P. Bergstrom, and J. Riedl. Grouplens: An open architecture for collaborative filtering of netnews. In Proceedings of CSCW, 1994.
U. Shardanand and P. Maes. Social information filtering: Algorithms for automating word of mouth. In Proceedings of CHI’95, 1995.
J.S. Breese, D. Heckerman, and C. Kadie. Emperical analysis of predictive algorithms for collaborative filtering. In Proceedings of Fourteenth Conference on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 1998.
B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Analysis of recommendation algorithms for e-commerce. In Proceedings ACM E-Commerce 2000 Conference, 2000.
R. Hofmann and V. Tresp. Nonlinear markov networks for continuous variables. In Advances in Neural Information Processing Systems 9, editors: M. Mozer, M. Jordan and T. Petsche. MIT Press, 1997.
D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for collaborative filtering and data visualization. In Proc. of 16th Conf. on Uncertainty in Artificial Intelligence. Morgan Kaufmann, 2000.
L. Ungar and D. Foster. Clustering methods for collaborative filtering. In Workshop on Recommendation Systems at the Fifteenth National Conference on AI, 1998.
L. Ungar and D. Foster. A formal statistical approach to collaborative filtering. In CONALD’98, 1998.
T. Joachims. Text categorization with support vector machines: Learning with many relevant features. In Proceedings of the Tenth European Conference on Machine Learning, pages 137–142, 1998.
C. Blake, E. Keogh, and C.J. Merz. UCI repository of machine learning databases. University of California, Irvine, Dept. of Information and Computer Science, URL=http://www.ics.uci.edu/~mlearn/MLRespository.html, 1998.
S. Glassman. Eachmovie data set. URL=http://research.compaq.com/SRC-/eachmovie/.
Yiming Yang and Christopher G. Chute. An example-based mapping method for text categorization and retrieval. ACM Transactions on Information Systems, 12:252–277, 1994.
B.D. Ripley. Pattern recognition and neural networks. Cambridge university press, 1996.
A.E. Hoerl and R.W. Kennard. Ridge regression: Biased estimation for nonorthogonal problems. Technometrics, 12(1):55–67, 1970.
C. Cortes and V.N. Vapnik. Support vector networks. Machine Learning, 20: 273–297, 1995.
V.N. Vapnik. Statistical learning theory. John Wiley & Sons, New York, 1998.
John C. Platt. Fast training of support vector machines using sequential minimal optimization. In Bernhard Scholkopf, Christopher J.C. Burges, and Alex J. Smola, editors, Advances in Kernel Methods: Support Vector Learning, chapter 12. The MIT press, 1999.
F.M.J. Willems, Y.M. Shtarkov, and T.J. Tjalkens. The context tree weighting method: basic properties. IEEE Trans. on Inform. Theory, 41(3):653–664, 1995.
Tong Zhang. Compression by model combination. In Proceedings of IEEE Data Compression Conference, DCC’98, pages 319–328, 1998.
M. Kearns and Y. Mansour. A fast, bottom-up decision tree pruning algorithm with near optimal generalization. In Proceedings of the 15th International Conference on Machine Learning, pages 269–277, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Iyengar, V.S., Zhang, T. (2001). Empirical Study of Recommender Systems Using Linear Classifiers. In: Cheung, D., Williams, G.J., Li, Q. (eds) Advances in Knowledge Discovery and Data Mining. PAKDD 2001. Lecture Notes in Computer Science(), vol 2035. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45357-1_5
Download citation
DOI: https://doi.org/10.1007/3-540-45357-1_5
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41910-5
Online ISBN: 978-3-540-45357-4
eBook Packages: Springer Book Archive