Comparison of Brain Networks with Unknown Correspondences
원문 초록
Graph theory has drawn a lot of attention in the field of Neuroscience during the last decade, mainly due to the abundance of tools that it provides to explore the interactions of elements in a complex network like the brain. The local and global organization of a brain network can shed light on mechanisms of complex cognitive functions, while disruptions within the network can be linked to neurodevelopmental disorders. In this effort, the construction of a representative brain network for each individual is critical for further analysis. Additionally, graph comparison is an essential step for inference and classification analyses on brain graphs. In this work we explore a method based on graph edit distance for evaluating graph similarity, when correspondences between network elements are unknown due to different underlying subdivisions of the brain. We test this method on 30 unrelated subjects as well as 40 twin pairs and show that this method can accurately reflect the higher similarity between two related networks compared to unrelated ones, while identifying node correspondences.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
SCENIR: Visual Semantic Clarity through Unsupervised Scene Graph Retrieval
HeGMN: Heterogeneous Graph Matching Network for Learning Graph Similarity
Quality Measures for Dynamic Graph Generative Models
Neural Network Graph Similarity Computation Based on Graph Fusion
GraSP: Simple yet Effective Graph Similarity Predictions
Covered Forest: Fine-grained generalization analysis of graph neural networks
토론
이 논문과 연결된 포럼 글이 아직 없습니다.