Sequential information bottleneck for finite data

Proceedings, Twenty-First International Conference on Machine Learning, ICML 2004

Volumn , Issue , 2004, Pages 647-654

  Peltonen, Jaakko ^a   Sinkkonen, Janne ^a   Kaski, Samuel ^a,b  

^a AALTO UNIVERSITY   (Finland)

^b UNIVERSITY OF HELSINKI   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; INFORMATION THEORY; LEARNING SYSTEMS; OPTIMIZATION; SET THEORY; STATISTICAL METHODS; TEXT PROCESSING;

BAYES FACTORS; CO-OCCURENCE DATA; SEQUENTIAL INFORMATION BOTTLENECK (SIB); SPARSE SET;

INFORMATION ANALYSIS;

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

References (13)

1. Blei, D., Ng, A. Y., & Jordan, M. I. (2003). Latent Dirichlet allocation. Journal of Machine Learning Research, 3, 993-1022.
2. Buntine, W. (2002). Variational extensions to EM and multinomial PCA. In T. Elomaa, H. Mannila and H. Toivonen (Eds.), Proceedings of the ECML'02, 13th European Conference on Machine Learning, Lecture Notes in Artificial Intelligence 2430, 23-34. Berlin: Springer.
3. Gilula, Z. (1986). Grouping and association in contingency tables: An exploratory canonical correlation approach. Journal of the American Statistical Association, 81, 773-779.
4. Good, I. J. (1976). On the application of symmetric Dirichlet distributions and their mixtures to contingency tables. Annals of Statistics, 4, 1159-1189.
5. Hofmann, T. (1999). Probabilistic latent semantic analysis. In Proceedings of the Fifteenth Conference on Uncertainty in Artificial Intelligence, 289-296. San Francisco, CA: Morgan Kaufmann Publishers.
6. Hofmann, T., & Puzicha, J. (1998). Statistical models for co-occurrence data (A.I. Memo 1625). MIT.
7. Lang, K. (1995). NewsWeeder: Learning to filter net-news. In Proceedings of the 12th International Conference on Machine Learning, 331-339. San Mateo, CA: Morgan Kaufmann Publishers.
8. Peltonen, J., Sinkkonen, J., & Kaski, S. (2003). Finite sequential information bottleneck (fsIB) (Technical Report A74). Helsinki University of Technology, Publications in Computer and Information Science, Espoo, Finland.
9. Rao, C. R. (1973). Linear statistical inference and its applications. Wiley. 2nd edition, Originally published 1965.
10. Sinkkonen, J., Kaski, S., & Nikkilä, J. (2002). Discriminative clustering: Optimal contingency tables by learning metrics. In T. Elomaa, H. Mannila and H. Toivonen (Eds.), Proceedings of the ECML'02, 13th European Conference on Machine Learning, 418-430. Berlin: Springer.
11. Slonim, N., Friedman, N., & Tishby, N. (2002). Un-supervised document classification using sequential information maximization. In Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, 129-136. ACM Press.
12. Slonim, N., & Weiss, Y. (2002). Maximum likelihood and the information bottleneck. In Advances in neural information processing systems 14. Cambridge, MA: MIT Press.
13. Tishby, N., Pereira, F. C., & Bialek, W. (1999). The information bottleneck method. In 37th Annual Allerton Conference on Communication, Control, and Computing, 368-377. Urbana, Illinois.