Consensus clustering algorithms: Comparison and refinement

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 109-117

  Goder, Andrey ^a   Filkov, Vladimir ^a  

^a University of California   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CLUSTER ANALYSIS;

ALGORITHM COMPARISON; ALGORITHM REFINEMENT; APPROXIMATE SOLUTION; CLUSTERING INFORMATION; CLUSTERINGS; CONSENSUS CLUSTERING; DATA SET; NP COMPLETE; OPTIMIZATION PROBLEMS; PERFORMANCE GUARANTEES;

CLUSTERING ALGORITHMS;

EID: 58349089453     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.11     Document Type: Conference Paper

References (19)

1. A. Gasch, P. Spellman, C. Kao, O. Carmen-IIarel, M. Eisen, G. Storz, D. Botstein, and P. Brown. Genomic expression programs in the response of yeast cells to environment changes. Mol. Bio. Cell, 11:4241-4257, 2000.
2. V. Filkov and S. Skiena. Integrating microarray data by consensus clustering. International Journal on Artificial Intelligence Tools, 13(4):863-880, 2004.
3. V. Filkov and S. Skiena. Heterogeneous data integration with the consensus clustering formalism. Proceedings of Data Integration in the Life Sciences, pages 110-123, 2004.
4. Alexander Topchy, Anil K. Jain, and William Punch. Combining multiple weak clusterings. In ICDM '03: Proceedings of the Third IEEE International Conference on Data Mining, page 331, Washington, DC, USA, 2003. IEEE Computer Society.
5. M. Bender, S. Sethia, and S. Skiena. Efficient data structures for maintaining set partitions. Proceedings of Seventh Scandinavian Workshop on Algorithm Theory, pages 83-96, 2000.
6. L. Hubert and P. Arabic Comparing partitions. J. Class., 2:193-218, 1985.
7. E.B Fawlkes and C.L. Mallows. A method for comparing two hierarchical clusterings. Journal of the American Statistical Association, 78:553-584, 1983.
8. Y. Wakabayashi. The complexity of computing medians of relations. Resenhas IME-USP, 3:323-349, 1998.
9. M. Bertolacci and A. Wirth. Are approximation algorithms for consensus clustering worthwhile? In Proceedings of the Seventh SIAM ICDM, 2007.
10. N. Ailon, M. Charikar, and A. Newman. Aggregating inconsistent information: ranking and clustering. In Proceedings of the thirty-seventh annual ACM Symposium on Theory of Computing, pages 684-693, 2005.
11. H. Wilf. generatingfunctionology. A K Peters, 3rd edition, 2006.
12. H.C. Thode Jr. Tests for Normalcy. Marcel Dekker, NY, 2002.
13. J. Pitman. Some probabilistic aspects of set partitions. American Mathematical Monthly, 104:201-209, 1997.
14. A. Nijenhuis and H. Wilf. Combinatorial Algorithms. Academic Press, 1978.
15. D. Newman, S. Hettich, C. Blake, and C. Merz. UCI repository of machine learning databases. 1998.
16. O. Troyanskaya et al. Missing value estimation methods for DNA microarrays. Bioinformatics, 17:520-525, 2001.
17. A.D. Gordon and M. Vichi. Partitions of partitions. Journal of Classification, 15:265-285, 1998.
18. D. Cristofor and D. Simovici. Finding median partitions using information-theoretical-based genetic algorithms. Journal of Universal Computer Science, 8(2):153-172, 2002.
19. A. Strehl and J. Ghosh. Cluster ensembles - a knowledge reuse framework for combining partitionings. In Proc. of AAAI, pages 93-98. AAAI/MIT Press, 2002.