Abstract
In this paper, we consider the multi-way clustering problem based on graph partitioning models by the Ratio cut and Normalized cut. We formulate the problem using new quadratic models. Spectral relaxations, new semidefinite programming relaxations and linearization techniques are used to solve these problems. It has been shown that our proposed methods can obtain improved solutions. We also adapt our proposed techniques to the bipartite graph partitioning problem for biclustering.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Bezdek JC (1981) Pattern recognition with fuzzy objective function algorithms. Plenum, New York
Busygin S, Prokopyev O, Pardalos PM (2008) Biclustering in data mining. Comput Oper Res 35:2964–2987
Chan PK, Schlag M, Zien JY (1994) Spectral k-way ratio-cut partitioning and clustering. IEEE Trans Comput-Aided Des Integr Circuits Syst 13:1088–1096
Chung FRK (1997) Spectral graph theory. In: Regional conference series in mathematics by conference board of the mathematical sciences. American Mathematical Society, Providence
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
Ding C (2004) A tutorial on spectral clustering. Available at http://ranger.uta.edu/~chqding/Spectral
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
Fan N, Pardalos PM (2010) Linear and quadratic programming approaches for the general graph partitioning problem. J Glob Optim 48(1):57–71
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
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
Fiedler M (1975) A property of eigenvectors of non-negative symmetric matrices and its application to graph theory. Czech Math J 25:619–633
Frieze A, Jerrum M (1997) Improved approximation algorithms for MAX k-CUT and MAX BISECTION. Algorithmica 18:67–81
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
Grant M, Boyd S (2009) CVX: Matlab software for disciplined convex programming (web page and software). http://stanford.edu/~boyd/cvx
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
Hagen L, Kahng AB (1992) New spectral methods for ratio cut partitioning and clustering. IEEE Trans Comput-Aided Des 11(9):1074–1085
Hager W, Krylyuk Y (2002) Multiset graph partitioning. Math Methods Oper Res 55:1–10
Jain AK, Murty MN, Flynn PJ (1999) Data clustering: A review. ACM Comput Surv 31(3):264–323
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
Klerk E (2002) Aspects of semidefinite programming: Interior point algorithms and selected applications. Kluwer Academic, Dordrecht
Lee DD, Seung HS (1999) Learning the parts of objets by non-negative matrix factorization. Nature 401:788–791
Lisser A, Rendl F (2003) Graph partitioning using linear and semidefinite programming. Math Program, Ser B 95:91–101
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
Madeira SC, Oliveira AL (2004) Biclustering algorithms for biological data analysis: A survey. IEEE Trans Comput Biol Bioinf 1(1):24C45
Overton ML, Womersley RS (1992) On the sum of largest eigenvalues of symmetric matrix. SIAM J Matrix Anal Appl 13:41–45
Pothen A, Simon HD, Liou KP (1990) Partitioning sparse matrices with eigenvectors of graph. SIAM J Matrix Anal Appl 11:430–452
Rege M, Dong M, Fotouhi F (2008) Bipartite isoperimetric graph partitioning for data co-clustering. Data Min Knowl Discov 16:276–312
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905
Tanay A, Sharan R, Shamir R (2005) Biclustering algorithms: A survey. In: Aluru S (ed) Handbook of computational molecular biology. Chapman Hall, London
Torres FE (1991) Linearization of mixed-integer products. Math Program 49:427–428
Vandenberghe L, Boyd S (1996) Semidefinite programming. SIAM Rev 38:49–95
Wolkowicz H, Zhao Q (1996) Semidefinite programming relaxations for the graph partitioning problem. Discrete Appl Math 96–97:461–479
Xing EP, Jordan MI (2003) On semidefinite relaxation for normalized k-cut and connections to spectral clustering. UC Berkeley Technical Report CSD-03-1265
Xu R, Wunsch DII (2005) Survey of clustering algorithms. IEEE Trans Neural Netw 16(3):645–678
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
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Fan, N., Pardalos, P.M. Multi-way clustering and biclustering by the Ratio cut and Normalized cut in graphs. J Comb Optim 23, 224–251 (2012). https://doi.org/10.1007/s10878-010-9351-5
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10878-010-9351-5