Generalization in clustering with unobserved features

Advances in Neural Information Processing Systems

Volumn , Issue , 2005, Pages 683-690

  Krupka, Eyal ^a   Tishby, Naftali ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COLLABORATIVE FILTERING; FINITE SAMPLES; LEARNING SCHEMES; RANDOM SUBSETS; TECHNICAL CONDITIONS; UNOBSERVED FEATURES;

SAMPLING;

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

References (10)

1. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: a review. ACM Computing Surveys, 31(3):264-323, September 1999.
2. T. M. Cover and J. A. Thomas. Elements Of Information Theory. Wiley Interscience, 1991.
3. V. N. Vapnik. Statistical Learning Theory. Wiley, 1998.
4. N. Tishby, F. Pereira, and W. Bialek. The information bottleneck method. Proc. 37th Allerton Conf. on Communication and Computation, 1999.
5. M. Seeger. Learning with labeled and unlabeled data. Technical report, University of Edinburgh, 2002.
6. M. Szummer and T. Jaakkola. Information regularization with partially labeled data. In NIPS, 2003.
7. W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58:13-30, 1963.
8. E. Krupka and N. Tishby. Generalization in clustering with unobserved features. Technical report, Hebrew University, 2005. http://www.cs.huji.ac.il/ ∼tishby/nips2005tr.pdf.
9. L. Paninski. Estimation of entropy and mutual information. Neural Computation, 15:1101-1253, 2003.
10. B. Marlin. Collaborative filtering: A machine learning perspective. Master's thesis, University of Toronto, 2004.