Discriminative Clustering by Regularized Information Maximization

by Ryan Gomes , Andreas Krause , Pietro Perona
Citations:3 - 1 self

Documents Related by Co-Citation

1 Fei Sha the 27th international conference on – Wang - 2010
1 ICA based on a Smooth Estimation of the Differential Entropy – Lev Faivishevsky, Jacob Goldberger
1 Anonlinearprogramming algorithm for solving semidefinite programs via low-rank factorization – SamuelBurer andRenatoD C Monteiro
1 Implementation of a primal– dual method for SDP on a shared memory parallel architecture – ISBN
23 Derandomized Dimensionality Reduction with Applications – Lars Engebretsen, Piotr Indyk, Ryan O'Donnell - 2002
7 Divergence estimation for multidimensional densities via k-nearestneighbor distances – Q Wang, S R Kulkarni, S Verdú
15 On Semidefinite Relaxations for Normalized k-Cut and Connections to Spectral Clustering – Eric Xing, Eric P. Xing, Michael Jordan, Michael I. Jordan - 2003
34 On statistical estimation of entropy of random vector, Problems of Information Transmission 23 – L F Kozachenko, N N Leonenko - 1987
143 Improved Approximation Algorithms for MAX k-CUT and MAX BISECTION – Alan Frieze, For Max, Mark Jerrum - 1994
17 Fast SDP relaxations of graph cut clustering, transduction, and other combinatorial problems – Tijl De Bie, Nello Cristianini, P. Bennett, Emilio Parrado-hernández - 2006
18 A dependence maximization view of clustering – L Song, A Smola, A Gretton, K M Borgwardt - 2007
349 UCI Machine Learning Repository – A Asuncion, D J Newman
500 Approximation algorithms for NP-hard problems – D Hochbaum - 1996
2135 Convex Optimization – S Boyd, L Vandenberghe - 2004
650 Approximation Algorithms – V Vazirani - 2003
756 On Spectral Clustering: Analysis and an algorithm – Andrew Y. Ng, Michael I. Jordan, Yair Weiss - 2001
773 Improved Approximation Algorithms for Maximum Cut and Satisfiability Problems Using Semidefinite Programming – M. X. Goemans, D.P. Williamson - 1995
287 Objective criteria for the evaluation of clustering methods – William M Rand - 1971
40 Log-det heuristic for matrix rank minimization with applications to Hankel and Euclidean distance matrices – M Fazel, H Hindi, S Boyd - 2003