Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs

Journal of Combinatorial Optimization

Volumn 23, Issue 2, 2012, Pages 224-251

  Fan, Neng ^a   Pardalos, Panos M ^a  

^a J Crayton Pruitt Family Department of Biomedical Engineering   (United States)

Author keywords

Biclustering; Clustering; Graph partitioning; Normalized cut; Quadratically constrained programming; Ratio cut; Semidefinite programming; Spectral relaxation

Indexed keywords

BICLUSTERING; CLUSTERING; CONSTRAINED PROGRAMMING; GRAPH PARTITIONING; NORMALIZED CUT; RATIO CUT; SEMI-DEFINITE PROGRAMMING; SPECTRAL RELAXATION;

COMPUTER PROGRAMMING; GRAPH THEORY; MATHEMATICAL PROGRAMMING;

PROBLEM SOLVING;

EID: 84858845695     PISSN: 13826905     EISSN: 15732886     Source Type: Journal    
DOI: 10.1007/s10878-010-9351-5     Document Type: Article

References (35)

1. Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Plenum, New York
2. S Busygin O Prokopyev PM Pardalos 2008 Biclustering in data mining Comput Oper Res 35 2964 2987 2586410 1144.68309 10.1016/j.cor.2007.01.005 (Pubitemid 351186811)
3. PK Chan M Schlag JY Zien 1994 Spectral k-way ratio-cut partitioning and clustering IEEE Trans Comput-Aided Des Integr Circuits Syst 13 1088 1096 10.1109/43.310898
4. Chung FRK (1997) Spectral graph theory. In: Regional conference series in mathematics by conference board of the mathematical sciences. American Mathematical Society, Providence
5. Dhillon IS (2001) Co-clustering documents and words using bipartite spectral graph partitioning. In: Proceedings of the 7th ACM SIGKDD international conference on knowledging discovery and data mining (KDD), pp 26-29
6. Ding C (2004) A tutorial on spectral clustering. Available at http://ranger.uta.edu/~chqding/Spectral
7. Ding C, He X, Zha H, Gu M, Simon H (2001) A min-max cut algorithm for graph partitioning and data clustering. In: Proc IEEE int'l conf data mining
8. N Fan PM Pardalos 2010 Linear and quadratic programming approaches for the general graph partitioning problem J Glob Optim 48 1 57 71 2678845 1202.90261 10.1007/s10898-009-9520-1
9. Fan N, Chinchuluun A, Pardalos PM (2010a) Integer programming of biclustering based on graph models. In: Chinchuluun A, Pardalos PM, Enkhbat R, Tseveendorj I (eds) Optimization and optimal control: theory and applications, vol 29. Springer, Berlin, pp 479-498
10. Fan N, Boyko N, Pardalos PM (2010b) Recent advances of data biclustering with application in computational neuroscience. In: Chaovalitwongse WA, Pardalos PM, Xanthopoulos P (eds) Computational neuroscience. Optimization and its applications, vol 38. Springer, Berlin, pp 105-132
11. M Fiedler 1975 A property of eigenvectors of non-negative symmetric matrices and its application to graph theory Czech Math J 25 619 633 387321
12. A Frieze M Jerrum 1997 Improved approximation algorithms for MAX k-CUT and MAX BISECTION Algorithmica 18 67 81 1432029 0873.68078 10.1007/BF02523688
13. Grant M, Boyd S (2008) Graph implementations for nonsmooth convex programs. In: Blondel V, Boyd S, Kimura H (eds) Recent advances in learning and control (a tribute to M Vidyasagar). Lecture Notes in Control and Information Sciences. Springer, Berlin, pp 95-110
14. Grant M, Boyd S (2009) CVX: Matlab software for disciplined convex programming (web page and software). http://stanford.edu/~boyd/cvx
15. Gu M, Zha H, Ding C, He X, Simon H (2001) Spectral relaxation models and structure analysis for k-way graph clustering and bi-clustering. Penn State Univ Tech Report CSE-01-007
16. L Hagen AB Kahng 1992 New spectral methods for ratio cut partitioning and clustering IEEE Trans Comput-Aided Des 11 9 1074 1085 10.1109/43.159993 (Pubitemid 23555831)
17. W Hager Y Krylyuk 2002 Multiset graph partitioning Math Methods Oper Res 55 1 10 1892714 1031.90053 10.1007/s001860200173 (Pubitemid 34278819)
18. AK Jain MN Murty PJ Flynn 1999 Data clustering: A review ACM Comput Surv 31 3 264 323 10.1145/331499.331504
19. Karisch SE, Rendl F (1998) Semidefinite programming and graph equipartition. In: Pardalos PM, Wolkowicz H (eds) Topics in semidefinite and interior-point methods. American Mathematical Society, Providence, pp 77-95
20. Klerk E (2002) Aspects of semidefinite programming: Interior point algorithms and selected applications. Kluwer Academic, Dordrecht
21. DD Lee HS Seung 1999 Learning the parts of objets by non-negative matrix factorization Nature 401 788 791 10.1038/44565 (Pubitemid 29512513)
22. A Lisser F Rendl 2003 Graph partitioning using linear and semidefinite programming Math Program, Ser B 95 91 101 1971384 1030.90079 10.1007/s10107-002-0342-x (Pubitemid 44757865)
23. MacQueen JB (1967) Some methods for classification and analysis of multivariate observations. In: Proceedings of 5th Berkeley symposium on mathematical statistics and probability. University of California Press, Berkeley, pp 281-297
24. SC Madeira AL Oliveira 2004 Biclustering algorithms for biological data analysis: A survey IEEE Trans Comput Biol Bioinf 1 1 24C45
25. ML Overton RS Womersley 1992 On the sum of largest eigenvalues of symmetric matrix SIAM J Matrix Anal Appl 13 41 45 1146651 0747.15005 10.1137/0613006
26. A Pothen HD Simon KP Liou 1990 Partitioning sparse matrices with eigenvectors of graph SIAM J Matrix Anal Appl 11 430 452 1054210 0711.65034 10.1137/0611030
27. M Rege M Dong F Fotouhi 2008 Bipartite isoperimetric graph partitioning for data co-clustering Data Min Knowl Discov 16 276 312 2399022 10.1007/s10618-008-0091-4
28. J Shi J Malik 2000 Normalized cuts and image segmentation IEEE Trans Pattern Anal Mach Intell 22 8 888 905 10.1109/34.868688
29. Tanay A, Sharan R, Shamir R (2005) Biclustering algorithms: A survey. In: Aluru S (ed) Handbook of computational molecular biology. Chapman Hall, London
30. FE Torres 1991 Linearization of mixed-integer products Math Program 49 427 428 0725.90069 10.1007/BF01588802
31. L Vandenberghe S Boyd 1996 Semidefinite programming SIAM Rev 38 49 95 1379041 0845.65023 10.1137/1038003 (Pubitemid 126610912)
32. H Wolkowicz Q Zhao 1996 Semidefinite programming relaxations for the graph partitioning problem Discrete Appl Math 96-97 461 479 1724735
33. Xing EP, Jordan MI (2003) On semidefinite relaxation for normalized k-cut and connections to spectral clustering. UC Berkeley Technical Report CSD-03-1265
34. R Xu DII Wunsch 2005 Survey of clustering algorithms IEEE Trans Neural Netw 16 3 645 678 10.1109/TNN.2005.845141 (Pubitemid 40718010)
35. Zha H, He X, Ding C, Simon H, Gu M (2001) Bipartite graph partitioning and data clustering. In: Proceedings of the tenth international conference on information and knowledge management, pp 25-32 (Pubitemid 34974610)