Browse State-of-the-Art › Inductive Learning
Inductive Learning
66 papers with code · 0 benchmarks · 0 datasets archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
No dataset record in the archive lists this task.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Most implemented papers archive 2025-07-28
30 shown of 66 papers with code (153 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
27 Sep 2018 11 repositories listed Syntology ran 24 of 35 samples · 11 unverified · 9 pointer-only (licence)We present Deep Graph Infomax (DGI), a general approach for learning node representations within graph-structured data in an unsupervised manner.
-
10 Jul 2019 8 repositories listedGraph Convolutional Networks (GCNs) are powerful models for learning representations of attributed graphs.
-
5 May 2019 4 repositories listed Syntology ran 0 of 6 samples · 6 unverified · 1 pointer-only (licence)Network embedding (or graph embedding) has been widely used in many real-world applications.
-
7 Jun 2020 3 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)Moreover, our unsupervised method even surpasses its supervised counterparts on transductive tasks, demonstrating its great potential in real-world applications.
-
2 May 2023 2 repositories listedSolving Constrained Horn Clauses (CHCs) is a fundamental challenge behind a wide range of verification and analysis tasks.
-
6 Feb 2023 2 repositories listed Syntology ran 0 of 13 samples · 13 unverifiedIt aims to infer knowledge for (the things at) unobserved locations using the data from (the things at) observed locations during a given time period of interest.
-
14 Feb 2022 2 repositories listedFOLD-RM is an automated inductive learning algorithm for learning default rules for mixed (numerical and categorical) data.
-
21 Jan 2021 2 repositories listed Syntology ran 1 of 1 samples · 0 unverified · 1 pointer-only (licence)The complexity and streaming nature of social messages make it appealing to address social event detection in an incremental learning setting, where acquiring, preserving, and extending knowledge are major concerns.
-
GTEA: Inductive Representation Learning on Temporal Interaction Graphs via Temporal Edge Aggregation11 Sep 2020 2 repositories listedIn this paper, we propose the Graph Temporal Edge Aggregation (GTEA) framework for inductive learning on Temporal Interaction Graphs (TIGs).
-
21 Jun 2020 2 repositories listed Syntology ran 3 of 14 samples · 11 unverifiedIn this paper, we propose an end-to-end graph learning framework, namely Iterative Deep Graph Learning (IDGL), for jointly and iteratively learning graph structure and graph embedding.
-
11 Jun 2020 2 repositories listedproviding a head-to-head comparison of AutoML and DL in the context of binary classification on 6 well-characterized public datasets, and (2.)
-
7 Oct 2019 2 repositories listedFrom social networks to protein complexes to disease genomes to visual data, hypergraphs are everywhere.
-
26 Apr 2019 2 repositories listed Syntology ran 0 of 7 samples · 7 unverifiedWe propose the Neural Logic Machine (NLM), a neural-symbolic architecture for both inductive learning and logic reasoning.
-
7 Feb 2018 2 repositories listedRandom walks are at the heart of many existing network embedding methods.
-
13 Jan 2025 1 repository listedIn this paper, we propose an offline algorithm based on inductive logic programming from noisy examples to extract task specifications (i.
-
10 Nov 2024 1 repository listedAlthough Finite Element Analysis (FEA) is reliable for approximating soft tissue deformation, it struggles with balancing accuracy and computational efficiency.
-
26 Sep 2024 1 repository listedThe goal of generalized few-shot semantic segmentation (GFSS) is to recognize novel-class objects through training with a few annotated examples and the base-class model that learned the knowledge about the base classes.
-
12 Jul 2024 1 repository listedAnother contribution is a mathematical lower bound to quantify the robustness of node embeddings, confirming its advantage over traditional shallow embedding methods, particularly in the presence of parameter noise.
-
15 Apr 2024 1 repository listedIn particular, we propose to combine the given network and the tree and apply a Graph Neural Network to this network-tree graph.
-
28 Feb 2024 1 repository listed Syntology ran 0 of 1 samples · 1 unverifiedThis paper presents FlowCyt, the first comprehensive benchmark for multi-class single-cell classification in flow cytometry data.
-
1 Sep 2023 1 repository listedHowever, we notice that this paradigm leads to the inevitable non-identifiability and explainability overfitting problem, which is harmful to the quantification of learners' cognitive states and the quality of web…
-
10 Jul 2023 1 repository listed Syntology ran 6 of 7 samples · 1 unverified · 1 pointer-only (licence)Constraint satisfaction problems (CSPs) are about finding values of variables that satisfy the given constraints.
-
31 May 2023 1 repository listed Syntology ran 1 of 3 samples · 2 unverified · 3 pointer-only (licence)In this paper, we propose an INductive knowledge GRAph eMbedding method, InGram, that can generate embeddings of new relations as well as new entities at inference time.
-
2 Apr 2023 1 repository listedMost previous TKGC methods only consider predicting the missing links among the entities seen in the training set, while they are unable to achieve great performance in link prediction concerning newly-emerged unseen…
-
1 Jan 2023 1 repository listedOur code is available at https://github.
-
5 Dec 2022 1 repository listedRecently, the joint learning framework (JOINT) integrates matching based transductive reasoning and online inductive learning to achieve accurate and robust semi-supervised video object segmentation (SVOS).
-
26 Nov 2022 1 repository listedGraph Neural Networks (GNNs) are able to achieve high classification accuracy on many important real world datasets, but provide no rigorous notion of predictive uncertainty.
-
21 Oct 2022 1 repository listedLarge language models (LMs) have rapidly become a mainstay in Natural Language Processing.
-
23 Jul 2022 1 repository listedTo avoid retraining an entire model on the whole KGs whenever new entities and triples come, we present a continual alignment method for this task.
-
16 Jun 2022 1 repository listedWe compare our FocalConvNet with other SOTA on Kvasir-Capsule, a large-scale VCE dataset with 44, 228 frames with 13 classes of different anomalies.
Syntology lines on 10 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections