Hyperparameter-free and Explainable Whole Graph Embedding
Graphs can be used to describe complex systems. Recently, whole graph embedding (graph representation learning) can compress a graph into a compact lower-dimension vector while preserving intrinsic properties, earning much attention. However, most graph embedding methods have problems such as tedious parameter tuning or poor explanation. This paper presents a simple and hyperparameter-free whole graph embedding method based on the DHC (Degree, H-index, and Coreness) theorem and Shannon Entropy (E), abbreviated as DHC-E. The DHC-E can provide a trade-off between simplicity and quality for supervised classification learning tasks involving molecular, social, and brain networks. Moreover, it performs well in lower-dimensional graph visualization. Overall, the DHC-E is simple, hyperparameter-free, and explainable for whole graph embedding with promising potential for exploring graph classification and lower-dimensional graph visualization.
Code (1)
Tasks
Graph ClassificationGraph EmbeddingGraph Representation LearningHyperparameter OptimizationRepresentation LearningSimilar Papers 제목 키워드 기반
TWIG: Towards pre-hoc Hyperparameter Optimisation and Cross-Graph Generalisation via Simulated KGE Models
In this paper we introduce TWIG (Topologically-Weighted Intelligence Generation), a novel, embedding-free paradigm for simulating the output of KGEs that uses a tiny fraction of the parameters. TWIG learns weights from i…
Link PredictionExplainable and Position-Aware Learning in Digital Pathology
Encoding whole slide images (WSI) as graphs is well motivated since it makes it possible for the gigapixel resolution WSI to be represented in its entirety for the purpose of graph learning. To this end, WSIs can be brok…
Graph AttentionGraph ClassificationGraph LearningPosition+1Assessing the Effects of Hyperparameters on Knowledge Graph Embedding Quality
Embedding knowledge graphs into low-dimensional spaces is a popular method for applying approaches, such as link prediction or node classification, to these databases. This embedding process is very costly in terms of bo…
Graph EmbeddingKnowledge Graph EmbeddingKnowledge GraphsLink Prediction+2CPa-WAC: Constellation Partitioning-based Scalable Weighted Aggregation Composition for Knowledge Graph Embedding
Scalability and training time are crucial for any graph neural network model processing a knowledge graph (KG). While partitioning knowledge graphs helps reduce the training time, the prediction accuracy reduces signifca…
Graph EmbeddingGraph Neural NetworkKnowledge Graph CompletionKnowledge Graph Embedding+1Bayesian Learning of Conditional Kernel Mean Embeddings for Automatic Likelihood-Free Inference
In likelihood-free settings where likelihood evaluations are intractable, approximate Bayesian computation (ABC) addresses the formidable inference task to discover plausible parameters of simulation programs that explai…