Pairwise Constraint Propagation: A Survey

As one of the most important types of (weaker) supervised information in machine learning and pattern recognition, pairwise constraint, which specifies whether a pair of data points occur together, has recently received significant attention, especially the problem of pairwise constraint propagation. At least two reasons account for this trend: the first is that compared to the data label, pairwise constraints are more general and easily to collect, and the second is that since the available pairwise constraints are usually limited, the constraint propagation problem is thus important. This paper provides an up-to-date critical survey of pairwise constraint propagation research. There are two underlying motivations for us to write this survey paper: the first is to provide an up-to-date review of the existing literature, and the second is to offer some insights into the studies of pairwise constraint propagation. To provide a comprehensive survey, we not only categorize existing propagation techniques but also present detailed descriptions of representative methods within each category.

[1]  M. T. Qureshi,et al.  Lyapunov Matrix Equation in System Stability and Control , 2008 .

[2]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[3]  Peng Liu,et al.  Semi-supervised sparse metric learning using alternating linearization optimization , 2010, KDD.

[4]  G. G. Stokes.  "J." , 1890, The New Yale Book of Quotations.

[5]  Zoubin Ghahramani,et al.  Combining active learning and semi-supervised learning using Gaussian fields and harmonic functions , 2003, ICML 2003.

[6]  Bernhard Schölkopf,et al.  Learning with Local and Global Consistency , 2003, NIPS.

[7]  Dale Schuurmans,et al.  Fast normalized cut with linear constraints , 2009, CVPR.

[8]  Zhiwu Lu,et al.  Modalities consensus for multi-modal constraint propagation , 2012, ACM Multimedia.

[9]  Zhiwu Lu,et al.  Constrained Spectral Clustering via Exhaustive and Efficient Constraint Propagation , 2010, ECCV.

[10]  Dan Klein,et al.  From Instance-level Constraints to Space-Level Constraints: Making the Most of Prior Knowledge in Data Clustering , 2002, ICML.

[11]  Richard H. Bartels,et al.  Algorithm 432 [C2]: Solution of the matrix equation AX + XB = C [F4] , 1972, Commun. ACM.

[12]  Zhiwu Lu,et al.  Symmetric Graph Regularized Constraint Propagation , 2011, AAAI.

[13]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[14]  Jitendra Malik,et al.  Learning Globally-Consistent Local Distance Functions for Shape-Based Image Retrieval and Classification , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[15]  Claire Cardie,et al.  Proceedings of the Eighteenth International Conference on Machine Learning, 2001, p. 577–584. Constrained K-means Clustering with Background Knowledge , 2022 .

[16]  Zhenguo Li,et al.  Pairwise constraint propagation by semidefinite programming for semi-supervised classification , 2008, ICML '08.

[17]  Zhiwu Lu,et al.  Latent Semantic Learning by Efficient Sparse Coding with Hypergraph Regularization , 2011, AAAI.

[19]  Zhiwu Lu,et al.  Image categorization by learning with context and consistency , 2009, 2009 IEEE Conference on Computer Vision and Pattern Recognition.

[20]  Olga Veksler,et al.  Star Shape Prior for Graph-Cut Image Segmentation , 2008, ECCV.

[21]  Zhiwu Lu,et al.  Local similarity learning for pairwise constraint propagation , 2013, Multimedia Tools and Applications.

[22]  Zhiwu Lu,et al.  Heterogeneous Constraint Propagation with Constrained Sparse Representation , 2012, 2012 IEEE 12th International Conference on Data Mining.

[23]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[24]  Dan Klein,et al.  Spectral Learning , 2003, IJCAI.

[25]  Jianbo Shi,et al.  Segmentation given partial grouping constraints , 2004, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  Inderjit S. Dhillon,et al.  Semi-supervised graph clustering: a kernel approach , 2005, ICML '05.

[27]  Wei Liu,et al.  Learning Distance Metrics with Contextual Constraints for Image Retrieval , 2006, 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'06).

[28]  Miguel Á. Carreira-Perpiñán,et al.  Constrained spectral clustering through affinity propagation , 2008, 2008 IEEE Conference on Computer Vision and Pattern Recognition.

[29]  Michael I. Jordan,et al.  Distance Metric Learning with Application to Clustering with Side-Information , 2002, NIPS.

[30]  Raymond J. Mooney,et al.  A probabilistic framework for semi-supervised clustering , 2004, KDD.

[31]  Horace H. S. Ip,et al.  Image categorization by learning with context and consistency , 2009, CVPR.

[32]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[33]  Zhiwu Lu,et al.  Unified Constraint Propagation on Multi-View Data , 2013, AAAI.

[34]  Zhiwu Lu,et al.  Multi-modal constraint propagation for heterogeneous image clustering , 2011, ACM Multimedia.

[35]  Zhiwu Lu,et al.  Exhaustive and Efficient Constraint Propagation: A Graph-Based Learning Approach and Its Applications , 2011, International Journal of Computer Vision.