作者: Ming Ji , Hujun Bao , Xiaofei He
DOI:
关键词: Complement graph 、 Graph embedding 、 Theoretical computer science 、 Voltage graph 、 Null graph 、 Topological graph theory 、 Strength of a graph 、 Machine learning 、 Artificial intelligence 、 Mathematics 、 Graph property 、 Graph (abstract data type)
摘要: Recently graph based dimensionality reduction has received a lot of interests in many fields information processing. Central to it is structure which models the geometrical and discriminant data manifold. When label available, usually incorporated into by modifying weights between points. In this paper, we propose novel algorithm, called Constrained Graph Embedding, considers as additional constraints. Specifically, constrain space solutions that explore only contain embedding results are consistent with labels. Experimental on two real life sets illustrate effectiveness our proposed method.