Encoder Embedding for General Graph and Node Classification
Graph encoder embedding, a recent technique for graph data, offers speed and scalability in producing vertex-level representations from binary graphs. In this paper, we extend the applicability of this method to a general graph model, which includes weighted graphs, distance matrices, and kernel matrices. We prove that the encoder embedding satisfies the law of large numbers and the central limit theorem on a per-observation basis. Under certain condition, it achieves asymptotic normality on a per-class basis, enabling optimal classification through discriminant analysis. These theoretical findings are validated through a series of experiments involving weighted graphs, as well as text and image data transformed into general graph representations using appropriate distance metrics.
Code (0)
등록된 구현이 없습니다.
Tasks
ClassificationNode ClassificationMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Contrastive Meta-Learning for Few-shot Node Classification
Few-shot node classification, which aims to predict labels for nodes on graphs with only limited labeled nodes as references, is of great significance in real-world graph mining tasks. Particularly, in this paper, we ref…
ClassificationGraph MiningMeta-LearningNode ClassificationRevisiting Graph Neural Networks for Link Prediction
Graph neural networks (GNNs) have achieved great success in recent years. Three most common applications include node classification, link prediction, and graph classification. While there is rich literature on node clas…
ClassificationGraph ClassificationLink PredictionNode Classification+1Graph Representation Learning Beyond Node and Homophily
Unsupervised graph representation learning aims to distill various graph information into a downstream task-agnostic dense vector embedding. However, existing graph representation learning approaches are designed mainly …
Edge ClassificationGraph EmbeddingGraph Representation LearningNode Classification+1Node Level Graph Autoencoder: Unified Pretraining for Textual Graph Learning
Textual graphs are ubiquitous in real-world applications, featuring rich text information with complex relationships, which enables advanced research across various fields. Textual graph representation learning aims to g…
Graph LearningGraph Representation LearningLanguage ModellingLink Prediction+2Open-World Semi-Supervised Learning for Node Classification
Open-world semi-supervised learning (Open-world SSL) for node classification, that classifies unlabeled nodes into seen classes or multiple novel classes, is a practical but under-explored problem in the graph community.…
ClassificationContrastive LearningNode ClassificationOpen-World Semi-Supervised Learning