Optimal factorization of three-way binary data

Proceedings - 2010 IEEE International Conference on Granular Computing, GrC 2010

Volumn , Issue , 2010, Pages 61-66

  Belohlavek, Radim ^a   Vychodil, Vilem ^a  

^a PALACKÝ UNIVERSITY   (Czech Republic)

Author keywords

[No Author keywords available]

Indexed keywords

3-DIMENSIONAL; BINARY DATA; BINARY MATRIX; COMPOSITION OPERATORS; EXPERIMENTAL EVALUATION; FACTOR ANALYSIS; FORMAL CONCEPT ANALYSIS; GREEDY APPROXIMATION ALGORITHMS; ILLUSTRATIVE EXAMPLES; MATRIX; METHODS OF ANALYSIS; THREE WAY DATA;

APPROXIMATION ALGORITHMS; GRANULAR COMPUTING; MATHEMATICAL OPERATORS; OPTIMIZATION;

MATRIX ALGEBRA;

EID: 77958544834     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/GrC.2010.181     Document Type: Conference Paper

References (20)

1. Belohlavek R., Vychodil V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Computer and System Sci. 76(1)(2010), 3-20.
2. Cichocki A. et al.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. J. Wiley, 2009.
3. Cormen T. H. et al.: Introduction to Algorithms, 2nd Ed. MIT Press, 2001.
4. Frolov A. A. et al.: Boolean factor analysis by Hopfield-like autoassociative memory. IEEE Trans. Neural Networks 18(3)(2007), 698-707.
5. Ganter B., Wille R.: Formal Concept Analysis. Mathematical Foundations. Springer, Berlin, 1999.
6. Jäschke R., Hotho A., Schmitz C., Ganter B., Stumme G.: TRIAS - An Algorithm for Mining Iceberg Tri-Lattices. Proc. ICDM 2006, pp. 907-911.
7. Kolda T. G., Bader B. W.: Tensor decompositions and applications. SIAM Review 51(3)(2009), 455-500.
8. Kroonenberg P. M.: Applied Multiway Data Analysis. J. Wiley, 2008.
9. Kuznetsov S., Obiedkov S.: Comparing performance of algorithms for generating concept lattices. J. Experimental and Theoretical Articial Intelligence 14(2-3)(2002), 189-216.
10. Lee D., Seung H.: Learning the parts of objects by non-negative matrix factorization. Nature 401(1999), 788-791.
11. Lehmann F., Wille R.: A triadic approach to formal concept analysis. Lecture Notes in Computer Science 954(1995), 32-43.
12. Mickey M. R., Mundle P., Engelman L.: Boolean factor analysis. In: W.J. Dixon (Ed.), BMDP statistical software manual, vol. 2, 849-860, Berkeley, CA: University of California Press, 1990.
13. Miettinen P., Mielikäinen T., Gionis A., Das G., Mannila H.: The Discrete Basis Problem. PKDD 2006, LNAI 4213, pp. 335-346.
14. Nau D. S., Markowsky G., Woodbury M. A., Amos D. B.: A Mathematical Analysis of Human Leukocyte Antigen Serology. Math. Biosciences 40(1978), 243-270.
15. Roweis S. T., Saul L. K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(2000), 2323-2326.
16. Smilde A., Bro R., Geladi P.: Multi-way Analysis: Applications in the Chemical Sciences. J. Wiley, 2004.
17. Stockmeyer L. J.: The set basis problem is NP-complete. IBM Research Report RC5431, Yorktown Heights, NY, 1975.
18. Tatti N., Mielikäinen T., Gionis A., Mannila H.: What is the dimension of your binary data? ICDM 2006, pp. 603-612.
19. Tenenbaum J. B., de Silva V., Langford J. C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(2000), 2319-2323.
20. Wille R.: The basic theorem of triadic concept analysis. Order 12(1995), 149-158.