A maximum entropy approach to collaborative filtering in dynamic, sparse, high-dimensional domains

Advances in Neural Information Processing Systems

Volumn , Issue , 2003, Pages

  Pavlov, Dmitry Y ^a   Pennock, David M ^b  

^a NEC LABORATORIES AMERICA   (United States)

^b Overture Services Inc   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

A-PRIORI PROBABILITIES; CLUSTER BOUNDARIES; COMPETING ALGORITHMS; DIMENSIONALITY REDUCTION; HIGH-DIMENSIONAL; MAXIMUM-ENTROPY APPROACHES; ONLINE REPOSITORIES; USER ACCESS PATTERNS;

EID: 84898943975     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (16)

1. J. Breese, D. Heckerman, and C. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Proceedings of UAI-1998, pages 43-52. San Francisco, CA: Morgan Kaufmann Publishers, 1998.
2. S. Chen and R. Rosenfeld. A Gaussian prior for smoothing maximum entropy models. Technical Report CMUCS -99-108, Carnegie Mellon University, 1999.
3. D. Cosley, S. Lawrence, and D. Pennock. An open framework for practical testing of recom-mender systems using Researchlindex. In International Conference on Very Large Databases (VLDB'02), 2002.
4. E. Glover, D. Pennock, S. Lawrence, and R. Krovetz. Inferring hierarchical descriptions. Technical Report NECI TR 2002-035, NEC Research Institute, 2002.
5. J. Goodman. Classes for fast maximum entropy training. In Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, 2001.
6. D. Heckerman, D. Chickering, C. Meek, R. Rounthwaite, and C. Kadie. Dependency networks for density estimation, collaborative filtering, and data visualization. Journal of Machine Learning Research, 1: 49-75, 2000.
7. T. Hofmann and J. Puzicha. Latent class models for collaborative filtering. In Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, pages 688-693, 1999.
8. S. Lawrence, C. L. Giles, and K. Bollacker. Digital libraries and Autonomous Citation Indexing. IEEE Computer, 32(6): 67-71, 1999.
9. D. Pavlov and D. Pennock. A maximum entropy approach to collaborative filtering in dynamic, sparse, high-dimensional domains. Technical Report NECI TR, NEC Research Institute, 2002.
10. D. Pavlov, A. Popescul, D. Pennock, and L. Ungar. Mixtures of conditional maximum entropy models. Technical Report NECI TR, NEC Research Institute, 2002.
11. S. D. Pietra, V. D. Pietra, and J. Lafferty. Inducing features of random fields. IEEE Transactions on Pattern Analysis and Machine Intelligence, 19(4): 380-393, April 1997.
12. A. Popescul, L. Ungar, D. Pennock, and S. Lawrence. Probabilistic models for unified collaborative and content-based recommendation in sparse-data environments. In Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pages 437-444, 2001.
13. 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.
14. B. Sarwar, G. Karypis, J. Konstan, and J. Riedl. Analysis of recommender algorithms for e-commerce. In Proceedings of the 2nd ACM Conference on Electronic Commerce, pages 158-167, 2000.
15. G. Shani, R. Brafman, and D. Heckerman. An MDP-based recommender system. In Proceedings of the Seventeenth Conference on Uncertainty in Artificial Intelligence, pages 453-460, 2002.
16. U. Shardanand and P. Maes. Social information filtering: Algorithms for automating "Word of mouth". In Proceedings of ACM CHI'95 Conference on Human Factors in Computing Systems, Volume 1, pages 210-217, 1995.