Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies
Not on the map. Why?
Abstract (arXiv)
Graph embedding provides a feasible methodology to conduct pattern classification for graph-structured data by mapping each data into the vectorial space. Various pioneering works are essentially coding method that concentrates on a vectorial representation about the inner properties of a graph in terms of the topological constitution, node attributions, link relations, etc. However, the classification for each targeted data is a qualitative issue based on understanding the overall discrepancies within the dataset scale. From the statistical point of view, these discrepancies manifest a metric distribution over the dataset scale if the distance metric is adopted to measure the pairwise similarity or dissimilarity. Therefore, we present a novel embedding strategy named MetricDistribution2vec to extract such distribution characteristics into the vectorial representation for each data. We demonstrate the application and effectiveness of our representation method in the supervised prediction tasks on extensive real-world structural graph datasets. The results have gained some unexpected increases compared with a surge of baselines on all the datasets, even if we take the lightweight models as classifiers. Moreover, the proposed methods also conducted experiments in Few-Shot classification scenarios, and the results still show attractive discrimination in rare training samples based inference.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 27 of its 61 references that are in the map. First posted on arXiv 2 Oct 2022.
Builds on
27 of 61 references.
References · 27
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,282
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
- 2020Open Graph Benchmark: Datasets for Machine Learning on Graphscited by 2,148
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,913
- 2014DeepWalk: Online Learning of Social Representationscited by 1,543
- 2017Deep Gaussian Embedding of Graphs: Unsupervised Inductive Learning via Rankingcited by 332
- 2016Learning Convolutional Neural Networks for Graphscited by 314
- 2017graph2vec: Learning Distributed Representations of Graphscited by 228
- 2017No Fuss Distance Metric Learning using Proxiescited by 225
- 2019SoftTriple Loss: Deep Metric Learning Without Triplet Samplingcited by 163
- 2019A Survey on Graph Kernelscited by 148
- 2019Wasserstein Weisfeiler-Lehman Graph Kernelscited by 104
15 more
- 2018Fused Gromov-Wasserstein distance for structured objects: theoretical foundations and mathematical propertiescited by 93
- 2021AutoGCL: Automated Graph Contrastive Learning via Learnable View Generatorscited by 73
- 2022Hypergraph Contrastive Collaborative Filteringcited by 63
- 2019Learning metrics for persistence-based summaries and applications for graph classificationcited by 57
- 2018Anonymous Walk Embeddingscited by 46
- 2019Few-Shot Learning with Global Class Representationscited by 44
- 2019An Optimal Transport approach for the Schr"odinger bridge problem and convergence of Sinkhorn algorithmcited by 38
- 2020Fewer is More: A Deep Graph Metric Learning Perspective Using Fewer Proxiescited by 36
- 2018Persistence Fisher Kernel: A Riemannian Manifold Kernel for Persistence Diagramscited by 33
- 2016Faster Kernels for Graphs with Continuous Attributes via Hashingcited by 31
- 2020A gradient descent perspective on Sinkhorncited by 24
- 2020Learning to Compare Relation: Semantic Alignment for Few-Shot Learningcited by 8
- 2021Learning subtree pattern importance for Weisfeiler-Lehmanbased graph kernelscited by 8
- 2020Distance Metric Learning for Graph Structured Datacited by 6
- 2022Trading Hard Negatives and True Negatives: A Debiased Contrastive Collaborative Filtering Approachcited by 4
Built on by
Not cited yet.