Using Matrix Decompositions in Formal Concept Analysis

One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all concepts from a huge incidence matrix. In some cases, we only need to compute some of them to test for common attributes. In our research we try to modify an incidence matrix using matrix decompositions, creating a new matrix with fewer dimensions as an input for some known algorithms for lattice construction. In this paper, we want to describe methods of matrix decompositions and their influence on the concept lattice.

[1]  H. Sebastian Seung,et al.  Algorithms for Non-negative Matrix Factorization , 2000, NIPS.

[2]  Michael W. Berry,et al.  Understanding search engines: mathematical modeling and text retrieval (software , 1999 .

[3]  Rudolf Wille,et al.  Lattices in Data Analysis: How to Draw Them with a Computer , 1989 .

[4]  Václav Snásel,et al.  Concept Lattice Generation by Singular Value Decomposition , 2004, CLA.

[5]  Michael W. Berry,et al.  Understanding search engines: mathematical modeling and text retrieval (software , 2005 .

[6]  Michael W. Berry,et al.  Document clustering using nonnegative matrix factorization , 2006, Inf. Process. Manag..

[7]  C. Eckart,et al.  The approximation of one matrix by another of lower rank , 1936 .

[8]  Susan T. Dumais,et al.  Computational Methods for Intelligent Information Access , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[9]  Tamara G. Kolda,et al.  A semidiscrete matrix decomposition for latent semantic indexing information retrieval , 1998, TOIS.

[10]  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.

[11]  Ioannis G. Tollis,et al.  Algorithms for Drawing Graphs: an Annotated Bibliography , 1988, Comput. Geom..

[12]  Dianne P. O'Leary,et al.  Digital Image Compression by Outer Product Expansion , 1983, IEEE Trans. Commun..

[13]  D. O’Leary,et al.  Computation and Uses of the Semidiscrete Matrix Decomposition , 1999 .

[15]  M.W. Berry,et al.  Computational Methods for Intelligent Information Access , 1995, Proceedings of the IEEE/ACM SC95 Conference.