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.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringMolecular Property PredictionPredictionProperty PredictionProtein Interface PredictionSimilar Papers 제목 키워드 기반
Multiscale Graph Construction Using Non-local Cluster Features
This paper presents a multiscale graph construction method using both graph and signal features. Multiscale graph is a hierarchical representation of the graph, where a node at each level indicates a cluster in a finer r…
ClusteringGraph Clusteringgraph constructionPoint Cloud SegmentationHierarchical Graph Convolutional Network Built by Multiscale Atlases for Brain Disorder Diagnosis Using Functional Connectivity
Functional connectivity network (FCN) data from functional magnetic resonance imaging (fMRI) is increasingly used for the diagnoses of brain disorders. However, state-of-the-art studies used to build the FCN using a sing…
DiagnosticFunctional ConnectivityHierarchical Homogeneity-Based Superpixel Segmentation: Application to Hyperspectral Image Analysis
Hyperspectral image (HI) analysis approaches have recently become increasingly complex and sophisticated. Recently, the combination of spectral-spatial information and superpixel techniques have addressed some hyperspect…
Hyperspectral image analysisSuperpixelsGraph-based data clustering via multiscale community detection
We present a graph-theoretical approach to data clustering, which combines the creation of a graph from the data with Markov Stability, a multiscale community detection framework. We show how the multiscale capabilities …
ClusteringCommunity Detectiongraph constructionSensitivityImage Segmentation Based on Multiscale Fast Spectral Clustering
In recent years, spectral clustering has become one of the most popular clustering algorithms for image segmentation. However, it has restricted applicability to large-scale images due to its high computational complexit…
ClusteringImage SegmentationSemantic SegmentationSuperpixels+1