A Comparative Study of Uncertain Knowledge Representation Methods

Li, Fengru; Xie, Wei; Jiang, Yonglei; Fan, Zhe

doi:10.1109/itnec48623.2020.9084983

Cited by 2 publications

(1 citation statement)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, with an uncertainty graph, we can set a threshold probability value and decide to ignore any component with an existence probability below that threshold ( Khan et al, 2018b ). In recent years, uncertain graphs have been applied to many fields, especially biological networks, mobile ad hoc networks, social networks, and other applications where edges are assigned a probability of existence due to a range of factors, such as noisy measurements, the lack of precise information, and inconsistent, incorrect, and potentially ambiguous sources of information ( Zhang et al, 2017 ; Khan et al, 2018a ; Li et al, 2020 ; Saha et al, 2021 ).…”

Section: Methodsmentioning

confidence: 99%

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

Zhou

et al. 2022

Front. Neurosci.

View full text Add to dashboard Cite

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.

show abstract