Variable selection using svm based criteria
The Journal of Machine Learning Research
Shortest-Path Kernels on Graphs
ICDM '05 Proceedings of the Fifth IEEE International Conference on Data Mining
Hi-index | 0.00 |
Connectivity networks have been recently used for classification of neurodegenerative diseases, e.g., mild cognitive impairment (MCI). In typical connectivity network-based classification, features are often extracted from (multiple) connectivity networks and concatenated into a long vector for subsequent feature selection and classification. However, some useful network topological information may be lost in this type of approach. In this paper, we propose a new structural feature selection method which embeds the topological information of connectivity networks through graph kernel and then uses recursive feature elimination with graph kernel (RFE-GK) to select the most discriminative features. Furthermore, multiple kernel learning (MKL) is also adopted to combine multiple graph kernels for joint structural feature selectionfrom multiple connectivity networks. The experimental results show the efficacy of our proposed method with comparison to the state-of-the-art method in MCI classification, based on the connectivity networks.