Triadic concept lattices of data with graded attributes

We present foundations for triadic concept analysis of data with graded attributes. Triadic concept analysis departs from the dyadic case by taking into account modi, such as time instances or conditions, under which objects have attributes. That is, instead of a two-dimensional table filled with 0's and 1's (equivalently, binary relation or two-dimensional binary matrix), the input data in triadic concept analysis consist of a three-dimensional table (equivalently, ternary relation or three-dimensional binary matrix). In the ordinary triadic concept analysis, one assumes that the ternary relationship between objects, attributes, and modi, which specifies whether a given object has a given attribute under a given modus, is a yes-or-no relationship. In the present paper, we show how triadic concept analysis is developed in a setting in which the ternary relationship between objects, attributes, and modi is a matter of degree rather than a yes-or-no relationship. We present the basic notions for the new, ‘graded’ setting, an illustrative example, and generalize basic results including the basic theorem of triadic concept analysis.

[1]  Radim Belohlávek,et al.  Similarity relations in concept lattices , 2000, J. Log. Comput..

[2]  Vilém Vychodil,et al.  Factorizing Three-Way Ordinal Data Using Triadic Formal Concepts , 2011, FQAS.

[3]  Bernhard Ganter,et al.  Formal Concept Analysis: Mathematical Foundations , 1998 .

[4]  Radim Belohlávek,et al.  Optimal decompositions of matrices with entries from residuated lattices , 2012, J. Log. Comput..

[5]  Bernhard Ganter,et al.  Formal Concept Analysis , 2013 .

[6]  David E. Booth,et al.  Multi-Way Analysis: Applications in the Chemical Sciences , 2005, Technometrics.

[7]  Andreas Hotho,et al.  TRIAS--An Algorithm for Mining Iceberg Tri-Lattices , 2006, Sixth International Conference on Data Mining (ICDM'06).

[8]  R. P. Dilworth,et al.  Residuated Lattices. , 1938, Proceedings of the National Academy of Sciences of the United States of America.

[9]  J. A. Goguen,et al.  The logic of inexact concepts , 1969, Synthese.

[10]  Tamara G. Kolda,et al.  Tensor Decompositions and Applications , 2009, SIAM Rev..

[11]  Rudolf Wille,et al.  The Basic Theorem of triadic concept analysis , 1995 .

[12]  C.J.H. Mann,et al.  Fuzzy Relational Systems: Foundations and Principles , 2003 .

[13]  Radim Bělohlávek,et al.  Fuzzy Relational Systems: Foundations and Principles , 2002 .

[14]  Rasmus Bro,et al.  Multi-way Analysis with Applications in the Chemical Sciences , 2004 .

[15]  Andrzej Cichocki,et al.  Nonnegative Matrix and Tensor Factorization T , 2007 .

[16]  Radim Belohlávek,et al.  Concept lattices and order in fuzzy logic , 2004, Ann. Pure Appl. Log..

[17]  P. Kroonenberg.  Applied Multiway Data Analysis , 2008 .

[18]  Rudolf Wille,et al.  A Triadic Approach to Formal Concept Analysis , 1995, ICCS.

[19]  L. Beran,et al.  [Formal concept analysis]. , 1996, Casopis lekaru ceskych.

[20]  Radim Belohlávek,et al.  Sup-t-norm and inf-residuum are one type of relational product: Unifying framework and consequences , 2012, Fuzzy Sets Syst..

[21]  Petr Hájek,et al.  Metamathematics of Fuzzy Logic , 1998, Trends in Logic.