A unified feature selection framework for graph embedding on high dimensional data

Publication Type:
Journal Article
Citation:
IEEE Transactions on Knowledge and Data Engineering, 2015, 27 (6), pp. 1465 - 1477
Issue Date:
2015-06-01
Metrics:
Full metadata record
Files in This Item:
Filename Description Size
a u.pdfPublished Version960.13 kB
Adobe PDF
© 2014 IEEE. Although graph embedding has been a powerful tool for modeling data intrinsic structures, simply employing all features for data structure discovery may result in noise amplification. This is particularly severe for high dimensional data with small samples. To meet this challenge, this paper proposes a novel efficient framework to perform feature selection for graph embedding, in which a category of graph embedding methods is cast as a least squares regression problem. In this framework, a binary feature selector is introduced to naturally handle the feature cardinality in the least squares formulation. The resultant integral programming problem is then relaxed into a convex Quadratically Constrained Quadratic Program (QCQP) learning problem, which can be efficiently solved via a sequence of accelerated proximal gradient (APG) methods. Since each APG optimization is w.r.t. only a subset of features, the proposed method is fast and memory efficient. The proposed framework is applied to several graph embedding learning problems, including supervised, unsupervised, and semi-supervised graph embedding. Experimental results on several high dimensional data demonstrated that the proposed method outperformed the considered state-of-the-art methods.
Please use this identifier to cite or link to this item: