Clustering using Max-norm Constrained Optimization

Sur la division des corps matériels en parties

Steinhaus, H. (1957) · 1957

Earlier work this paper cites.

Convex Analysis

Rockafellar, R. T. (1970) · 1970

Earlier work this paper cites.

Slink: an optimally efficient algorithm for the single-link cluster method

Sibson, R. (1973) · 1973

Earlier work this paper cites.

Numerical Taxonomy

Sneath, P. M. A. and Sokal, R. R. (1973) · 1973

Earlier work this paper cites.

An efficient algorithm for a complete link method

Defays, D. (1977) · 1977

Earlier work this paper cites.

Nonnegative factorization of positive semidefinite nonnegative matrices

Gray, L. and Wilson, D. (1980) · 1980

Earlier work this paper cites.

Algorithms for Clustering Data

Jain, A. K. and Dubes, R. C. (1981) · 1981

Earlier work this paper cites.

Convex Analysis and Minimization Algorithms I

J.B., H.-U. and C., L. (1991) · 1991

Earlier work this paper cites.

Spectral k-way ratio cut partitioning

Chan, P., Schlag, M., and Zien, J. (1994) · 1994

Earlier work this paper cites.

Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming

Goemans, M. and Williamson, D. (1995) · 1995

Earlier work this paper cites.

Gradient-based learning applied to document recognition

LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P. (1998) · 1998

Earlier work this paper cites.

Normalized cuts and image segmentation

Shi, J. and Malik, J. (2000) · 2000

Earlier work this paper cites.

Learning segmentation by random walks

Meilǎ, M. and Shi, J. (2001) · 2001

Cited alongside, same era.

Correlation clustering

Bansal, N., Blum, A., and Chawla, S. (2002) · 2002

Cited alongside, same era.

Completely Positive Matrices

Berman, A. and Shaked-Monderer, N. (2003) · 2003

Cited alongside, same era.

Multiclass spectral clustering

Yu, S. X. and Shi, J. (2003) · 2003

Cited alongside, same era.

Learning with Matrix Factorizations

Srebro, N. (2004) · 2004

Cited alongside, same era.

A unified view of kernel k-means, spectral clustering and graph cuts

Dhillon, I., Guan, Y., and Kulis, B. (2005) · 2005

Cited alongside, same era.

Maximum-margin matrix factorization

Srebro, N., Rennie, J., and Jaakkola, T. (2005) · 2005

A direct product theorem for discrepancy

Lee, T., Shraibman, A., and Spalek, R. (2008) · 2008

Later among the works it cites.

Spectral clustering based on the graph p-laplacian

Bühler, T. and Hein, M. (2009) · 2009

Later among the works it cites.

Sparse online learning via truncated gradient

Langford, J., Li, L., and Zhang, T. (2009) · 2009

Later among the works it cites.

Latent variable graphical model selection via convex optimization

Original

Chandrasekaran, V., Parrilo, P. A., and Willsky, A. S. (2010) · 2010

Later among the works it cites.

Practical large-scale optimization for max-norm regularization

Lee, J., Recht, B., Salakhutdinov, R., Srebro, N., and Tropp, J. (2010) · 2010

Later among the works it cites.

Correlation clustering with noisy input

Mathieu, C. and Schudy, W. (2010) · 2010