Publication:421275

{{DISPLAYTITLE:Multi-way clustering and biclustering by the ratio cut and normalized cut in graphs

DOI10.1007/s10878-010-9351-5zbMath1266.90156OpenAlexW2008108079MaRDI QIDQ421275

Panos M. Pardalos, Neng Fan

Publication date: 23 May 2012

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-010-9351-5

zbMATH Keywords

semidefinite programmingclusteringgraph partitioningbiclusteringquadratically constrained programmingnormalized cutratio cutspectral relaxation

Mathematics Subject Classification ID

Semidefinite programming (90C22) Combinatorial optimization (90C27) Boolean programming (90C09)

Related Items

Graph clustering with Boltzmann machines, Robust optimization of graph partitioning involving interval uncertainty, Guaranteed clustering and biclustering via semidefinite programming, Approximate normalized cuts without eigen-decomposition

Uses Software

• CVX

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Multiset graph partitioning
• Graph partitioning using linear and semidefinite programming
• Aspects of semidefinite programming. Interior point algorithms and selected applications
• Linear and quadratic programming approaches for the general graph partitioning problem
• Linearization of mixed-integer products
• Biclustering in data mining
• Graph Implementations for Nonsmooth Convex Programs
• Integer Programming of Biclustering Based on Graph Models
• Partitioning Sparse Matrices with Eigenvectors of Graphs
• On the Sum of the Largest Eigenvalues of a Symmetric Matrix
• Semidefinite Programming
• Learning the parts of objects by non-negative matrix factorization