Co-occurring keywords · papers mentioning both
Papers
Partitioning Well-Clustered Graphs: Spectral Clustering Works!
COLT 2015
Spectral Clustering via the Power Method - Provably
ICML 2015
Superpixel Segmentation Using Linear Spectral Clustering
CVPR 2015
Tradeoffs for Space, Time, Data and Risk in Unsupervised Learning
AISTATS 2015
Web Scale Photo Hash Clustering on A Single Machine
CVPR 2015
Yinyang K-Means: A Drop-In Replacement of the Classic K-Means with Consistent Speedup
ICML 2015
Coresets for k-Segmentation of Streaming Data
NeurIPS 2014
Density-preserving quantization with application to graph downsampling
COLT 2014
Distributed Balanced Clustering via Mapping Coresets
NeurIPS 2014
Improved Distributed Principal Component Analysis
NeurIPS 2014
K-means recovers ICA filters when independent components are sparse
ICML 2014
A Scalable Unsupervised Feature Merging Approach to Efficient Dimensionality Reduction of High-Dimensional Visual Data
ICCV 2013
Cartesian K-Means
CVPR 2013
Clustering Oligarchies
AISTATS 2013
Distributed k-means and k-median Clustering on General Topologies
NeurIPS 2013
Dynamic Clustering via Asymptotics of the Dependent Dirichlet Process Mixture
NeurIPS 2013
Joint Inverted Indexing
ICCV 2013
Low-rank matrix reconstruction and clustering via approximate message passing
NeurIPS 2013
Maximum Volume Clustering: A New Discriminative Clustering Approach
JMLR 2013
Moment-based Uniform Deviation Bounds for k-means and Friends
NeurIPS 2013
Recursive Estimation of the Stein Center of SPD Matrices and Its Applications
ICCV 2013
SIFTpack: A Compact Representation for Efficient SIFT Matching
ICCV 2013
Small-Variance Asymptotics for Hidden Markov Models
NeurIPS 2013
Dip-means: an incremental clustering method for estimating the number of clusters
NeurIPS 2012
Efficient Hypergraph Clustering
AISTATS 2012