TaBIIC2: Interactive Building of Ontological Taxonomies using Weighted Self-Organizing Maps

• URL: http://arxiv.org/abs/2605.24899v1
• Date: Sun, 24 May 2026 06:55:34 GMT
• Title: TaBIIC2: Interactive Building of Ontological Taxonomies using Weighted Self-Organizing Maps
• Abstract summary: We describe a tool that enables the progressive and interactive construction of a taxonomy of concepts.<n>We rely on weighted self-organizing maps as a clustering method.<n>We show that, by integrating this mechanism and others, this tool represents a middle ground between purely manual analysis and automatic methods.
• Score: 1.5533842336139063
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Ontologies represent the conceptual knowledge of a domain. At the core of an ontology is the taxonomy of concepts and subconcepts that represent specific entities, which can be complex to build. In many cases, information is available in the form of records describing the characteristics of relevant entities, i.e., tabular data. Identifying patterns and similarities in such data can serve as a basis for identifying concepts and organizing them. However, doing so manually can be challenging, and purely automatic approaches, such as agglomerative clustering or relying on a large language model to analyze the data, can leave the user with overwhelming results and little control. In this paper, we describe a tool that enables the progressive and interactive construction of a taxonomy of concepts by identifying clusters as well as their intentional definitions. To do so, we rely on weighted self-organizing maps as a clustering method because they enable the creation of an arbitrary number of clusters that are distinct with respect to the distributions of values of specific characteristics of the clustered entities. We show that, by integrating this mechanism and others for rapidly creating concepts that group together instances from tabular data, this tool represents a middle ground between purely manual analysis and automatic methods for building ontological taxonomies.

Related papers

• Cluster-R1: Large Reasoning Models Are Instruction-following Clustering Agents [81.79110139097297]
  General-purpose embedding models excel at recognizing semantic similarities but fail to capture the characteristics of texts specified by user instructions.<n>We reframe instruction-following clustering as a generative task and train large reasoning models as autonomous clustering agents.<n>Our reasoning-driven training pipeline enables LRMs to interpret high-level clustering instructions and then infer the corresponding latent groupings.
  arXiv  Detail & Related papers  (2026-03-06T10:15:54Z)
• Learning Unified Distance Metric for Heterogeneous Attribute Data Clustering [60.05209293008078]
  Heterogeneous Attribute Reconstruction and Representation (HARR) learning paradigm for cluster analysis.<n>HarR is parameter-free, convergence-guaranteed, and can more effectively self-adapt to different sought number of clusters $k$.
  arXiv  Detail & Related papers  (2026-03-03T08:13:16Z)
• Bridging the Semantic Gap for Categorical Data Clustering via Large Language Models [64.58262227709842]
  ARISE (Attention-weighted Representation with Integrated Semantic Embeddings) is presented.<n>It builds semantic-aware representations that complement the metric space of categorical data for accurate clustering.<n>Experiments on eight benchmark datasets demonstrate consistent improvements over seven representative counterparts.
  arXiv  Detail & Related papers  (2026-01-03T11:37:46Z)
• ConceptScope: Characterizing Dataset Bias via Disentangled Visual Concepts [54.60525564599342]
  ConceptScope is a scalable and automated framework for analyzing visual datasets.<n>It categorizes concepts into target, context, and bias types based on their semantic relevance and statistical correlation to class labels.<n>It reliably detects known biases and uncovers previously unannotated ones.
  arXiv  Detail & Related papers  (2025-10-30T06:46:17Z)
• Question-Driven Analysis and Synthesis: Building Interpretable Thematic Trees with LLMs for Text Clustering and Controllable Generation [1.3750624267664158]
  We introduce Recursive Thematic Partitioning (RTP) to interactively build a binary tree.<n>Each node in the tree is a natural language question that semantically partitions the data, resulting in a fully interpretable taxonomy.<n>We show that RTP's question-driven hierarchy is more interpretable than the keyword-based topics from a strong baseline like BERTopic.
  arXiv  Detail & Related papers  (2025-09-26T11:27:22Z)
• Explainable Mapper: Charting LLM Embedding Spaces Using Perturbation-Based Explanation and Verification Agents [11.168089496463125]
  Large language models (LLMs) produce high-dimensional embeddings that capture rich semantic and syntactic relationships between words, sentences, and concepts.<n>We introduce a framework for semi-automatic annotation of these embedding properties.
  arXiv  Detail & Related papers  (2025-07-24T17:43:40Z)
• TaBIIC: Taxonomy Building through Iterative and Interactive Clustering [2.817412580574242]
  In this paper, we explore a method that takes inspiration from both approaches in an iterative and interactive process. We show that this method is applicable on a variety of data sources and leads to that can be more directly integrated into an ontology.
  arXiv  Detail & Related papers  (2023-12-10T12:17:43Z)
• Recognizing Entity Types via Properties [5.622134113488239]
  We introduce a property-based approach that allows recognizing etypes on the basis of the properties used to define them. The main contribution consists of a set of property-based metrics measuring the similarity between etypes and entities, and a machine learning algorithm exploiting the proposed similarity metrics.
  arXiv  Detail & Related papers  (2023-04-16T22:42:30Z)
• Feature construction using explanations of individual predictions [0.0]
  We propose a novel approach for reducing the search space based on aggregation of instance-based explanations of predictive models. We empirically show that reducing the search to these groups significantly reduces the time of feature construction. We show significant improvements in classification accuracy for several classifiers and demonstrate the feasibility of the proposed feature construction even for large datasets.
  arXiv  Detail & Related papers  (2023-01-23T18:59:01Z)
• Adaptive Attribute and Structure Subspace Clustering Network [49.040136530379094]
  We propose a novel self-expressiveness-based subspace clustering network. We first consider an auto-encoder to represent input data samples. Then, we construct a mixed signed and symmetric structure matrix to capture the local geometric structure underlying data. We perform self-expressiveness on the constructed attribute structure and matrices to learn their affinity graphs.
  arXiv  Detail & Related papers  (2021-09-28T14:00:57Z)
• Quantifying Learnability and Describability of Visual Concepts Emerging in Representation Learning [91.58529629419135]
  We consider how to characterise visual groupings discovered automatically by deep neural networks. We introduce two concepts, visual learnability and describability, that can be used to quantify the interpretability of arbitrary image groupings.
  arXiv  Detail & Related papers  (2020-10-27T18:41:49Z)

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.