21 research outputs found

    Optimal triangular decompositions of matrices with entries from residuated lattices

    Get PDF
    AbstractWe describe optimal decompositions of an n×m matrix I into a triangular product I=A◁B of an n×k matrix A and a k×m matrix B. We assume that the matrix entries are elements of a residuated lattice, which leaves binary matrices or matrices which contain numbers from the unit interval [0,1] as special cases. The entries of I, A, and B represent grades to which objects have attributes, factors apply to objects, and attributes are particular manifestations of factors, respectively. This way, the decomposition provides a model for factor analysis of graded data. We prove that fixpoints of particular operators associated with I, which are studied in formal concept analysis, are optimal factors for decomposition of I in that they provide us with decompositions I=A◁B with the smallest number k of factors possible. Moreover, we describe transformations between the m-dimensional space of original attributes and the k-dimensional space of factors. We provide illustrative examples and remarks on the problem of computing the optimal decompositions. Even though we present the results for matrices, i.e. for relations between finite sets in terms of relations, the arguments behind are valid for relations between infinite sets as well

    The Singular Value Decomposition over Completed Idempotent Semifields

    Get PDF
    In this paper, we provide a basic technique for Lattice Computing: an analogue of the Singular Value Decomposition for rectangular matrices over complete idempotent semifields (i-SVD). These algebras are already complete lattices and many of their instances—the complete schedule algebra or completed max-plus semifield, the tropical algebra, and the max-times algebra—are useful in a range of applications, e.g., morphological processing. We further the task of eliciting the relation between i-SVD and the extension of Formal Concept Analysis to complete idempotent semifields (K-FCA) started in a prior work. We find out that for a matrix with entries considered in a complete idempotent semifield, the Galois connection at the heart of K-FCA provides two basis of left- and right-singular vectors to choose from, for reconstructing the matrix. These are join-dense or meet-dense sets of object or attribute concepts of the concept lattice created by the connection, and they are almost surely not pairwise orthogonal. We conclude with an attempt analogue of the fundamental theorem of linear algebra that gathers all results and discuss it in the wider setting of matrix factorization.This research was funded by the Spanish Government-MinECo project TEC2017-84395-P and the Dept. of Research and Innovation of Madrid Regional Authority project EMPATIA-CM (Y2018/TCS-5046)

    Spectral Lattices of reducible matrices over completed idempotent semifields

    Get PDF
    Proceedings of: 10th International Conference on Concept Lattices and Their Applications. (CLA 2013). La Rochelle, France, October 15-18, 2013.Previous work has shown a relation between L-valued extensions of FCA and the spectra of some matrices related to L-valued contexts. We investigate the spectra of reducible matrices over completed idempotent semifields in the framework of dioids, naturally-ordered semirings, that encompass several of those extensions. Considering special sets of eigenvectors also brings out complete lattices in the picture and we argue that such structure may be more important than standard eigenspace structure for matrices over completed idempotent semifields.FJVA is supported by EU FP7 project LiMoSINe (contract 288024). CPM has been partially supported by the Spanish Government-ComisiĂłn Interministerial de Ciencia y TecnologĂ­a project TEC2011-26807 for this paper.Publicad

    Conceptual Factors and Fuzzy Data

    Get PDF
    With the growing number of large data sets, the necessity of complexity reduction applies today more than ever before. Moreover, some data may also be vague or uncertain. Thus, whenever we have an instrument for data analysis, the questions of how to apply complexity reduction methods and how to treat fuzzy data arise rather naturally. In this thesis, we discuss these issues for the very successful data analysis tool Formal Concept Analysis. In fact, we propose different methods for complexity reduction based on qualitative analyses, and we elaborate on various methods for handling fuzzy data. These two topics split the thesis into two parts. Data reduction is mainly dealt with in the first part of the thesis, whereas we focus on fuzzy data in the second part. Although each chapter may be read almost on its own, each one builds on and uses results from its predecessors. The main crosslink between the chapters is given by the reduction methods and fuzzy data. In particular, we will also discuss complexity reduction methods for fuzzy data, combining the two issues that motivate this thesis.KomplexitĂ€tsreduktion ist eines der wichtigsten Verfahren in der Datenanalyse. Mit stĂ€ndig wachsenden DatensĂ€tzen gilt dies heute mehr denn je. In vielen Gebieten stĂ¶ĂŸt man zudem auf vage und ungewisse Daten. Wann immer man ein Instrument zur Datenanalyse hat, stellen sich daher die folgenden zwei Fragen auf eine natĂŒrliche Weise: Wie kann man im Rahmen der Analyse die Variablenanzahl verkleinern, und wie kann man Fuzzy-Daten bearbeiten? In dieser Arbeit versuchen wir die eben genannten Fragen fĂŒr die Formale Begriffsanalyse zu beantworten. Genauer gesagt, erarbeiten wir verschiedene Methoden zur KomplexitĂ€tsreduktion qualitativer Daten und entwickeln diverse Verfahren fĂŒr die Bearbeitung von Fuzzy-DatensĂ€tzen. Basierend auf diesen beiden Themen gliedert sich die Arbeit in zwei Teile. Im ersten Teil liegt der Schwerpunkt auf der KomplexitĂ€tsreduktion, wĂ€hrend sich der zweite Teil der Verarbeitung von Fuzzy-Daten widmet. Die verschiedenen Kapitel sind dabei durch die beiden Themen verbunden. So werden insbesondere auch Methoden fĂŒr die KomplexitĂ€tsreduktion von Fuzzy-DatensĂ€tzen entwickelt

    Formal Concept Analysis from the Standpoint of Possibility Theory (ICFCA 2015)

    Get PDF
    International audienceFormal concept analysis (FCA) and possibility theory (PoTh) have been developed independently. They address different concerns in information processing: while FCA exploits relations linking objects and properties, and has applications in data mining and clustering, PoTh deals with the modeling of (graded) epistemic uncertainty. However, making a formal parallel between FCA and PoTh is fruitful. The four set-functions at work in PoTh have meaningful counterparts in FCA; this leads to consider operators neglected in FCA, and thus new fixed point equations. One of these pairs of equations, paralleling the one defining formal concepts in FCA, defines independent sub-contexts of objects and properties that have nothing in common. The similarity of the structures underlying FCA and PoTh is still more striking, using a cube of opposition (a device extending the traditional square of opposition in logic). Beyond the parallel between FCA and PoTh, this invited contribution, which largely relies on several past publications by the authors, also addresses issues pertaining to the possible meanings, degree of satisfaction vs. degree of certainty, of graded object-property links, which calls for distinct manners of handling the degrees. Other lines of interest for further research are briefly mentioned

    The spectra of reducible matrices over complete commutative idempotent semifields and their spectral lattices

    Get PDF
    Previous work has shown a relation between L-valued extensions of Formal Concept Analysis and the spectra of some matrices related to L-valued contexts. To clarify this relation, we investigated elsewhere the nature of the spectra of irreducible matrices over idempotent semifields in the framework of dioids, naturally ordered semirings, that encompass several of those extensions. This initial work already showed many differences with respect to their counterparts over incomplete idempotent semifields, in what concerns the definition of the spectrum and the eigenvectors. Considering special sets of eigenvectors also brought out complete lattices in the picture and we argue that such structure may be more important than standard eigenspace structure for matrices over completed idempotent semifields. In this paper, we complete that investigation in the sense that we consider the spectra of reducible matrices over completed idempotent semifields and dioids, giving, as a result, a constructive solution to the all-eigenvectors problem in this setting. This solution shows that the relation of complete lattices to eigenspaces is even tighter than suspected.FJVA was partially supported by EU FP7 project LiMoSINe (contract 288024) for this research. CPM has been partially supported by the Spanish Government Comisi on Interministerial de Ciencia y Tecnolog a project TEC2011-26807

    Acta Scientiarum Mathematicarum : Tomus 39. Fasc. 1-2.

    Get PDF
    corecore