Non-redundant data clustering

Proceedings - Fourth IEEE International Conference on Data Mining, ICDM 2004

Volumn , Issue , 2004, Pages 75-82

  Gondek, David ^a   Hofmann, Thomas ^a  

^a Brown Univerity   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA CLUSTERING; INFORMATION BOTTLENECKS; MUTUAL INFORMATION; TEXT MINING;

COMPUTER VISION; CONSTRAINT THEORY; INFORMATION MANAGEMENT; MATRIX ALGEBRA; OPTIMIZATION; RANDOM PROCESSES; SET THEORY;

DATA MINING;

EID: 19544376987     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2004.10104     Document Type: Conference Paper

References (15)

1. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. In Proc. 8th SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining, 2002.
2. G. Chechik and N. Tishby. Extracting relevant structures with side information. In Advances in Neural Information Processing Systems 15 (NIPS '02), 2002.
3. M. Craven, D. DiPasquo, D. Freitag, A. K. McCallum, T. M. Mitchell, K. Nigam, and S. Slattery. Learning to extract symbolic knowledge from the World Wide Web. In Proc. of the 15th Conf. of the American Association for Artificial Intelligence, pages 509-516, 1998.
4. N. Friedman, O. Mosenzon, N. Slonim, and N. Tishby. Multivariate information bottleneck. In Proceedings of the 17th Conference on Uncertainty in Artificial Intelligence, 2001.
5. D. Gondek and T. Hofmann. Conditional information bottleneck clustering. In 3rd IEEE International Conference on Data Mining, Workshop on Clustering Large Data Sets, 2003.
6. D. Klein, S. D. Kamvar, and C. D. Manning. From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In Proceedings of the Nineteenth International Conference on Machine Learning, 2002.
7. P. McCullagh and J. Nelder. Generalized Linear Models. Chapman & Hall, London, U.K., 1989.
8. R. T. Ng, L. V. Lakshmanan, J. Han, and A. Pang. Exploratory mining and pruning optimizations of constrained association rule. In Proceedings of ACM SIGMOND, pages 13-24, 1998.
9. K. Nigam, A. K. McCallum, S. Thrun, and T. M. Mitchell. Text classification from labeled and unlabeled documents using EM. Machine Learning, 39(2/3): 103-134, 2000.
10. K. Rose. Deterministic annealing for clustering, compression, classification, regression, and related optimization problems, 1998.
11. N. Tishby, F. C. Pereira, and W. Bialek. The information bottleneck method. In Proceedings of the 37-th Annual Allerton Conference on Communication, Control and Computing, pages 368-377, 1999.
12. A. Tung, R. Ng, J. Han, and L. Lakshmanan. Constraint-based clustering in large databases. In Proceedings 2001 International Conference on Database Theory, pages 405-419, 2001.
13. K. Wagstaff and C. Cardie. Clustering with instance-level constraints. In Proc. of the Seventeenth International Conference on Machine Learning, pages 1103-1110, 2000.
14. E. P. Xing, A. Y. Ng, M. I. Jordan, and S. Russell. Distance metric learning, with application to clustering with side-information. In Advances in Neural Information Processing Systems, 2003.
15. S. Zhong and J. Ghosh. Model-based clustering with soft balancing. In Proc. 3rd IEEE Int. Conf. Data Mining, pages 459-166, 2003.