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

Authors:
Neng Fan;Panos M. Pardalos
Affiliations:
Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA;Department of Industrial and Systems Engineering, University of Florida, Gainesville, USA
Venue:
Journal of Combinatorial Optimization
Year:
2012

Citing 16
Cited 2

Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Linearization of mixed-integer products

Mathematical Programming: Series A and B
On the sum of the largest eigenvalues of a symmetric matrix

SIAM Journal on Matrix Analysis and Applications
Semidefinite programming

SIAM Review
Data clustering: a review

ACM Computing Surveys (CSUR)
Semidefinite programming relaxations for the graph partitioning problem

Discrete Applied Mathematics - Special issue on the satisfiability problem and Boolean functions
Normalized Cuts and Image Segmentation

IEEE Transactions on Pattern Analysis and Machine Intelligence
Co-clustering documents and words using bipartite spectral graph partitioning

Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining
Bipartite graph partitioning and data clustering

Proceedings of the tenth international conference on Information and knowledge management
Pattern Recognition with Fuzzy Objective Function Algorithms

Pattern Recognition with Fuzzy Objective Function Algorithms
A Min-max Cut Algorithm for Graph Partitioning and Data Clustering

ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Biclustering Algorithms for Biological Data Analysis: A Survey

IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Biclustering in data mining

Computers and Operations Research
Bipartite isoperimetric graph partitioning for data co-clustering

Data Mining and Knowledge Discovery
Linear and quadratic programming approaches for the general graph partitioning problem

Journal of Global Optimization
Survey of clustering algorithms

IEEE Transactions on Neural Networks

On the two-stage stochastic graph partitioning problem

COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Robust optimization of graph partitioning involving interval uncertainty

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

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.