Active spectral clustering via iterative uncertainty reduction

@inproceedings{Wauthier2012ActiveSC,
  title={Active spectral clustering via iterative uncertainty reduction},
  author={Fabian L. Wauthier and N. Jojic and Michael I. Jordan},
  booktitle={KDD},
  year={2012}
}
  • Fabian L. Wauthier, N. Jojic, Michael I. Jordan
  • Published in KDD 2012
  • Computer Science
  • Spectral clustering is a widely used method for organizing data that only relies on pairwise similarity measurements. This makes its application to non-vectorial data straight-forward in principle, as long as all pairwise similarities are available. However, in recent years, numerous examples have emerged in which the cost of assessing similarities is substantial or prohibitive. We propose an active learning algorithm for spectral clustering that incrementally measures only those similarities… CONTINUE READING

    Figures, Tables, and Topics from this paper.

    Active Clustering with Model-Based Uncertainty Reduction
    • 25
    • Open Access
    Entropy-based active sparse subspace clustering
    • 1
    Spectral Clustering : a Tutorial for the 2010 ’ s
    • 8
    • Open Access
    Active Density-Based Clustering
    • 24
    • Highly Influenced
    Margin-based active subspace clustering
    • 4
    • Open Access
    Density-Aware Clustering Based on Aggregated Heat Kernel and Its Transformation
    • 2
    • Open Access
    Active Constrained Clustering via non-iterative uncertainty sampling
    • 1
    • Open Access
    Active Distance-Based Clustering Using K-Medoids
    • 2
    • Open Access
    Interactively Guiding Semi-Supervised Clustering via Attribute-Based Explanations
    • 27
    • Open Access