This alert has been successfully added and will be sent to:
You will be notified whenever a record that you have chosen has been cited.
To manage your alert preferences, click on the button below.
We treat collaborative filtering as a univariate time series problem: given a user's previous votes, predict the next vote. We describe two families of methods for transforming data to encode time order in ways amenable to off-the-shelf classification and density estimation tools. Using a decision-tree learning tool and two real-world data sets, we compare the results of these approaches to the results of collaborative filtering without ordering information. The improvements in both predictive accuracy and in recommendation quality that we realize advocate the use of predictive algorithms exploiting the temporal order of data.
Ricardo Baeza-Yates and Berthier Ribeiro-Neto. Modern Information Retrieval. Addison-Wesley Publishing Co., Reading, MA, 1999.
John S. Breese, David Heckerman, and Carl Kadie. Empirical analysis of predictive algorithms for collaborative filtering. Technical Report MSR-TR- 98-12, Microsoft Research, Redmond, WA, May 1998.
P. Cheeseman and J. Stutz. Advances in Knowledge Discovery and Data Mining, chapter Bayesian Classification (AutoClass): Theory and Results, pages 153-180. AAAI Press, Menlo Park, CA, 1995.
Stanley F. Chen and Joshua Goodman. An empirical study of smoothing techniques for language modeling. In Proceedings of the 34th Annual Meeting of the ACL, pages 310-318, June 1996. Santa Cruz, California.
D.M. Chickering and D. Heckerman. Fast learning from sparse data. In Proceedings of Fifteenth Conference on Uncertainty in Artificial Intelligence, Stockholm, Sweden, pages 109-115. Morgan Kaufmann, 1999.
D.M. Chickering, D. Heckerman, and C. Meek. A Bayesian approach to learning Bayesian networks with local structure. In Proceedings of Thirteenth Conference on Uncertainty in Artificial Intelligence , Providence, RI, pages 80-89. Morgan Kaufmann, August 1997.
A. P. Dempster, N. M. Laird, and D. B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, Series B, 39:1-38, 1977.
David Heckerman, David Maxwell Chickering, Christopher Meek, Robert Rounthwaite, and Carl Kadie. Dependency networks for inference, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1:49-75, October 2000.
Thomas Hofmann and Jan Puzicha. Latent class models for collaborative filtering. In Proceedings of IJCAI, 1999.
Bernardo A. Huberman, Peter L. T. Pirolli, James E. Pitkow, and Rajan M. Lukose. Strong regularities in world wide web surfing. Science, 280(5360):95-97, 1998.
Joseph A. Konstan, Bradley N. Miller, David Maltz, Jonathan L. Herlocker, Lee R. Gordon, and John Riedl. GroupLens: Applying collaborative filtering to Usenet news. Communications of the ACM, 40(3):77-87, March 1997.
M. C. Mozer. Neural net architectures for temporal sequences processing. In A. S. Weigend and N. A. Gershenfeld, editors, Time series prediction: Forecasting the future and understanding the past, volume 15, pages 243-264. Addison Wesley, Reading, MA, 1993.
Paul Resnick, Neophytos Iacovou, Mitesh Suchak, Peter Bergstrom, and John 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, NC, 1994.