Optimum cut-based clustering

@article{Li2007OptimumCC,
  title={Optimum cut-based clustering},
  author={Xiaobin Li and Tian Zheng},
  journal={Signal Processing},
  year={2007},
  volume={87},
  pages={2491-2502}
}
This paper presents a new method for solving clustering problem. We treat clustering as a graph-partitioning problem and propose a new global criterion, the optimum cut, for segmenting the graph. An important feature is that optimizing the optimum cut criterion can ensure that the intra-cluster similarity is maximized while the inter-cluster similarity is minimized. We show that an efficient computational technique based on an eigenvalue problem can be used to optimize this criterion. The… CONTINUE READING

Similar Papers

Loading similar papers…