This paper presents a graph-based method for heterogeneous constraint propagation on multi-modal data using constrained sparse representation. Since heterogeneous pairwise constraints are defined over pairs of data points from different modalities, heterogeneous constraint propagation is more challenging than the transitional homogeneous constraint propagation on single-modal data which has been studied extensively in previous work. The main difficulty of heterogeneous constraint propagation lies in how to effectively propagate heterogeneous pairwise constraints across different modalities. To address this issue, we decompose heterogeneous constraint propagation into semi-supervised learning subproblems which can then be efficiently solved ...
An approach for semiquantitative constraint propagation using both simple and complex nodes is prese...
Abstract. We provide here a simple, yet very general framework that allows us to explain several con...
In this paper we investigate whether we can improve propagationbased finite domain constraint solvin...
This paper presents a novel pairwise constraint propagation approach by decomposing the challenging ...
This paper presents a multi-modal constraint propagation approach to exploiting pairwise constraints...
We consider the general problem of learn-ing from both pairwise constraints and un-labeled data. The...
This paper presents a unified framework for intra-view and inter-view constraint propagation on mult...
This paper presents a unified framework for intra-view and inter-view constraint propagation on mult...
This paper presents a novel symmetric graph regularization framework for pairwise constraint propaga...
This paper presents a novel symmetric graph regularization framework for pairwise constraint propaga...
Abstract—A new graph based constrained semi-supervised learning (G-CSSL) framework is proposed. Pair...
Abstract—In many real-world applications we can model the data as a graph with each node being an in...
AbstractIn this paper, we propose a new semi-supervised DR method called sparse projections with pai...
A better similarity mapping function across heterogeneous high-dimensional features is very desirabl...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
An approach for semiquantitative constraint propagation using both simple and complex nodes is prese...
Abstract. We provide here a simple, yet very general framework that allows us to explain several con...
In this paper we investigate whether we can improve propagationbased finite domain constraint solvin...
This paper presents a novel pairwise constraint propagation approach by decomposing the challenging ...
This paper presents a multi-modal constraint propagation approach to exploiting pairwise constraints...
We consider the general problem of learn-ing from both pairwise constraints and un-labeled data. The...
This paper presents a unified framework for intra-view and inter-view constraint propagation on mult...
This paper presents a unified framework for intra-view and inter-view constraint propagation on mult...
This paper presents a novel symmetric graph regularization framework for pairwise constraint propaga...
This paper presents a novel symmetric graph regularization framework for pairwise constraint propaga...
Abstract—A new graph based constrained semi-supervised learning (G-CSSL) framework is proposed. Pair...
Abstract—In many real-world applications we can model the data as a graph with each node being an in...
AbstractIn this paper, we propose a new semi-supervised DR method called sparse projections with pai...
A better similarity mapping function across heterogeneous high-dimensional features is very desirabl...
In Constraint Programming, constraint propagation is a basic component of constraint satisfaction ...
An approach for semiquantitative constraint propagation using both simple and complex nodes is prese...
Abstract. We provide here a simple, yet very general framework that allows us to explain several con...
In this paper we investigate whether we can improve propagationbased finite domain constraint solvin...