8,766 research outputs found

    A Categorical View on Algebraic Lattices in Formal Concept Analysis

    Full text link
    Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully benefit from this theory, we believe that it can be enriched with notions such as approximation by computation or representability. The latter are commonly studied in denotational semantics and domain theory and captured most prominently by the notion of algebraicity, e.g. of lattices. In this paper, we explore the notion of algebraicity in formal concept analysis from a category-theoretical perspective. To this end, we build on the the notion of approximable concept with a suitable category and show that the latter is equivalent to the category of algebraic lattices. At the same time, the paper provides a relatively comprehensive account of the representation theory of algebraic lattices in the framework of Stone duality, relating well-known structures such as Scott information systems with further formalisms from logic, topology, domains and lattice theory.Comment: 36 page

    Formal Concept Analysis and Resolution in Algebraic Domains

    Full text link
    We relate two formerly independent areas: Formal concept analysis and logic of domains. We will establish a correspondene between contextual attribute logic on formal contexts resp. concept lattices and a clausal logic on coherent algebraic cpos. We show how to identify the notion of formal concept in the domain theoretic setting. In particular, we show that a special instance of the resolution rule from the domain logic coincides with the concept closure operator from formal concept analysis. The results shed light on the use of contexts and domains for knowledge representation and reasoning purposes.Comment: 14 pages. We have rewritten the old version according to the suggestions of some referees. The results are the same. The presentation is completely differen

    Towards a generalisation of formal concept analysis for data mining purposes

    Get PDF
    In this paper we justify the need for a generalisation of Formal Concept Analysis for the purpose of data mining and begin the synthesis of such theory. For that purpose, we first review semirings and semimodules over semirings as the appropriate objects to use in abstracting the Boolean algebra and the notion of extents and intents, respectively. We later bring to bear powerful theorems developed in the field of linear algebra over idempotent semimodules to try to build a Fundamental Theorem for K-Formal Concept Analysis, where K is a type of idempotent semiring. Finally, we try to put Formal Concept Analysis in new perspective by considering it as a concrete instance of the theory developed

    Formal concept analysis and structures underlying quantum logics

    Get PDF
    A Hilbert space HH induces a formal context, the Hilbert formal context H‾\overline H, whose associated concept lattice is isomorphic to the lattice of closed subspaces of HH. This set of closed subspaces, denoted C(H)\mathcal C(H), is important in the development of quantum logic and, as an algebraic structure, corresponds to a so-called ``propositional system'', that is, a complete, atomistic, orthomodular lattice which satisfies the covering law. In this paper, we continue with our study of the Chu construction by introducing the Chu correspondences between Hilbert contexts, and showing that the category of Propositional Systems, PropSys, is equivalent to the category of ChuCorsH\text{ChuCors}_{\mathcal H} of Chu correspondences between Hilbert contextsUniversidad de Málaga. Campus de Excelencia Internacional Andalucía Tech

    Many worlds and modality in the interpretation of quantum mechanics: an algebraic approach

    Get PDF
    Many worlds interpretations (MWI) of quantum mechanics avoid the measurement problem by considering every term in the quantum superposition as actual. A seemingly opposed solution is proposed by modal interpretations (MI) which state that quantum mechanics does not provide an account of what `actually is the case', but rather deals with what `might be the case', i.e. with possibilities. In this paper we provide an algebraic framework which allows us to analyze in depth the modal aspects of MWI. Within our general formal scheme we also provide a formal comparison between MWI and MI, in particular, we provide a formal understanding of why --even though both interpretations share the same formal structure-- MI fall pray of Kochen-Specker (KS) type contradictions while MWI escape them.Comment: submitted to the Journal of Mathematical Physic

    Geometric lattice structure of covering and its application to attribute reduction through matroids

    Full text link
    The reduction of covering decision systems is an important problem in data mining, and covering-based rough sets serve as an efficient technique to process the problem. Geometric lattices have been widely used in many fields, especially greedy algorithm design which plays an important role in the reduction problems. Therefore, it is meaningful to combine coverings with geometric lattices to solve the optimization problems. In this paper, we obtain geometric lattices from coverings through matroids and then apply them to the issue of attribute reduction. First, a geometric lattice structure of a covering is constructed through transversal matroids. Then its atoms are studied and used to describe the lattice. Second, considering that all the closed sets of a finite matroid form a geometric lattice, we propose a dependence space through matroids and study the attribute reduction issues of the space, which realizes the application of geometric lattices to attribute reduction. Furthermore, a special type of information system is taken as an example to illustrate the application. In a word, this work points out an interesting view, namely, geometric lattice to study the attribute reduction issues of information systems
    • …
    corecore