Ensemble clustering using semidefinite programming with applications

Machine Learning

Volumn 79, Issue 1-2, 2010, Pages 177-200

  Singh, Vikas ^a   Mukherjee, Lopamudra ^b   Peng, Jiming ^c   Xu, Jinhui ^d  

^a UNIVERSITY OF WISCONSIN SCHOOL OF MEDICINE AND PUBLIC HEALTH   (United States)

^b UNIVERSITY OF WISCONSIN WHITEWATER   (United States)

^c UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

^d the State University of New York   (United States)

Author keywords

Cluster ensembles; Ensemble clustering; Segmentation aggregation; Semidefinite programming

Indexed keywords

BRAIN MAPPING; MATHEMATICAL PROGRAMMING; POLYNOMIAL APPROXIMATION;

CLUSTER ENSEMBLES; ENSEMBLE CLUSTERING; MULTIPLE CLUSTERINGS; NONLINEAR OBJECTIVE FUNCTIONS; SEMI-DEFINITE PROGRAM (SDP); SEMI-DEFINITE PROGRAMMING; SYNTHETIC DATASETS; VOTING STRATEGIES;

CLUSTERING ALGORITHMS;

EID: 79951788461     PISSN: 08856125     EISSN: 15730565     Source Type: Journal    
DOI: 10.1007/s10994-009-5158-y     Document Type: Article

References (46)

