Optimal Factorization of Three-Way Binary Data Using Triadic Concepts

We present a new approach to factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, and conditions. The problem consists in finding a decomposition of I into three binary matrices, an object-factor matrix A, an attribute-factor matrix B, and a condition-factor matrix C, with the number of factors as small as possible. The scenario is similar to that of decomposition-based methods of analysis of three-way data but the difference consists in the composition operator and the constraint on A, B, and C to be binary. We show that triadic concepts of I, developed within formal concept analysis, provide us with optimal decompositions. We present an example demonstrating the usefulness of the decompositions. Since finding optimal decompositions is NP-hard, we propose a greedy algorithm for computing suboptimal decompositions and evaluate its performance.

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

[2]  Bernhard Ganter,et al.  Formal Concept Analysis, 6th International Conference, ICFCA 2008, Montreal, Canada, February 25-28, 2008, Proceedings , 2008, International Conference on Formal Concept Analysis.

[3]  Sergei O. Kuznetsov,et al.  Comparing performance of algorithms for generating concept lattices , 2002, J. Exp. Theor. Artif. Intell..

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

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

[6]  W. P. Dixon,et al.  BMPD statistical software manual , 1988 .

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

[8]  Mark C. Wilson,et al.  Introduction to Algorithms, Data Structures and Formal Languages, 2nd Edition , 2004 .

[9]  Bernhard Ganter,et al.  TRIPAT: a Model for Analyzing Three-Mode Binary Data , 1994 .

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

[11]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[12]  Jan Outrata,et al.  Boolean Factor Analysis for Data Preprocessing in Machine Learning , 2010, 2010 Ninth International Conference on Machine Learning and Applications.

[13]  Vilém Vychodil,et al.  Discovery of optimal factors in binary data via a novel method of matrix decomposition , 2010, J. Comput. Syst. Sci..

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

[15]  Pauli Miettinen,et al.  Boolean Tensor Factorizations , 2011, 2011 IEEE 11th International Conference on Data Mining.

[16]  L. Lathauwer.  Tensor decompositions and applications : a survey , 2009 .

[17]  Pauli Miettinen,et al.  The Discrete Basis Problem , 2006, IEEE Transactions on Knowledge and Data Engineering.

[18]  Aristides Gionis,et al.  What is the Dimension of Your Binary Data? , 2006, Sixth International Conference on Data Mining (ICDM'06).

[19]  Hai Tao,et al.  Binary Principal Component Analysis , 2006, BMVC.

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

[21]  Alexander A. Frolov,et al.  Boolean Factor Analysis by Attractor Neural Network , 2007, IEEE Transactions on Neural Networks.

[22]  Dana S. Nau,et al.  A mathematical analysis of human leukocyte antigen serology , 1978 .

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

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

[25]  Cynthia Vera Glodeanu,et al.  Triadic Factor Analysis , 2010, CLA.