Fully automatic cross-associations

KDD-2004 - Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2004, Pages 79-88

  Chakrabarti, Deepayan ^a   Modha, Dharmendra S ^b   Papadimitriou, Spiros ^a   Faloutsos, Christos ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

^b IBM ALMADEN RESEARCH CENTER   (United States)

Author keywords

Cross Association; Information Theory; MDL

Indexed keywords

APPROXIMATION THEORY; DATA ACQUISITION; INFORMATION THEORY; MATRIX ALGEBRA; PRINCIPAL COMPONENT ANALYSIS; PROBABILITY DISTRIBUTIONS; WORLD WIDE WEB;

BINARY DATA; CROSS-ASSOCIATION; INFORMATION CO-CLUSTERING (ITCC); MDL;

DATA MINING;

EID: 12244296737     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1014052.1014064     Document Type: Conference Paper

References (32)

1. D. Pelleg and A. Moore, "X-means: Extending K-means with efficient estimation of the number of clusters," in Proc. 17th ICML, pp. 727-734, 2000.
2. G. Hamerly and C. Elkan, "Learning the k in k-means," in Proc. 17th NIPS, 2003.
3. B. Zhang, M. Hsu, and U. Dayal, "K-harmonic means - a spatial clustering algorithm with boosting," in Proc. 1st TSDM, pp. 31-45, 2000.
4. I. S. Dhillon and D. S. Modha, "Concept decompositions for large sparse text data using clustering," Mach. Learning, vol. 42, pp. 143-175, 2001.
5. S. Guha, R. Rastogi, and K. Shim, "CURE: an efficient clustering algorithm for large databases," in Proc. SIGMOD, pp. 73-84, 1998.
6. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases," in Proc. SIGMOD, pp. 103-114, 1996.
7. G. Karypis, E.-H. Han, and V. Kumar, "Chameleon: Hierarchical clustering using dynamic modeling," IEEE Computer, vol. 32, no. 8, pp. 68-75, 1999.
8. A. Hinneburg and D. A. Keim, "An efficient approach to clustering in large multimedia databases with noise," in Proc. 4th KDD, pp. 58-65, 1998.
9. J. Han and M. Kamber, Data Mining: Concepts and Techniques. Morgan Kaufmann, 2000.
10. I. S. Dhillon, S. Mallela, and D. S. Modha, "Information-theoretic co-clustering," in Proc. 9th KDD, pp. 89-98, 2003.
11. M. M. Madiman, M. Harrison, and I. Kontoyiannis, "A minimum description length proposal for lossy data compression," in Proc. IEEE ISIT, 2004.
12. N. Friedman, O. Mosenzon, N. Slonim, and N. Tishby, "Multivariate information bottleneck," in Proc. 17th UAI, pp. 152-161, 2001.
13. R. Agrawal and R. Srikant, "Fast algorithms for mining association rules in large databases," in Proc. 20th VLDB, pp. 487-499, 1994.
14. J. Han, J. Pel, Y. Yin, and R. Mao, "Mining frequent patterns without candidate generation: A frequent-pattern tree approach," Data Min. Knowl. Discov., vol. 8, no. 1, pp. 53-87, 2004.
15. A. Tuzhilin and G. Adomavicius, "Handling very large numbers of association rules in the analysis of microarray data," in Proc. 8th KDD, 2002.
16. S. Deerwester, S. T. Dumais, G. W. Fumas, T. K. Landauer, and R. Harshman, "Indexing by latent semantic analysis," JASI, vol. 41, pp. 391-407, 1990.
17. T. G. Kolda and D. P. O'Leary, "A semidiscrete matrix decomposition for latent semantic indexing information retrieval," ACM Transactions on Information Systems, vol. 16, no. 4, pp. 322-346, 1998.
18. T. Hofmann, "Probabilistic latent semantic indexing," in Proc. 22nd SIGIR, pp. 50-57, 1999.
19. C. H. Papadimitriou, P. Raghavan, H. Tamaki, and S. Vempala, "Latent semantic indexing: A probabilistic analysis," in Proc. 17th PODS, 1998.
20. G. Karypis and V. Kumar, "Multilevel algorithms for multi-constraint graph partitioning," in Proc. SC98, pp. 1-13, 1998.
21. A. Y. Ng, M. I. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in Proc. NIPS, pp. 849-856, 2001.
22. N. Mishra, D. Ron, and R. Swaminathan, "On finding large conjunctive clusters," in Proc. 16th COLT, 2003.
23. P. K. Reddy and M. Kitsuregawa, "An approach to relate the web communities through bipartite graphs," in Proc. 2nd WISE, pp. 302-310, 2001.
24. C. Tang and A. Zhang, "Mining multiple phenotype structures underlying gene expression profiles," in Proc. CIKM03, pp. 418-425, 2003.
25. J. Rissanen, "Modeling by shortest data description," Automatica, vol. 14, pp. 465-471, 1978.
26. J. Rissanen, "Generalized Kraft inequality and arithmetic coding," IBM J. Res. Dev., vol. 20, no. 3, pp. 198-203, 1976.
27. J. Rissanen and G. G. Langdon Jr., "Arithmetic coding," IBM J. Res. Dev., vol. 23, pp. 149-162, 1979.
28. I. H. Witten, R. Neal, and J. G. Cleary, "Arithmetic coding for data compression," Comm. ACM, vol. 30, no. 6, pp. 520-540, 1987.
29. J. Rissanen, "Universal prior for integers and estimation by minimum description length," Annals of Statistics, vol. 11, no. 2, pp. 416-431, 1983.
30. D. J. Watts, Small Worlds: The Dynamics of Networks between Order and Randomness. Princeton Univ. Press, 1999.
31. M. Richardson, R. Agrawal, and P. Domingos, "Trust management for the semantic web," in Proc. 2nd ISWC, pp. 351-368, 2003.
32. A. L. Montgomery and C. Faloutsos, "Identifying web browsing trends and patterns," IEEE Computer, vol. 34, no. 7, pp. 94-95, 2001.