Fetching the paper…
Reading the bibliography…
We study the problem of clustering with relative constraints, where each constraint specifies relative similarities among instances.
J. Nunnally and I. Bernstein, Psychometric Theory . McGraw Hill, Inc., 1994
1994
Earlier work this paper cites.
L. Saul, T. Jaakkola, and M. Jordan, “Mean Field Theory for Sigmoid Belief Networks,” Journal of Artificial Intelligence Research , vol. 4, pp. 61–76, 1996
1996
Earlier work this paper cites.
K. Wagstaff, C. Cardie, S. Rogers, and S. Schrödl, “Constrained K-means Clustering with Background Knowledge,” in ICML , 2001, pp. 577–584
2001
Earlier work this paper cites.
E. Xing, A. Ng, M. Jordan, and S. Russell, “Distance Metric Learning with Application to Clustering with Side-information,” in NIPS , 2003, pp. 521–528
2003
Earlier work this paper cites.
N. Shental, A. Bar-hillel, T. Hertz, and D. Weinshall, “Computing Gaussian Mixture Models with EM using Equivalence Constraints,” in NIPS , 2003
2003
Earlier work this paper cites.
M. Schultz and T. Joachims, “Learning a Distance Metric from Relative Comparisons,” in NIPS , 2003, p. 41
2003
Earlier work this paper cites.
M. Bilenko, S. Basu, and R. J. Mooney, “Integrating Constraints and Metric Learning in Semi-supervised Clustering,” in ICML , 2004
2004
Earlier work this paper cites.
Z. Lu and T. K. Leen, “Semi-supervised Learning with Penalized Probabilistic Clustering,” in NIPS , 2004
2004
Earlier work this paper cites.
S. Basu, M. Bilenko, and R. J. Mooney, “A Probabilistic Framework for Semi-supervised Clustering,” in KDD , 2004, pp. 59–68
2004
Earlier work this paper cites.
T. Lange, M. H. C. Law, A. K. Jain, and J. M. Buhmann, “Learning with Constrained and Unlabelled Data,” in CVPR , 2005, pp. 731–738
2005
Earlier work this paper cites.
Y. Grandvalet and Y. Bengio, “Semi-supervised Learning by Entropy Minimization,” in NIPS , 2005, pp. 33–40
2005
Cited alongside, same era.
R. Rosales and G. Fung, “Learning Sparse Metrics via Linear Programming,” in KDD , 2006, pp. 367–373
2006
Cited alongside, same era.
B. Nelson and I. Cohen, “Revisiting Probabilistic Models for Clustering with Pair-wise Constraints,” in ICML , 2007, pp. 673–680
2007
Cited alongside, same era.
R. Ge, M. Ester, W. Jin, and I. Davidson, “Constraint-Driven Clustering,” in KDD , 2007, pp. 320–329
2007
Cited alongside, same era.
Z. Lu, “Semi-supervised Clustering with Pairwise Constraints: A Discriminative Approach,” Journal of Machine Learning Research , vol. 2, pp. 299–306, 2007
2007
Cited alongside, same era.
R. Gomes, A. Krause, and P. Perona, “Discriminative Clustering by Regularized Information Maximization,” in NIPS , 2010, pp. 775–783
2010
Later among the works it cites.
K. Huang, Y. Ying, and C. Campbell, “Generalized Sparse Metric Learning with Relative Comparisons,” Knowl. Inf. Syst. , vol. 28, no. 1, pp. 25–45, 2011
2011
Later among the works it cites.
E. Liu, Z. Zhang, and W. Wang, “Clustering with Relative Constraints,” in KDD , 2011, pp. 947–955
2011
Later among the works it cites.
2011
Later among the works it cites.
E. Y. Liu, Z. Guo, X. Zhang, V. Jojic, and W. Wang, “Metric Learning from Relative Comparisons by Minimizing Squared Residual,” in ICDM , 2012, pp. 978–983
2012
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
C. M. Bishop, Pattern Recognition and Machine Learning , 1st ed. Springer, 2007
2007
Cited alongside, same era.
J. V. Davis, B. Kulis, P. Jain, S. Sra, and I. S. Dhillon, “Information-Theoretic Metric Learning,” in ICML , 2007, pp. 209–216
2007
Cited alongside, same era.
S. Basu, I. Davidson, and K. Wagstaff, Constrained Clustering: Advances in Algorithms, Theory, and Applications , 1st ed. Chapman & Hall/CRC, 2008
2008
Cited alongside, same era.
N. Kumar and K. Kummamuru, “Semisupervised Clustering with Metric Learning using Relative Comparisons,” IEEE Trans. Knowl. Data Eng. , vol. 20, no. 4, pp. 496–503, 2008
2008
Cited alongside, same era.
G. Martinez-Munoz, N. Larios, E. Mortensen, W. Zhang, A. Yamamuro, R. Paasch, N. Payet, D. Lytle, L. Shapiro, S. Todorovic, A. Moldenke, and T. Dietterich, “Dictionary-Free Categorization of Very Similar Objects via Stacked Evidence Trees,” in CVPR , 2009, pp. 549 –556
2009
Cited alongside, same era.
Later among the works it cites.
C. W. Fox and S. J. Roberts, “A tutorial on Variational Bayesian Inference,” Artificial Intelligence Review , vol. 38, no. 2, pp. 85–95, 2012
2012
Later among the works it cites.
M. Schmidt, “L-bfgs software,” Website, 2012, http://www.di.ens.fr/~mschmidt/Software/minFunc.html
2012
Later among the works it cites.
F. Briggs, X. Z. Fern, and R. Raich, “Rank-loss Support Instance Machines for MIML Instance Annotation,” in KDD , 2012, pp. 534–542
2012
Later among the works it cites.
K. Bade and A. Nürnberger, “Hierarchical Constraints,” Machine Learning , pp. 1–29, 2013
2013
Later among the works it cites.