1,332 research outputs found

    Characterizing One-Sided Formal Concept Analysis by Multi-Adjoint Concept Lattices

    Get PDF
    Managing and extracting information from databases is one of the main goals in several fields, as in Formal Concept Analysis (FCA). One-sided concept lattices and multi-adjoint concept lattices are two frameworks in FCA that have been developed in parallel. This paper shows that one-sided concept lattices are particular cases of multi-adjoint concept lattices. As a first consequence of this characterization, a new attribute reduction mechanism has been introduced in the one-side framework.This research was partially supported by the 2014-2020 ERDF Operational Programme in collaboration with the State Research Agency (AEI) in Project PID2019-108991GB-I00 and with the Department of Economy, Knowledge, Business and University of the Regional Government of Andalusia in Project FEDER-UCA18-108612 and by the European Cooperation in Science & Technology (COST) Action CA17124

    Solving Generalized Equations with Bounded Variables and Multiple Residuated Operators

    Get PDF
    This paper studies the resolution of sup-inequalities and sup-equations with bounded variables such that the sup-composition is defined by using different residuated operators of a given distributive biresiduated multi-adjoint lattice. Specifically, this study has analytically determined the whole set of solutions of such sup-inequalities and sup-equations. Since the solvability of these equations depends on the character of the independent term, the resolution problem has been split into three parts distinguishing among the bottom element, join-irreducible elements and join-decomposable elements

    Identifying Non-Sublattice Equivalence Classes Induced by an Attribute Reduction in FCA

    Get PDF
    The detection of redundant or irrelevant variables (attributes) in datasets becomes essential in different frameworks, such as in Formal Concept Analysis (FCA). However, removing such variables can have some impact on the concept lattice, which is closely related to the algebraic structure of the obtained quotient set and their classes. This paper studies the algebraic structure of the induced equivalence classes and characterizes those classes that are convex sublattices of the original concept lattice. Particular attention is given to the reductions removing FCA's unnecessary attributes. The obtained results will be useful to other complementary reduction techniques, such as the recently introduced procedure based on local congruences

    Linear representations of regular rings and complemented modular lattices with involution

    Full text link
    Faithful representations of regular ∗\ast-rings and modular complemented lattices with involution within orthosymmetric sesquilinear spaces are studied within the framework of Universal Algebra. In particular, the correspondence between classes of spaces and classes of representables is analyzed; for a class of spaces which is closed under ultraproducts and non-degenerate finite dimensional subspaces, the latter are shown to be closed under complemented [regular] subalgebras, homomorphic images, and ultraproducts and being generated by those members which are associated with finite dimensional spaces. Under natural restrictions, this is refined to a 11-11-correspondence between the two types of classes

    Variable sets over an algebra of lifetimes: a contribution of lattice theory to the study of computational topology

    Full text link
    A topos theoretic generalisation of the category of sets allows for modelling spaces which vary according to time intervals. Persistent homology, or more generally, persistence is a central tool in topological data analysis, which examines the structure of data through topology. The basic techniques have been extended in several different directions, permuting the encoding of topological features by so called barcodes or equivalently persistence diagrams. The set of points of all such diagrams determines a complete Heyting algebra that can explain aspects of the relations between persistent bars through the algebraic properties of its underlying lattice structure. In this paper, we investigate the topos of sheaves over such algebra, as well as discuss its construction and potential for a generalised simplicial homology over it. In particular we are interested in establishing a topos theoretic unifying theory for the various flavours of persistent homology that have emerged so far, providing a global perspective over the algebraic foundations of applied and computational topology.Comment: 20 pages, 12 figures, AAA88 Conference proceedings at Demonstratio Mathematica. The new version has restructured arguments, clearer intuition is provided, and several typos correcte

    Impact of Local Congruences in Attribute Reduction

    Get PDF
    Local congruences are equivalence relations whose equivalence classes are convex sublattices of the original lattice. In this paper, we present a study that relates local congruences to attribute reduction in FCA. Specifically, we will analyze the impact in the context of the use of local congruences, when they are used for complementing an attribute reduction

    Anisotropic and dispersive wave propagation within strain-gradient framework

    Full text link
    In this paper anisotropic and dispersive wave propagation within linear strain-gradient elasticity is investigated. This analysis reveals significant features of this extended theory of continuum elasticity. First, and contrarily to classical elasticity, wave propagation in hexagonal (chiral or achiral) lattices becomes anisotropic as the frequency increases. Second, since strain-gradient elasticity is dispersive, group and energy velocities have to be treated as different quantities. These points are first theoretically derived, and then numerically experienced on hexagonal chiral and achiral lattices. The use of a continuum model for the description of the high frequency behavior of these microstructured materials can be of great interest in engineering applications, allowing problems with complex geometries to be more easily treated
    • …
    corecore