Optimum cut-based clustering

DOI10.1016/J.SIGPRO.2007.03.017MaRDI QIDQ971036zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

clusteringgraph partitioningcut

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

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)

• scientific article; zbMATH DE number 494472 (Why is no real title available?)
• A polynomial algorithm for balanced clustering via graph partitioning
• 0-1 semidefinite programming for graph-cut clustering: modelling and approximation
• Clustering and outlier detection using isoperimetric number of trees
• Information cut for clustering using a gradient descent approach
• 3D human posture segmentation by spectral clustering with surface normal constraint

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)