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
  • Mathematics, 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
    46 Citations

    Figures, Tables, and Topics from this paper.

    Active Clustering with Model-Based Uncertainty Reduction
    • 28
    • PDF
    Spectral Clustering : a Tutorial for the 2010 ’ s
    • 8
    • PDF
    Active Density-Based Clustering
    • 24
    • Highly Influenced
    Entropy-based active sparse subspace clustering
    • 2
    Margin-based active subspace clustering
    • John Lipor, Laura Balzano
    • Computer Science
    • 2015 IEEE 6th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
    • 2015
    • 4
    • PDF
    Density-Aware Clustering Based on Aggregated Heat Kernel and Its Transformation
    • 2
    • PDF
    Active Constrained Clustering via non-iterative uncertainty sampling
    • 1
    • PDF
    Interactively Guiding Semi-Supervised Clustering via Attribute-Based Explanations
    • 27
    • PDF