Navigating Taxonomic Expansions of Entity Sets Driven by Knowledge Bases

• URL: http://arxiv.org/abs/2512.16953v1
• Date: Wed, 17 Dec 2025 17:38:57 GMT
• Title: Navigating Taxonomic Expansions of Entity Sets Driven by Knowledge Bases
• Authors: Pietro Cofone, Giovanni Amendola, Marco Manna, Aldo Ricioppo,
• Abstract summary: A recent logic-based framework introduces the notion of an expansion graph.<n>We formalize reasoning tasks that check whether two entities belong to comparable, incomparable, or the same nodes in the graph.<n>This enables local, incremental navigation of expansion graphs, supporting practical applications without requiring full graph construction.
• Score: 0.20999222360659606
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Recognizing similarities among entities is central to both human cognition and computational intelligence. Within this broader landscape, Entity Set Expansion is one prominent task aimed at taking an initial set of (tuples of) entities and identifying additional ones that share relevant semantic properties with the former -- potentially repeating the process to form increasingly broader sets. However, this ``linear'' approach does not unveil the richer ``taxonomic'' structures present in knowledge resources. A recent logic-based framework introduces the notion of an expansion graph: a rooted directed acyclic graph where each node represents a semantic generalization labeled by a logical formula, and edges encode strict semantic inclusion. This structure supports taxonomic expansions of entity sets driven by knowledge bases. Yet, the potentially large size of such graphs may make full materialization impractical in real-world scenarios. To overcome this, we formalize reasoning tasks that check whether two tuples belong to comparable, incomparable, or the same nodes in the graph. Our results show that, under realistic assumptions -- such as bounding the input or limiting entity descriptions -- these tasks can be implemented efficiently. This enables local, incremental navigation of expansion graphs, supporting practical applications without requiring full graph construction.

Related papers

• Graph is a Substrate Across Data Modalities [50.51414622183521]
  Graphs provide a natural representation of relational structure that arises across diverse domains.<n>Despite this ubiquity, graph structure is typically learned in a modality- and task-isolated manner.<n>We propose G-Substrate, a graph substrate framework that organizes learning around shared graph structures.
  arXiv  Detail & Related papers  (2026-01-29T22:46:02Z)
• From Features to Structure: Task-Aware Graph Construction for Relational and Tabular Learning with GNNs [6.0757501646966965]
  We introduce auGraph, a unified framework for task-aware graph augmentation.<n> auGraph enhances base graph structures by selectively promoting attributes into nodes.<n>It preserves the original data schema while injecting task-relevant structural signal.
  arXiv  Detail & Related papers  (2025-06-02T20:42:53Z)
• In-situ graph reasoning and knowledge expansion using Graph-PReFLexOR [0.0]
  We present Graph-PReFLexOR, a framework that combines graph reasoning with symbolic abstraction to dynamically expand domain knowledge.<n>Inspired by reinforcement learning, it defines reasoning as a structured mapping, where tasks yield knowledge graphs, abstract patterns, and ultimately, final answers.<n>Results show superior reasoning depth and adaptability, underscoring the potential for transparent, multidisciplinary AI-driven discovery.
  arXiv  Detail & Related papers  (2025-01-14T13:52:41Z)
• Towards Graph Foundation Models: Learning Generalities Across Graphs via Task-Trees [50.78679002846741]
  We propose a novel approach to cross-task generalization in graphs via task-trees.<n>We show that pretraining a graph neural network (GNN) on diverse task-trees with a reconstruction objective induces transferable knowledge.<n>This enables efficient adaptation to downstream tasks with minimal fine-tuning.
  arXiv  Detail & Related papers  (2024-12-21T02:07:43Z)
• T-GAE: Transferable Graph Autoencoder for Network Alignment [79.89704126746204]
  T-GAE is a graph autoencoder framework that leverages transferability and stability of GNNs to achieve efficient network alignment without retraining. Our experiments demonstrate that T-GAE outperforms the state-of-the-art optimization method and the best GNN approach by up to 38.7% and 50.8%, respectively.
  arXiv  Detail & Related papers  (2023-10-05T02:58:29Z)
• Counterfactual Explanations for Graph Classification Through the Lenses of Density [19.53018353016675]
  We define a general density-based counterfactual search framework to generate instance-level counterfactual explanations for graph classifiers. We show two specific instantiations of this general framework: a method that searches for counterfactual graphs by opening or closing triangles, and a method driven by maximal cliques. We evaluate the effectiveness of our approaches in 7 brain network datasets and compare the counterfactual statements generated according to several widely-used metrics.
  arXiv  Detail & Related papers  (2023-07-27T13:28:18Z)
• DNG: Taxonomy Expansion by Exploring the Intrinsic Directed Structure on Non-gaussian Space [15.486066629896149]
  This paper explicitly denoting each node as the combination of inherited feature (i.e., structural part) and expansion feature (i.e., supplementary part) Inspired by the Darmois-Skitovich Theorem, we implement this irreversibility by a non-Gaussian constraint on the supplementary feature.
  arXiv  Detail & Related papers  (2023-02-22T06:15:02Z)
• Taxonomy Enrichment with Text and Graph Vector Representations [61.814256012166794]
  We address the problem of taxonomy enrichment which aims at adding new words to the existing taxonomy. We present a new method that allows achieving high results on this task with little effort. We achieve state-of-the-art results across different datasets and provide an in-depth error analysis of mistakes.
  arXiv  Detail & Related papers  (2022-01-21T09:01:12Z)
• Is There More Pattern in Knowledge Graph? Exploring Proximity Pattern for Knowledge Graph Embedding [13.17623081024394]
  We name such semantic phenomenon in knowledge graph as proximity pattern. With the original knowledge graph, we design a Chained couPle-GNN architecture to deeply merge the two patterns. Being evaluated on FB15k-237 and WN18RR datasets, CP-GNN achieves state-of-the-art results for Knowledge Graph Completion task.
  arXiv  Detail & Related papers  (2021-10-02T03:50:42Z)
• Learning the Implicit Semantic Representation on Graph-Structured Data [57.670106959061634]
  Existing representation learning methods in graph convolutional networks are mainly designed by describing the neighborhood of each node as a perceptual whole. We propose a Semantic Graph Convolutional Networks (SGCN) that explores the implicit semantics by learning latent semantic-paths in graphs.
  arXiv  Detail & Related papers  (2021-01-16T16:18:43Z)
• Towards Efficient Scene Understanding via Squeeze Reasoning [71.1139549949694]
  We propose a novel framework called Squeeze Reasoning. Instead of propagating information on the spatial map, we first learn to squeeze the input feature into a channel-wise global vector. We show that our approach can be modularized as an end-to-end trained block and can be easily plugged into existing networks.
  arXiv  Detail & Related papers  (2020-11-06T12:17:01Z)
• GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions [70.9481395807354]
  We propose a Graph of Graphs Neural Network (GoGNN), which extracts the features in both structured entity graphs and the entity interaction graph in a hierarchical way. GoGNN outperforms the state-of-the-art methods on two representative structured entity interaction prediction tasks.
  arXiv  Detail & Related papers  (2020-05-12T03:46:15Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.