Are approximation algorithms for consensus clustering worthwhile?

Proceedings of the 7th SIAM International Conference on Data Mining

Volumn , Issue , 2007, Pages 437-442

  Bertolacci, Michael ^a   Wirth, Anthony ^a  

^a UNIVERSITY OF MELBOURNE   (Australia)

Author keywords

Approximation algorithm; Consensus clustering; Linear programming; Mining with constraints

Indexed keywords

APPROXIMATION ALGORITHMS; CLUSTER ANALYSIS; DATA MINING; LINEAR PROGRAMMING; POLYNOMIAL APPROXIMATION;

CERTAIN FACTOR; CLUSTERING PROBLEMS; CONSENSUS CLUSTERING; DATA MINING ALGORITHM; DATA MINING COMMUNITY; POLYNOMIAL-TIME; THEORETICAL COMPUTER SCIENCE; THEORETICAL RESEARCH;

CLUSTERING ALGORITHMS;

EID: 57749203751     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972771.41     Document Type: Conference Paper

References (22)

1. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In 37th Symposium on Theory of Computing (STOC), pages 684-93, 2005.
2. N. Ailon, M. Charikar, and A. Newman. Proofs of conjectures in "Aggregating inconsistent information: Ranking and clustering". Technical Report 719, Computer Science, Princeton University, 2005.
3. P. Andritsos, P. Tsaparas, R. Miller, and K. Sevcik. LIMBO: Scalable clustering of categorical data. In 9th International Conference on Extending DataBase Technology (EDBT), pages 123-46, 2004.
4. C. Boulis and M. Ostendorf. Combining multiple clustering systems. In 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (PKDD), pages 63-74, 2004.
5. M. Charikar, V. Guruswami, and A. Wirth. Clustering with qualitative information. Journal of Computer and System Sciences, 71(3):360-83, 2005.
6. I. Davidson and S. Ravi. Clustering with constraints: Feasibility issues and the k-means algorithm. In Proceedings of the SIAM International Conference on Data Mining, 2005.
7. F. Dehne, M. Langston, X. Luo, S. Pitre, P. Shaw, and Y. Zhang. The cluster editing problem: Imple Mentations and experiments. In Int. Workshop on Pa rameterized and Exact Computation (IWPEC), pages 13-24, 2006.
8. X. Fern and C. Brodley. Random projection for high dimensional data: A cluster ensemble approach. In 20th International Conference on Machine Learning (ICML), pages 186-93, 2003.
9. V. Filkov and S. Skiena. Integrating microarray data by consensus clustering. In 15th IEEE International Conference on Tools with Artificial Intelligence, pages 418-26, 2003.
10. A. Gionis, H. Mannila, and P. Tsaparas. Clustering aggregation. In 21st International Conference on Data Engineering (ICDE), pages 341-52, 2005.
11. T. Gonzalez. Clustering to minimize the maximum interciuster distance. Theoretical Computer Science, 38(2):293-306, 1985.
12. S. Guha, R. Rastogi, and K. Shim. ROCK: A robust clustering algorithm for categorical attributes. In 15th International Conference on Data Engineering (ICDE), pages 512-21, 1999.
13. A. McCallum and B. Weliner. Toward conditional models of identity uncertainty with application to proper noun coreference. In IJCAI Workshop on Information Integration on the Web, 2003.
14. M. Meilǎ. Comparing clusterings. Proceedings of the Conference on Computational Learning Theory (COLT), 2003.
15. S. Monti, P. Tamayo, J. Mesirov, and T. Golub. Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data. Machine Learning, 52(1) :91-i 18, 2003.
16. D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases, 1998.
17. A. Strehi and J. Ghosh. Cluster ensembles-a knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3(3):583-617, 2003.
18. A. Topchy, A. Jam, and W. Punch. Combining multiple weak clusterings. In 3rd IEEE International Conference on Data Mining (ICDM), pages 331-8, 2003.
19. A. van Zuylen. Deterministic approximation algo rithms for ranking and clustering problems. Technical Report 1431, ORIE, Cornell University, 2005.
20. A. Wirth and M. Bertolacci. New algorithms research for first year students. In ITICSE '06: Proceedings of the 11th annual SIGCSE conference on Innovation and technology in computer science education, pages 128- 32, 2006.
21. 3L) potential reduction algorithm for linear programming. Mathematical Programming, 50(i):239-58, 1991.
22. Y. Zhao and G. Karypis. Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning, 55(3):311-31, 2004.