Factorizing formal contexts from closures of necessity operators

• URL: http://arxiv.org/abs/2604.09582v1
• Date: Wed, 25 Feb 2026 19:32:09 GMT
• Title: Factorizing formal contexts from closures of necessity operators
• Abstract summary: We study properties related to the pairs of sets from which a factorization of a formal context arises.<n>We also inspect how the properties given in the classical case can be extended to the fuzzy framework.
• Score: 0.5352699766206807
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Factorizing datasets is an interesting process in a multitude of approaches, but many times it is not possible or efficient the computation of a factorization of the dataset. A method to obtain independent subcontexts of a formal context with Boolean data was proposed in~\cite{dubois:2012}, based on the operators used in possibility theory. In this paper, we will analyze this method and study different properties related to the pairs of sets from which a factorization of a formal context arises. We also inspect how the properties given in the classical case can be extended to the fuzzy framework, which is essential to obtain a mechanism that allows the computation of independent subcontexts of a fuzzy context.

Related papers

• On the Structural Limits of Machine Learning Decision Systems: An Information-Theoretic, Interaction-Based, and Stochastic-Dynamical Perspective [0.0]
  In this work we examine intrinsic limits of data-driven decision systems from an information-theoretic and interaction-based perspective.<n>We analyze minimal achievable error in classification through Fano-type bounds and precision limits in parametric estimation via the Cramér-Rao inequality.
  arXiv  Detail & Related papers  (2026-08-13T17:34:41Z)
• Self-explainable Operator Learning for Discovering Spatial Patterns in Functional Data [0.24554686192257422]
  Operator learning has emerged as a powerful tool for modeling complex physical systems in functional spaces.<n>We introduce a self-explainable operator learning framework that overcomes this challenge by reformulating operator learning as a linear combination of generalized functional linear models.<n>We demonstrate the framework on function-to-scalar and function-to-function mappings in fluid flow problems involving blood flow and unsteady aerodynamics.
  arXiv  Detail & Related papers  (2026-07-02T14:11:20Z)
• GUT-IS: A Data-Driven Approach to Integrating Constructs and Their Relations in Information Systems [0.0]
  We present an approach that aims at the integration of structural equation models into a unified model.<n>We use a combination of task-adapted text embeddings and clustering to produce a candidate set of construct groupings.<n>We select the optimal solution using a loss function that explicitly trades off semantic purity and parsimony in the number of clusters.
  arXiv  Detail & Related papers  (2026-05-18T15:44:43Z)
• Towards Worst-Case Guarantees with Scale-Aware Interpretability [58.519943565092724]
  Neural networks organize information according to the hierarchical, multi-scale structure of natural data.<n>We propose a unifying research agenda -- emphscale-aware interpretability -- to develop formal machinery and interpretability tools.
  arXiv  Detail & Related papers  (2026-02-05T01:22:31Z)
• A Framework for Quantifying How Pre-Training and Context Benefit In-Context Learning [52.07397258423034]
  We propose a new framework to analyze the ICL performance in a class of realistic settings.<n>We derive the precise relationship between ICL performance, context length and the KL divergence between pre-train and query task distribution.
  arXiv  Detail & Related papers  (2025-10-26T09:21:29Z)
• Formal Concept Analysis: a Structural Framework for Variability Extraction and Analysis [0.0]
  Formal Concept Analysis (FCA) is a mathematical framework for knowledge representation and discovery.<n>This paper attempts to bridge a gap by gathering a selection of properties of the framework which are essential to variability analysis.
  arXiv  Detail & Related papers  (2025-08-08T19:30:14Z)
• Partial Transportability for Domain Generalization [56.37032680901525]
  Building on the theory of partial identification and transportability, this paper introduces new results for bounding the value of a functional of the target distribution.<n>Our contribution is to provide the first general estimation technique for transportability problems.<n>We propose a gradient-based optimization scheme for making scalable inferences in practice.
  arXiv  Detail & Related papers  (2025-03-30T22:06:37Z)
• A Compositional Atlas for Algebraic Circuits [35.95450187283255]
  We show that a large class of queries correspond to a combination of basic operators over semirings: aggregation, product, and elementwise mapping.<n>Applying our analysis, we derive novel tractability conditions for many such compositional queries.
  arXiv  Detail & Related papers  (2024-12-07T00:51:46Z)
• Flow Factorized Representation Learning [109.51947536586677]
  We introduce a generative model which specifies a distinct set of latent probability paths that define different input transformations. We show that our model achieves higher likelihoods on standard representation learning benchmarks while simultaneously being closer to approximately equivariant models.
  arXiv  Detail & Related papers  (2023-09-22T20:15:37Z)
• Geometric Constraints in Probabilistic Manifolds: A Bridge from Molecular Dynamics to Structured Diffusion Processes [0.0]
  We propose a method that enables sampling from distributions that rigorously adhere to arbitrary sets of geometric constraints in Euclidean spaces. This is achieved by integrating a constraint projection operator within the well-regarded architecture of Denoising Diffusion Probabilistic Models.
  arXiv  Detail & Related papers  (2023-07-10T11:31:15Z)
• Shapley Based Residual Decomposition for Instance Analysis [0.0]
  We introduce the idea of decomposing the residuals of regression with respect to the data instances instead of features. This allows us to determine the effects of each individual instance on the model and each other, and in doing so makes for a model-agnostic method of identifying instances of interest.
  arXiv  Detail & Related papers  (2023-05-30T08:07:41Z)
• Object Representations as Fixed Points: Training Iterative Refinement Algorithms with Implicit Differentiation [88.14365009076907]
  Iterative refinement is a useful paradigm for representation learning. We develop an implicit differentiation approach that improves the stability and tractability of training.
  arXiv  Detail & Related papers  (2022-07-02T10:00:35Z)
• MINIMALIST: Mutual INformatIon Maximization for Amortized Likelihood Inference from Sampled Trajectories [61.3299263929289]
  Simulation-based inference enables learning the parameters of a model even when its likelihood cannot be computed in practice. One class of methods uses data simulated with different parameters to infer an amortized estimator for the likelihood-to-evidence ratio. We show that this approach can be formulated in terms of mutual information between model parameters and simulated data.
  arXiv  Detail & Related papers  (2021-06-03T12:59:16Z)

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.