Exhaustive and efficient constraint propagation: a graph-based learning approach and its applications
From MaRDI portal
Publication:361261
DOI10.1007/s11263-012-0602-zzbMath1270.68351arXiv1109.4684MaRDI QIDQ361261
Publication date: 29 August 2013
Published in: International Journal of Computer Vision (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1109.4684
semi-supervised classification; constrained spectral clustering; cross-modal retrieval; multi-source data; pairwise constraint propagation
68T05: Learning and adaptive systems in artificial intelligence
68R10: Graph theory (including graph drawing) in computer science
68T45: Machine vision and scene understanding
Related Items
Spectral clustering with robust self-learning constraints, Semi-supervised clustering via multi-level random walk, Noise-robust semi-supervised learning via fast sparse coding, Link-aware semi-supervised hypergraph, Data representation using robust nonnegative matrix factorization for edge computing, On multi-modal fusion learning in constraint propagation, Discriminative sparse flexible manifold embedding with novel graph for robust visual representation and label propagation
Uses Software
Cites Work
- Normalized cuts revisited: a reformulation for segmentation with linear grouping constraints
- Lyapunov matrix equations in system stability and control.
- 10.1162/jmlr.2003.3.4-5.993
- Algorithm 432 [C2: Solution of the matrix equation AX + XB = C [F4]]
- Contextual Kernel and Spectral Methods for Learning the Semantics of Images
- Structural, Syntactic, and Statistical Pattern Recognition
- Explicit Solutions of Linear Matrix Equations
- RELATIONS BETWEEN TWO SETS OF VARIATES
- Modeling the shape of the scene: A holistic representation of the spatial envelope
- Unnamed Item
