Efficient pattern matching on big uncertain graphs

Depression Classification Using Frequent Subgraph Mining Based on Pattern Growth of Frequent Edge in Functional Magnetic Resonance Imaging Uncertain Network

The brain network structure is highly uncertain due to the noise in imaging signals and evaluation methods. Recent works have shown that uncertain brain networks could capture uncertain information with regards to functional connections. Most of the existing research studies covering uncertain brain networks used graph mining methods for analysis; for example, the mining uncertain subgraph patterns (MUSE) method was used to mine frequent subgraphs and the discriminative feature selection for uncertain graph classification (DUG) method was used to select discriminant subgraphs. However, these methods led to a lack of effective discriminative information; this reduced the classification accuracy for brain diseases. Therefore, considering these problems, we propose an approximate frequent subgraph mining algorithm based on pattern growth of frequent edge (unFEPG) for uncertain brain networks and a novel discriminative feature selection method based on statistical index (dfsSI) to perform graph mining and selection. Results showed that compared with the conventional methods, the unFEPG and dfsSI methods achieved a higher classification accuracy. Furthermore, to demonstrate the efficacy of the proposed method, we used consistent discriminative subgraph patterns based on thresholding and weighting approaches to compare the classification performance of uncertain networks and certain networks in a bidirectional manner. Results showed that classification performance of the uncertain network was superior to that of the certain network within a defined sparsity range. This indicated that if a better classification performance is to be achieved, it is necessary to select a certain brain network with a higher threshold or an uncertain brain network model. Moreover, if the uncertain brain network model was selected, it is necessary to make full use of the uncertain information of its functional connection.

A Review of Point Set Registration: From Pairwise Registration to Groupwise Registration

This paper presents a comprehensive literature review on point set registration. The state-of-the-art modeling methods and algorithms for point set registration are discussed and summarized. Special attention is paid to methods for pairwise registration and groupwise registration. Some of the most prominent representative methods are selected to conduct qualitative and quantitative experiments. From the experiments we have conducted on 2D and 3D data, CPD-GL pairwise registration algorithm and JRMPC groupwise registration algorithm seem to outperform their rivals both in accuracy and computational complexity. Furthermore, future research directions and avenues in the area are identified.