Using matrix decompositions in formal concept analysis

CEUR Workshop Proceedings

Volumn 252, Issue , 2007, Pages 121-128

  Snasel, Vaclav ^a   Gajdos, Petr ^a   Abdulla, Hussam M Dahwa ^a   Polovincak, Martin ^a  

^a VSB TECHNICAL UNIVERSITY OF OSTRAVA   (Czech Republic)

Author keywords

Formal concept analysis; Semi discrete decomposition; Singular value decomposition

Indexed keywords

CONCEPT LATTICES; HIGH COMPLEXITY; INCIDENCE MATRICES; LATTICE CONSTRUCTION; MATRIX DECOMPOSITION;

ALGORITHMS; INFORMATION ANALYSIS; INFORMATION SYSTEMS; SINGULAR VALUE DECOMPOSITION;

FORMAL CONCEPT ANALYSIS;

EID: 84877721520     PISSN: 16130073     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. G. Battista, P. Eades, R. Tamassia, and I. Tollis, "Algorithms for drawing graphs, an annotated bibiliography,", Computational Geometry, Theory and Applications, Vol. 4, 1994, pp. 235-282.
2. M. Berry and M. Browne. "Understanding Search Engines,", Mathematical Modeling and Text Retrieval, Siam, 1999.
3. M. Berry, S. Dumais, and T. Letsche. "Computation Methods for Intelligent Information Access,", Proceedings of the 1995 ACM/IEEE Supercomputing Conference, 1995.
4. P. Gajdoš and P. Moravec, "Concept lattice generation by singular value decomposition,", CLA 2004, 2004, pp. 13-22.
5. B. Ganter and R. Wille, Formal Concept Analysis. Springer-Verlag Berlin Heidelberg, 1999.
6. T. G. Kolda and D. P. O'Leary, Computation and uses of the semidiscrete matrix decomposition, Technical Report CS-TR-4012, Oak Ridge National Laboratory, 1999, pp. 8-16.
7. T.G. Kolda and D.P. O'Leary, "A semidiscrete matrix decomposition for latent semantic indexing information retrieval,", ACM Transactions on Information Systems 16(4), 1998, pp. 322-346.
8. D.P. O'Leary and S. Peleg, "Digital image compression by outer product expansion,", IEEE Transactions on Communications 31, 1983, pp. 441-444.
9. R. Wille, Lattices in data analysis: How to draw them with a computer, Algorithms and Order, 1989, pp. 33-58.
10. Farial Shahnaz, Michael W. Berry, V. Paul Pauca, Robert J. Plemmons, Document clustering using nonnegative matrix factorization. Inf. Process. Manage. 42(2): 373-386 2006.
11. Lee, D., Seung, "H. Algorithms for non-negative matrix factorization,", Advances in Neural Information Processing Systems, 2001, pp. 556-562.
12. G. Young and C. Eckart, The approximation of one matrix by another of lower rank, Psychometrika 1, 1936, pp. 211-218.