Optimum cut-based clustering
From MaRDI portal
Publication:971036
DOI10.1016/J.SIGPRO.2007.03.017zbMATH Open1186.94205OpenAlexW2082092603MaRDI QIDQ971036FDOQ971036
Authors: Xiao-Bin Li, Zheng Tian 
Publication date: 19 May 2010
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2007.03.017
Recommendations
- scientific article; zbMATH DE number 4189544
- Min-cut clustering
- A cutting plane algorithm for a clustering problem
- scientific article; zbMATH DE number 1302183
- Optimal clustering of multipartite graphs
- Optimality-based clustering: an inverse optimization approach
- scientific article; zbMATH DE number 907936
- Optimal clustering in the context of overlapping cluster analysis
- scientific article; zbMATH DE number 1923175
Cited In (6)
- 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
- A polynomial algorithm for balanced clustering via graph partitioning
- Information cut for clustering using a gradient descent approach
- Title not available (Why is that?)
- 3D human posture segmentation by spectral clustering with surface normal constraint
- Clustering and outlier detection using isoperimetric number of trees
This page was built for publication: Optimum cut-based clustering
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q971036)
