The Constrained Laplacian Rank Algorithm for Graph-Based Clustering

@inproceedings{Nie2016TheCL,
  title={The Constrained Laplacian Rank Algorithm for Graph-Based Clustering},
  author={Feiping Nie and Xiaoqian Wang and Michael I. Jordan and Heng Huang},
  booktitle={AAAI},
  year={2016}
}
Graph-based clustering methods perform clustering on a fixed input data graph. If this initial construction is of low quality then the resulting clustering may also be of low quality. Moreover, existing graph-based clustering methods require post-processing on the data graph to extract the clustering indicators. We address both of these drawbacks by allowing the data graph itself to be adjusted as part of the clustering procedure. In particular, our Constrained Laplacian Rank (CLR) method… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 89 CITATIONS, ESTIMATED 85% COVERAGE

Unsupervised Single and Multiple Views Feature Extraction with Structured Graph

  • IEEE Transactions on Knowledge and Data Engineering
  • 2017
VIEW 19 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

Flexible Affinity Matrix Learning for Unsupervised and Semisupervised Classification

  • IEEE Transactions on Neural Networks and Learning Systems
  • 2019
VIEW 6 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Detecting Coherent Groups in Crowd Scenes by Multiview Clustering.

  • IEEE transactions on pattern analysis and machine intelligence
  • 2018
VIEW 8 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Discrete Optimal Graph Clustering

  • IEEE transactions on cybernetics
  • 2018
VIEW 7 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Multi-Modal Joint Clustering With Application for Unsupervised Attribute Discovery

  • IEEE Transactions on Image Processing
  • 2018
VIEW 13 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Self-Tuned Discrimination-Aware Method for Unsupervised Feature Selection.

  • IEEE transactions on neural networks and learning systems
  • 2018
VIEW 4 EXCERPTS
CITES BACKGROUND & METHODS
HIGHLY INFLUENCED

Spectral Clustering of Large-scale Data by Directly Solving Normalized Cut

VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

A Self-Balanced Min-Cut Algorithm for Image Clustering

  • 2017 IEEE International Conference on Computer Vision (ICCV)
  • 2017
VIEW 8 EXCERPTS
CITES METHODS & BACKGROUND
HIGHLY INFLUENCED

FILTER CITATIONS BY YEAR

2016
2019

CITATION STATISTICS

  • 24 Highly Influenced Citations

  • Averaged 28 Citations per year from 2017 through 2019

References

Publications referenced by this paper.

Similar Papers

Loading similar papers…