Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Shachar Klaiman

dblp:292/4347 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
0009-0003-8002-2575ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Graph learning · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Graph learning
graph neural network
1.012026
Demystifying Higher-Order Graph Neural Networks · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Machine learning › Graph learning › graph neural network › graph neural network architecture
higher-order graph neural network
1.012026
Demystifying Higher-Order Graph Neural Networks · IEEE Trans. Pattern Anal. Mach. Intell. 2026
Machine learning › Graph learning › geometric learning
topological deep learning
1.012026
Demystifying Higher-Order Graph Neural Networks · IEEE Trans. Pattern Anal. Mach. Intell. 2026

Methods — techniques the papers use, named apart from their topics

taxonomy analysis · 1.0polyadic relations · 1.0
YearPublicationVenuePosition
2026 Demystifying Higher-Order Graph Neural Networks
abstract
Higher-order graph neural networks (HOGNNs) and the related architectures from Topological Deep Learning are an important class of GNN models that harness polyadic relations between vertices beyond plain edges. They have been used to eliminate issues such as over-smoothing or over-squashing, to significantly enhance the accuracy of GNN predictions, to improve the expressiveness of GNN architectures, and for numerous other goals. A plethora of HOGNN models have been introduced, and they come with diverse neural architectures, and even with different notions of what the "higher-order" means. This richness makes it very challenging to appropriately analyze and compare HOGNN models, and to decide in what scenario to use specific ones. To alleviate this, we first design an in-depth taxonomy and a blueprint for HOGNNs. This facilitates designing models that maximize performance. Then, we use our taxonomy to analyze and compare the available HOGNN models. The outcomes of our analysis are synthesized in a set of insights that help to select the most beneficial GNN model in a given scenario, and a comprehensive list of challenges and opportunities for further research into more powerful HOGNNs.
Maciej Besta, Florian Scheidl, Lukas Gianinazzi, Grzegorz Kwasniewski, Shachar Klaiman, Torsten Hoefler
IEEE Trans. Pattern Anal. Mach. Intell.5
2021 DocReader: Bounding-Box Free Training of a Document Information Extraction Model
Shachar Klaiman, Marius Lehne
ICDAR (1)1