title: Learning locality preserving graph from data.
abstract: Machine learning based on graph representation, or manifold learning, has attracted great interest in recent years. As the discrete approximation of data manifold, the graph plays a crucial role in these kinds of learning approaches. In this paper, we propose a novel learning method for graph construction, which is distinct from previous methods in that it solves an optimization problem with the aim of directly preserving the local information of the original data set. We show that the proposed objective has close connections with the popular Laplacian Eigenmap problem, and is hence well justified. The optimization turns out to be a quadratic programming problem with n(n-1)/2 variables (n is the number of data points). Exploiting the sparsity of the graph, we further propose a more efficient cutting plane algorithm to solve the problem, making the method better scalable in practice. In the context of clustering and semi-supervised learning, we demonstrated the advantages of our proposed method by experiments.
authors.forename: Yan-Ming
authors.initials: YM
authors.lastname: Zhang
authors.forename: Kaizhu
authors.initials: K
authors.lastname: Huang
authors.forename: Xinwen
authors.initials: X
authors.lastname: Hou
authors.forename: Cheng-Lin
authors.initials: CL
authors.lastname: Liu
mesh_terms: D000465:Algorithms; D001185:Artificial Intelligence; D003198:Computer Simulation; D007090:Image Interpretation, Computer-Assisted / Q000379:methods*; D015233:Models, Statistical; D010363:Pattern Recognition, Automated / Q000379:methods*