Discriminative Feature Selection for Uncertain Graph Classification
- 2 May 2013
- conference paper
- Published by Society for Industrial & Applied Mathematics (SIAM) in Proceedings of the ... SIAM International Conference on Data Mining. SIAM International Conference on Data Mining
- Vol. 2013, 82-93
Abstract
Mining discriminative features for graph data has attracted much attention in recent years due to its important role in constructing graph classifiers, generating graph indices, etc. Most measurement of interestingness of discriminative subgraph features are defined on certain graphs, where the structure of graph objects are certain, and the binary edges within each graph represent the “presence” of linkages among the nodes. In many real-world applications, however, the linkage structure of the graphs is inherently uncertain. Therefore, existing measurements of interestingness based upon certain graphs are unable to capture the structural uncertainty in these applications effectively. In this paper, we study the problem of discriminative subgraph feature selection from uncertain graphs. This problem is challenging and different from conventional subgraph mining problems because both the structure of the graph objects and the discrimination score of each subgraph feature are uncertain. To address these challenges, we propose a novel discriminative subgraph feature selection method, DUG, which can find discriminative subgraph features in uncertain graphs based upon different statistical measures including expectation, median, mode and φ-probability. We first compute the probability distribution of the discrimination scores for each subgraph feature based on dynamic programming. Then a branch-and-bound algorithm is proposed to search for discriminative subgraphs efficiently. Extensive experiments on various neuroimaging applications (i.e., Alzheimers Disease, ADHD and HIV) have been performed to analyze the gain in performance by taking into account structural uncertainties in identifying discriminative subgraph features for graph classification.Keywords
All Related Versions
This publication has 4 references indexed in Scilit:
- Brain effective connectivity modeling for alzheimer's disease by sparse gaussian bayesian network2011
- Abnormalities in Resting-State Functional Connectivity in Early Human Immunodeficiency Virus InfectionBrain Connectivity, 2011
- Learning brain connectivity of Alzheimer's disease by sparse inverse covariance estimationNeuroImage, 2010
- Complex brain networks: graph theoretical analysis of structural and functional systemsNature Reviews Neuroscience, 2009