Discriminative Feature Selection for Uncertain Graph Classification

by   Xiangnan Kong, et al.

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 phi-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., Alzheimer's 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.


Mining Brain Networks using Multiple Side Views for Neurological Disorder Identification

Mining discriminative subgraph patterns from graph data has attracted gr...

Robust Densest Subgraph Discovery

Dense subgraph discovery is an important primitive in graph mining, whic...

Most Probable Densest Subgraphs

Computing the densest subgraph is a primitive graph operation with criti...

Position-Aware Subgraph Neural Networks with Data-Efficient Learning

Data-efficient learning on graphs (GEL) is essential in real-world appli...

DSL: Discriminative Subgraph Learning via Sparse Self-Representation

The goal in network state prediction (NSP) is to classify the global sta...

Deep Graph Attention Model

Graph classification is a problem with practical applications in many di...

Discriminative and Semantic Feature Selection for Place Recognition towards Dynamic Environments

Features play an important role in various visual tasks, especially in v...

Please sign up or login with your details

Forgot password? Click here to reset