A Multiscale Graph Convolutional Network Using Hierarchical Clustering
원문 초록
The information contained in hierarchical topology, intrinsic to many networks, is currently underutilised. A novel architecture is explored which exploits this information through a multiscale decomposition. A dendrogram is produced by a Girvan-Newman hierarchical clustering algorithm. It is segmented and fed through graph convolutional layers, allowing the architecture to learn multiple scale latent space representations of the network, from fine to coarse grained. The architecture is tested on a benchmark citation network, demonstrating competitive performance. Given the abundance of hierarchical networks, possible applications include quantum molecular property prediction, protein interface prediction and multiscale computational substrates for partial differential equations.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Descriptor-based Foundation Models for Molecular Property Prediction
Robust Molecular Property Prediction via Densifying Scarce Labeled Data
The Catechol Benchmark: Time-series Solvent Selection Data for Few-shot Machine Learning
Acquiring and Adapting Priors for Novel Tasks via Neural Meta-Architectures
Combining Graph Neural Networks and Mixed Integer Linear Programming for Molecular Inference under the Two-Layered Model
TRIDENT: Tri-Modal Molecular Representation Learning with Taxonomic Annotations and Local Correspondence
토론
이 논문과 연결된 포럼 글이 아직 없습니다.