Generalization from observed to unobserved features by clustering

Journal of Machine Learning Research

Volumn 9, Issue , 2008, Pages 339-370

  Krupka, Eyal ^a   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

Clustering; Generalization in clustering; Information bottleneck; Learning theory; Unobserved features

Indexed keywords

MATHEMATICAL MODELS; MAXIMUM LIKELIHOOD; SET THEORY; THEOREM PROVING;

GENERALIZATION IN CLUSTERING; INFORMATION BOTTLENECK; LEARNING THEORY; UNOBSERVED FEATURES;

CLUSTERING ALGORITHMS;

EID: 41549150635     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Article

References (29)

1. R. K. Ando and T. Zhang. A framework for learning predictive structures from multiple tasks and unlabeled data. Journal of Machine Learning Research, 6, 2005.
2. J. Blitzer, A. Globerson, and F. Pereira. Distributed latent variable models of lexical co-occurrences. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2005.
3. J.S. Breese, D. Heckerman, and K. Kadie. Empirical analysis of predictive algorithms for collaborative filtering. In Conference on Uncertainty in Artificial Intelligence (UAI), 1998.
4. R. Caruana and V. R. de Sa. Promoting poor features to supervisors: Some inputs work better as outputs. In Advances in Neural Information Processing Systems (NIPS), 1997.
5. G. Chechik and N. Tishby. Extracting relevant structures with side information. In Advances in Neural Information Processing Systems (NIPS), 2002.
6. T. M. Cover and J. A. Thomas. Elements Of Information Theory. Wiley Interscience, 1991.
7. A. Dempster, N. Laird, and D. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society B, 1977.
8. G. Elidan and N. Friedman. The information bottleneck EM algorithm. In Conference on Uncertainty in Artificial Intelligence (UAI), 2003.
9. N. Friedman, O. Mosenzon, N. Slonim, and N. Tishby. Multivariate information bottleneck. In Conference on Uncertainty in Artificial Intelligence (UAI), 2001.
10. A. Globerson and S. Roweis. Nightmare at test time: robust learning by feature deletion. In International Conference on Machine Learning (ICML), 2006.
11. D. Gondek and T. Hofmann. Non-redundant data clustering. In Fourth IEEE International Conference on Data Mining (ICDM). IEEE Computer Society, 2004.
12. T. S. Han. Nonnegative entropy measures of multivariate symmetric correlations. Information and Control, 36:133-156, 1978.
13. A. K. Jain, M. N. Murty, and R J. Flynn. Data clustering: a review. ACM Computing Surveys, 31 (3):264-323, September 1999.
14. J. Kleinberg. An impossibility theorem for clustering. In Advances in Neural Information Processing Systems (NIPS), 2002.
15. E. Krupka and N. Tishby. Generalization in clustering with unobserved features. In Advances in Neural Information Processing Systems (NIPS), 2005.
16. E. Krupka and N. Tishby. Incorporating prior knowledge on features into learnning. In International Conference on Artificial Intelligence and Statistics (AISTATS), 2007.
17. E. Krupka, A. Navot, and N. Tishby. Learning to select features using their properties. Journal of Machine Learning Research, submitted.
18. K. Lang. Learning to filter netnews. Proc. 12th International Conf. on Machine Learning, pages 331-339, 1995.
19. S. P. Lloyd. Least squares quantization in pcm. Technical report, Bell Laboratories, 1957. Published in 1982 in IEEE Transactions on Information Theory 28, 128-137.
20. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Fifth Berkeley Symposium on Mathematical Statistics and Probability, 1967.
21. B. Marlin. Collaborative filtering: A machine learning perspective. Master's thesis, University of Toronto, 2004.
22. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15:1101-1253, 2003.
23. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, 1988.
24. M. Seeger. Learning with labeled and unlabeled data. Technical report, University of Edinburgh, 2002.
25. M. Szummer and T. Jaakkola. Information regularization with partially labeled data. In Advances in Neural Information Processing Systems (NIPS), 2003.
26. N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method. Proc. 37th Allerton Conf. on Communication and Computation, 1999.
27. L. H. Ungar and D. P. Foster. Clustering methods for collaborative filtering. In Workshop on Recommender Systems at the 15th National Conference on Artificial Intelligence., 1998.
28. V. N. Vapnik. Statistical Learning Theory. Wiley, 1998.
29. U. von Luxburg and S. Ben-David. Towards a statistical theory of clustering. In PASCAL Workshop on Statistics and Optimization of Clustering, 2005.