← Applications
Data Science & Analytics › Applications ›

Clustering

756 directly classified papers

Papers per year

Papers

LPmade: Link Prediction Made Easy JMLR 2011
Clustering Algorithms for Chains JMLR 2011
Adaptive Density Level Set Clustering COLT 2011
Spectral Clustering on a Budget AISTATS 2011
Bayesian Hierarchical Cross-Clustering AISTATS 2011
Evolving Cluster Mixed-Membership Blockmodel for Time-Evolving Networks AISTATS 2011
Multiscale Community Blockmodel for Network Exploration AISTATS 2011
Active Clustering: Robust and Efficient Hierarchical Clustering using Adaptively Selected Similarities AISTATS 2011
On U-processes and clustering performance NIPS 2011
The Multidimensional Wisdom of Crowds NIPS 2010
Fast Large-scale Mixture Modeling with Component-specific Data Partitions NIPS 2010
Learning concept graphs from text with stick-breaking priors NIPS 2010
Robust Clustering as Ensembles of Affinity Relations NIPS 2010
Towards Property-Based Classification of Clustering Paradigms NIPS 2010
Hartigan’s Method: k-means Clustering without Voronoi AISTATS 2010
Deterministic Bayesian inference for the $p*$ model AISTATS 2010
Subgraph Detection Using Eigenvector L1 Norms NIPS 2010
Hierarchical Convex NMF for Clustering Massive Data ACML 2010
Minimum Average Cost Clustering NIPS 2010
Exploiting the High Predictive Power of Multi-class Subgroups ACML 2010
A Game-Theoretic Approach to Hypergraph Clustering NIPS 2009
Multi-Label Prediction via Compressed Sensing NIPS 2009
Fast Graph Laplacian Regularized Kernel Learning via Semidefinite–Quadratic–Linear Programming NIPS 2009
Streaming k-means approximation NIPS 2009
Convex Relaxation of Mixture Regression with Efficient Algorithms NIPS 2009