1. Ailon, N., Charikar,M.,& Newman, A. (2005). Aggregating inconsistent information: ranking and clustering. In Proc. of symposium on theory of computing (pp. 684-693). (Pubitemid 43098641)
2. Anjos, M., & Wolkowicz, H. (1999). A strengthened sdp relaxation via a second lifting for the max-cut problem (Technical Report).
3. Bansal, N., Blum, A., & Chawla, S. (2002). Correlation clustering. In Proc. symposium on foundations of computer science (p. 238).
4. Boykov, Y., Veksler, O., & Zabih, R. (2001). Fast approximate energy minimization via graph cuts. IEEE Transactions on Pattern Analysis and Machine Intelligence, 23(11), 1222-1239. http://www. csd.uwo.ca/~olga/code.html. (Pubitemid 33137959)
5. Charikar, M., Guruswami, V., & Wirth, A. (2005). Clustering with qualitative information. Journal of Computer and System Science, 71(3), 360-383. (Pubitemid 41278185)
6. Curve Evolution Segmentation Dataset (2009). http://barissumengen.com/ seg/bsds-segmentations/html-for- visualization/curveevolution-testset.html.
7. de Silva, C. J., Masek, M., & Attikiouzel, Y. (2000). Combining data from different algorithms to segment the skin-Airinterface in mammograms. In IEEE engineering in medicine and biology society (Vol. 2, pp. 1195-1198). (Pubitemid 32474844)
8. Dudoit, S., & Fridlyand, J. (2003). Bagging to improve the accuracy of a clustering procedure. Bioinformatics, 19(9).
9. Felzenszwalb, P. F., & Huttenlocher, D. P. (2004). Efficient graph-based image segmentation. International Journal of Computer Vision, 59(2), 167-181.
10. Fern, X. Z., & Brodley, C. E. (2003). Random projection for high dimensional data clustering: a cluster ensemble approach. In Proc. of ieee international conference on machine learning (pp. 186-193).
11. Fern, X. Z., & Brodley, C. E. (2004). Solving cluster ensemble problems by bipartite graph partitioning. In Proc. of international conference on machine learning (p. 36).
12. Filkov, V., & Skiena, S. (2003). Integrating microarray data by consensus clustering. In Proc. of international conference on tools with artificial intelligence (p. 418).
13. Fred, A. L. N., & Jain, A. K. (2006). Combining multiple clusterings using evidence accumulation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 27(6).
14. Gasieniec, L., Jansson, J., & Lingas, A. (2000). Approximation algorithms for hamming clustering problems. In Proc. of symposium on combinatorial pattern matching (pp. 108-118).
15. Gionis, A., Mannila, H., & Tsaparas, P. (2005). Clustering aggregation. In Proc. of international conference on data engineering (pp. 341-352). (Pubitemid 41731148)
16. Giotis, I., & Guruswami, V. (2006). Correlation clustering with a fixed number of clusters. In Proc. of symposium on discrete algorithms (pp. 1167-1176). (Pubitemid 43275344)
17. Goel, N., Bebis, G., & Nefian, A. (2005). Face recognition experiments with random projection. In Proc. SPIE (Vol. 5779, pp. 426-437). (Pubitemid 41432851)
18. Goemans, M. X., & Williamson, D. P. (1995). Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming. Journal of the ACM, 42, 1115-1145.
19. Gordon, A. D., & Henderson, J. T. (1977). An algorithm for euclidean sum of squares classification. Biometrics, 33, 355-362. (Pubitemid 8131513)
20. Johnson, W. B., & Lindenstrauss, J. (1984). Extensions of lipshitz mapping into hilbert space. Contemporary Mathematics, 26, 189-206.
21. Kuncheva, L. I., & Vetrov, D. P. (2006). Evaluation of stability of k-means cluster ensembles with respect to random initialization. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(11).
22. Lasserre, J. B. (2001). An explicit exact sdp relaxation for nonlinear 0-1 programs. In Proceedings of the 8th international IPCO conference on integer programming and combinatorial optimization (pp. 293-303). (Pubitemid 33291968)
23. Liu, C., &Wechsler, H. (2003). Independent component analysis of gabor features for face recognition. IEEE Transactions on Neural Networks, 14(4), 919-928.
24. Liu, T., Li, H., Wong, K., Tarokh, A., Guo, L., & Wong, S. T. C. (2007). Brain tissue segmentation based on DTI data. NeuroImage, 38(1), 114-123. (Pubitemid 47429986)
25. Löfberg, J. (2004). YALMIP: A toolbox for modeling and optimization in MATLAB. In CCA/ISIC/CACSD, September 2004.
26. Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003). Consensus clustering: A resampling-based method for class discovery and visualization of gene expression microarray data. Machine Learning, 52(1-2), 91-118.
27. Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001). On spectral clustering: analysis and an algorithm. In Advances in neural information processing systems (pp. 849-856).
28. Peng, J., & Wei, Y. (2007). Approximating k-means-type clustering via semidefinite programming. SIAM Journal on Optimization, 18(1), 186-205. (Pubitemid 351271327)
29. Peng, J., Mukherjee, L., Singh, V., Schuurmans, D., & Xu, L. (2009). An efficient algorithm for maximal margin clustering. Manuscript (under peer review).
30. Perlibakas, V. (2004). Distance measures for PCA-based face recognition. Pattern Recognition Letters, 25(6), 711-724. (Pubitemid 38459483)
31. Rohlfing, T., & Maurer, C. R. Jr. (2005). Shape-based averaging for combination of multiple segmentations. In Medical image computing and computer-Assisted intervention (MICCAI) (pp. 838-845). (Pubitemid 43828442)
32. Rohlfing, T., & Maurer, C. R. Jr. (2005). Multi-classifier framework for atlas-based image segmentation. Pattern Recognition Letters, 26(13), 2070-2079. (Pubitemid 41252213)
33. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888-905.
34. Singh, V., Mukherjee, L., Peng, J., & Xu, J. (2007). Ensemble clustering using semidefinite programming. In Advances in neural information processing systems.
35. Strehl, A., & Ghosh, J. (2003). Cluster ensembles-A knowledge reuse framework for combining multiple partitions. Journal of Machine Learning Research, 3, 583-617.
36. Sturm, J. F. (1999). Using SeDuMi 1.02, A Matlab Toolbox for Optimization over Symmetric Cones. Optimization Methods and Software, 11-12, 625-653.
37. The Berkeley Segmentation Database and Benchmark. 2009). Computer Science Department, UC-Berkeley.
38. Toh, K. C., Todd, M. J., & Tutuncu, R. (1999). SDPT3-A Matlab software package for semidefinite programming. Optimization Methods and Software, 11(12), 545-581.
39. Topchy, A., Jain, A. K., & Punch, W. (2003). A mixture model for clustering ensembles. In Proc. of SIAM conference on data mining.
40. Topchy, A., Jain, A. K., & Punch, W. (2003). Combining multiple weak clusterings. In Proc. of IEEE international conference on data mining.
41. Turk, M., & Pentland, A. (1991). Eigenfaces for Recognition. Journal of Cognitive Neuroscience, 3(1), 71-86.
42. Vandenberghe, L., & Boyd, S. (1996). Semidefinite programming. SIAM Review, 38, 49-95. (Pubitemid 126610912)
43. Vempala, S. S. (2004). The random projection method. DIMACS series in discrete mathematics and theoretical computer science (Vol. 65). Providence: Am. Math. Soc.
44. Warfield, S. K., Zou, K. H., & Wells, W. M. (2004). Simultaneous truth and performance level estimation (STAPLE): an algorithm for the validation of image segmentation. IEEE Transactions on Medical Imaging, 23(7), 903-921.
45. Xing, E. P., & Jordan, M. I. (2003). On semidefinite relaxation for normalized k-cut and connections to spectral clustering (Technical Report UCB/CSD-03-1265). EECS Department, University of California Berkeley.
46. Xu, L., Neufeld, J., Larson, B., & Schuurmans, D. (2005).Maximum margin clustering. In Advances in neural information processing systems Cambridge: MIT Press.