A Simple Baseline Algorithm for Graph Classification
Graph classification has recently received a lot of attention from various fields of machine learning e.g. kernel methods, sequential modeling or graph embedding. All these approaches offer promising results with different respective strengths and weaknesses. However, most of them rely on complex mathematics and require heavy computational power to achieve their best performance. We propose a simple and fast algorithm based on the spectral decomposition of graph Laplacian to perform graph classification and get a first reference score for a dataset. We show that this method obtains competitive results compared to state-of-the-art algorithms.
Code (3)
Tasks
BIG-bench Machine LearningClassificationGeneral ClassificationGraph ClassificationGraph EmbeddingSimilar Papers 제목 키워드 기반
Molecular Topological Profile (MOLTOP) - Simple and Strong Baseline for Molecular Graph Classification
We revisit the effectiveness of topological descriptors for molecular graph classification and design a simple, yet strong baseline. We demonstrate that a simple approach to feature engineering - employing histogram aggr…
Feature EngineeringGraph ClassificationMolecular Topological Profile (MOLTOP) -- Simple and Strong Baseline for Molecular Graph Classification
We revisit the effectiveness of topological descriptors for molecular graph classification and design a simple, yet strong baseline. We demonstrate that a simple approach to feature engineering - employing histogram aggr…
Feature EngineeringGraph ClassificationA simple yet effective baseline for non-attributed graph classification
Graphs are complex objects that do not lend themselves easily to typical learning tasks. Recently, a range of approaches based on graph kernels or graph neural networks have been developed for graph classification and fo…
ClassificationComputational EfficiencyGeneral ClassificationGraph Classification+3Strengthening structural baselines for graph classification using Local Topological Profile
We present the analysis of the topological graph descriptor Local Degree Profile (LDP), which forms a widely used structural baseline for graph classification. Our study focuses on model evaluation in the context of the …
Graph ClassificationGraph Representation LearningModel SelectionRepresentation LearningConvolutional Signal Propagation: A Simple Scalable Algorithm for Hypergraphs
Last decade has seen the emergence of numerous methods for learning on graphs, particularly Graph Neural Networks (GNNs). These methods, however, are often not directly applicable to more complex structures like bipartit…
Node ClassificationRetrieval