Metric Distribution to Vector: Constructing Data Representation via Broad-Scale Discrepancies
Xue Liu, Dan Sun, Xiaobo Cao, Hao Ye, Wei Wei

TL;DR
This paper introduces MetricDistribution2vec, a novel graph embedding method that captures dataset-wide metric distribution discrepancies to improve classification accuracy, especially in few-shot scenarios.
Contribution
The paper proposes a new embedding strategy that encodes distribution characteristics of data discrepancies, enhancing graph classification performance over existing methods.
Findings
Significant accuracy improvements over baseline methods on real-world datasets.
Effective in few-shot classification with limited training samples.
Lightweight models achieve competitive results.
Abstract
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 to extract such distribution characteristics into the vectorial representation for…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Graph Neural Networks · Complex Network Analysis Techniques · Bioinformatics and Genomic Networks
