Bregman bubble clustering: A robust, scalable framework for locating multiple, dense regions in data

Proceedings - IEEE International Conference on Data Mining, ICDM

Volumn , Issue , 2006, Pages 232-243

  Gupta, Gunjan ^a   Ghosh, Joydeep ^a  

^a The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BREGMAN BUBBLE CLUSTERING (BBC); DENSE REGIONS IN DATA; SINGLE DENSE CLUSTER;

DATA MINING; DATA RECORDING; MATHEMATICAL MODELS; PROBLEM SOLVING; SCALABILITY;

CLUSTERING ALGORITHMS;

EID: 84878084024     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDM.2006.32     Document Type: Conference Paper

References (18)

1. A. Banerjee and J. Langford. An objective evaluation criterion for clustering. In KDD-04, Seattle, Washington, USA, August 2004.
2. A. Banerjee, S. Merugu, I. Dhillon, and J. Ghosh. Clustering with Bregman divergences. JMLR, 6:1705-1749, 2005.
3. K. Crammer and G. Chechik. A needle in a haystack: Local one-class optimization. In In Proc. ICML, Banff, Alberta, Canada, 2004.
4. I. S. Dhillon and D. S. Modha. Concept decompositions for large sparse text data using clustering. Machine Learning, 42(1-2):143-175, January-February 2001.
5. M. Ester, H.-P. Kriegel, J. Sander, and X. Xu. A density-based algorithm for discovering clusters in large spatial databases with noise. In In Proc. KDD-96, 1996.
6. Gasch A. P. et al. Genomic expression programs in the response of yeast cells to environmental changes. Mol. Bio. of the Cell, 11(3):4241-4257, December 2000.
7. Gollub J. et al. The Stanford microarray database: data access and quality assessment tools. Nucleic Acids Res, 31:94-96, 2003.
8. G. Gupta and J. Ghosh. Robust one-class clustering using hybrid global and local search. In Proc. ICML 2005, pages 273-280, Bonn, Germany, August 2005.
9. Hastie T. et al. Gene shaving as a method for identifying distinct sets of genes with similar expression patterns. Genome Biology, 1:1-21, 2000.
10. L. Hubert and P. Arabie. Comparing partitions. Journal of classification, pages 193-218, 1985.
11. D. Jiang, J. Pei, and A. Zhang. DHC: A density-based hierarchical clustering method for time series gene expression data. In BIBE '03, page 393, Washington, DC, USA, 2003. IEEE Comp. Soc.
12. M. Kearns, Y. Mansour, and A. Y. Ng. An information-theoretic analysis of hard and soft assignment methods for clustering. In Proceedings of the Thirteenth Conference on Uncertainty in Artificial Intelligence, pages 282-293. AAAI, 1997.
13. I. Lee, S. V. Date, A. T. Adai, and E. M. Marcotte. A probabilistic functional network of yeast genes. Science, 306:1555-1558, 2004.
14. R. Neal and G. Hinton. A view of the EM algorithm that justifies incremental, sparse, and other variants. In M. I. Jordan, editor, Learning in Graphical Models. Kluwer, 1998.
15. S. D. Pietra, V. D. Pietra, and J. Lafferty. Duality and auxiliary functions for Bregman distances. In Technical Report CMU-CS-01-109, School of Computer Science, Carnegie Mellon University, 2001.
16. M. D. Robinson, J. Grigull, N. Mohammad, and T. R. Hughes. Funspec: a web-based cluster interpreter for yeast. BMC Bioinformatics, 35(3), November 13 2002.
17. B. Schölkopf, J. C. Platt, J. S. Shawe-Taylor, A. J. Smola, and R. C. Williamson. Estimating the support of a high-dimensional distribution. Neural Computation, 13(7):1443-1471, 2001.
18. D. Tax and R. Duin. Data domain description using support vectors. In Proceedings of the ESANN-99, pages 251-256, 1999.