Convergence issues in Relational Concept Analysis based on AOC-posets

• URL: http://arxiv.org/abs/2609.00054v1
• Date: Sun, 30 Aug 2026 10:09:37 GMT
• Title: Convergence issues in Relational Concept Analysis based on AOC-posets
• Abstract summary: Formal Concept Analysis (RCA) is an approach for conceptual classification building and rule discovery from a binary table.<n>RCA aims to highlight groups of objects characterized by their relationships with other groups of objects.<n>We show why convergence is no longer guaranteed in the general case, identify conditions under which it can still be ensured, and discuss how a can recover convergence.
• Score: 0.2348805691644085
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Formal Concept Analysis (FCA) is an approach for conceptual classification building and rule discovery from a binary table describing a set of objects by a set of attributes. Extensions have been proposed to deal with non-binary and more complex data, such as Relational Concept Analysis (RCA) for multi-relational data. RCA aims to highlight groups of objects characterized by their relationships with other groups of objects. The richer and more complex nature of the underlying data allows RCA to produce richer results than FCA, at the expense of higher computational and interpretive complexity. The most commonly used conceptual classification structure in FCA is the concept lattice. However, in many applications, concept lattice substructures, such as AOC-posets, are preferred over the full lattice, either to mitigate combinatorial blow-up or to focus on the most informative parts of the structure. Indeed, in an AOC-poset, only concepts introducing an object or an attribute are represented, which makes AOC-posets smaller and easier to compute and use than concept lattices. Although RCA was originally defined on concept lattices, it can also be instantiated on AOC-posets. RCA is iterative and its convergence is guaranteed in the lattice-based setting, but this guarantee is lost when using AOC-posets. In this paper, we investigate this loss of convergence in detail. We show why convergence is no longer guaranteed in the general case, identify conditions under which it can still be ensured, and discuss how a dataset can be transformed to recover convergence. We also propose a convergent variant of the process, which preserves the AOC-poset structure: relational attributes, once created, are never removed, which guarantees convergence at the price of attributes that may refer to concepts absent from the final structures.

Related papers

• Imputation Meets Clustering: Exploiting Latent Subgroup Structure for Missing Data Recovery [52.29866804948133]
  We propose CAGI (Cluster-Aware Generative Imputation), a framework that reformulates clustering and imputation as a mutually reinforcing co-optimization process.<n>Experiments on 14 benchmark datasets with 15 representative baselines demonstrate the superiority of CAGI.
  arXiv  Detail & Related papers  (2026-07-08T02:50:02Z)
• CIR-CoT: Towards Interpretable Composed Image Retrieval via End-to-End Chain-of-Thought Reasoning [93.05917922306196]
  Composed Image Retrieval (CIR) aims to find a target image from a reference image and a modification text.<n>CIR-CoT is the first end-to-end retrieval-oriented MLLM designed to integrate explicit Chain-of-Thought (CoT) reasoning.
  arXiv  Detail & Related papers  (2025-10-09T09:41:45Z)
• Learning Identifiable Structures Helps Avoid Bias in DNN-based Supervised Causal Learning [56.22841701016295]
  Supervised Causal Learning (SCL) is an emerging paradigm in this field.<n>Existing Deep Neural Network (DNN)-based methods commonly adopt the "Node-Edge approach"
  arXiv  Detail & Related papers  (2025-02-15T19:10:35Z)
• Non-monotonic Extensions to Formal Concept Analysis via Object Preferences [3.4873708563238277]
  We introduce a non-monotonic conditional between sets of attributes, which assumes a preference over the set of objects. We show that this conditional gives rise to a consequence relation consistent with the postulates for non-monotonicty. This notion of typical concepts is a further introduction of KLM-style typicality into Formal Concept Analysis.
  arXiv  Detail & Related papers  (2024-10-05T15:01:00Z)
• CONDA: Condensed Deep Association Learning for Co-Salient Object Detection [136.30039346735833]
  This paper proposes a deep association learning strategy that deploys deep networks on raw associations to transform them into deep association features. Experimental results in three benchmark datasets demonstrate the remarkable effectiveness of our proposed method with various training settings.
  arXiv  Detail & Related papers  (2024-09-02T08:01:32Z)
• Stepwise functional refoundation of relational concept analysis [0.0]
  concept analysis (RCA) is an extension of formal concept analysis allowing to deal with several related contexts simultaneously.<n> RCA returns a single family of concept lattices but when the data feature circular dependencies, other solutions may be considered acceptable.<n>We show that RCA returns the least element of the set of acceptable solutions.
  arXiv  Detail & Related papers  (2023-10-10T09:13:46Z)
• Improved Representation Learning Through Tensorized Autoencoders [7.056005298953332]
  Autoencoders (AE) are widely used in practice for unsupervised representation learning. We propose a meta-algorithm that can be used to extend an arbitrary AE architecture to a tensorized version (TAE) We prove that TAE can recover the principle components of the different clusters in contrast to principle component of the entire data recovered by a standard AE.
  arXiv  Detail & Related papers  (2022-12-02T09:29:48Z)
• Entity Concept-enhanced Few-shot Relation Extraction [35.10974511223129]
  Few-shot relation extraction (FSRE) is of great importance in long-tail distribution problem. Most existing FSRE algorithms fail to accurately classify the relations merely based on the information of the sentences together with the recognized entity pairs. We propose a novel entity-enhanced FEw-shot Relation Extraction scheme (ConceptFERE), which introduces the inherent concepts of entities to provide clues for relation prediction.
  arXiv  Detail & Related papers  (2021-06-04T10:36:49Z)
• Unveiling the Potential of Structure-Preserving for Weakly Supervised Object Localization [71.79436685992128]
  We propose a two-stage approach, termed structure-preserving activation (SPA), towards fully leveraging the structure information incorporated in convolutional features for WSOL. In the first stage, a restricted activation module (RAM) is designed to alleviate the structure-missing issue caused by the classification network. In the second stage, we propose a post-process approach, termed self-correlation map generating (SCG) module to obtain structure-preserving localization maps.
  arXiv  Detail & Related papers  (2021-03-08T03:04:14Z)
• Hierarchical Conditional Relation Networks for Video Question Answering [62.1146543269993]
  We introduce a general-purpose reusable neural unit called Conditional Relation Network (CRN) CRN serves as a building block to construct more sophisticated structures for representation and reasoning over video. Our evaluations on well-known datasets achieved new SoTA results, demonstrating the impact of building a general-purpose reasoning unit on complex domains such as VideoQA.
  arXiv  Detail & Related papers  (2020-02-25T07:00:48Z)

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.