메뉴 건너뛰기




Volumn 7022 LNAI, Issue , 2011, Pages 400-411

Factorizing three-way ordinal data using triadic formal concepts

Author keywords

[No Author keywords available]

Indexed keywords

3-DIMENSIONAL MATRIX; COMPOSITION OPERATORS; FACTOR ANALYSIS; FORMAL CONCEPT ANALYSIS; FORMAL CONCEPTS; GREEDY ALGORITHMS; ILLUSTRATIVE EXAMPLES; MATRIX; METHODS OF ANALYSIS; NATURAL TRANSFORMATIONS; OPTIMAL DECOMPOSITION; ORDINAL DATA; THREE WAY DATA;

EID: 81855228630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-24764-4_35     Document Type: Conference Paper
Times cited : (5)

References (25)
  • 1
    • 77953090078 scopus 로고    scopus 로고
    • Optimal decomposition of matrices with entries from residuated lattices
    • J. Logic and Computation to appear, preliminary version appeared in
    • Belohlavek, R.: Optimal decomposition of matrices with entries from residuated lattices. J. Logic and Computation (to appear, preliminary version appeared in Proc. IEEE Intelligent Systems, pp. 15-2-15-7 (2008))
    • (2008) Proc. IEEE Intelligent Systems , pp. 152-157
    • Belohlavek, R.1
  • 2
    • 77958544834 scopus 로고    scopus 로고
    • Optimal factorization of three-way binary data using triadic concepts
    • submitted, preliminary version appeared in
    • Belohlavek, R., Glodeanu, C.V., Vychodil, V.: Optimal factorization of three-way binary data using triadic concepts. (submitted, preliminary version appeared in Proc. IEEE GrC 2010, pp. 61-66 (2010))
    • (2010) Proc. IEEE GrC 2010 , pp. 61-66
    • Belohlavek, R.1    Glodeanu, C.V.2    Vychodil, V.3
  • 4
    • 71749101259 scopus 로고    scopus 로고
    • Discovery of optimal factors in binary data via a novel method of matrix decomposition
    • 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), 3-20 (2010)
    • (2010) J. Computer and System Sci. , vol.76 , Issue.1 , pp. 3-20
    • Belohlavek, R.1    Vychodil, V.2
  • 5
    • 67650463074 scopus 로고    scopus 로고
    • Factor analysis of incidence data via novel decomposition of matrices
    • Ferré, S., Rudolph, S. (eds.) ICFCA 2009. Springer, Heidelberg
    • Belohlavek, R., Vychodil, V.: Factor analysis of incidence data via novel decomposition of matrices. In: Ferré, S., Rudolph, S. (eds.) ICFCA 2009. LNCS(LNAI), vol. 5548, pp. 83-97. Springer, Heidelberg (2009)
    • (2009) LNCS(LNAI) , vol.5548 , pp. 83-97
    • Belohlavek, R.1    Vychodil, V.2
  • 12
    • 68649096448 scopus 로고    scopus 로고
    • Tensor decompositions and applications
    • Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Review 51(3), 455-500 (2009)
    • (2009) SIAM Review , vol.51 , Issue.3 , pp. 455-500
    • Kolda, T.G.1    Bader, B.W.2
  • 15
    • 84958760530 scopus 로고
    • A triadic approach to formal concept analysis
    • Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. Springer, Heidelberg
    • Lehmann, F., Wille, R.: A triadic approach to formal concept analysis. In: Ellis, G., Rich, W., Levinson, R., Sowa, J.F. (eds.) ICCS 1995. LNCS, vol. 954, pp. 32-34. Springer, Heidelberg (1995)
    • (1995) LNCS , vol.954 , pp. 32-34
    • Lehmann, F.1    Wille, R.2
  • 16
    • 0012916693 scopus 로고
    • Boolean factor analysis
    • Dixon, W.J. (ed.) University of California Press, Berkeley
    • Mickey, M.R., Mundle, P., Engelman, L.: Boolean factor analysis. In: Dixon, W.J. (ed.) BMDP Statistical Software Manual, vol. 2, pp. 849-860. University of California Press, Berkeley (1990)
    • (1990) BMDP Statistical Software Manual , vol.2 , pp. 849-860
    • Mickey, M.R.1    Mundle, P.2    Engelman, L.3
  • 17
    • 33750356685 scopus 로고    scopus 로고
    • The Discrete Basis Problem
    • Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. Springer, Heidelberg
    • Miettinen, P., Mielikäinen, T., Gionis, A., Das, G., Mannila, H.: The Discrete Basis Problem. In: Fürnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol. 4213, pp. 335-346. Springer, Heidelberg (2006)
    • (2006) LNCS (LNAI) , vol.4213 , pp. 335-346
    • Miettinen, P.1    Mielikäinen, T.2    Gionis, A.3    Das, G.4    Mannila, H.5
  • 19
    • 84889599615 scopus 로고    scopus 로고
    • Preprocessing input data for machine learning by FCA
    • Kryszkiewicz, M., Obiedkov, S. (eds.) University of Sevilla, CEUR WS
    • Outrata, J.: Preprocessing input data for machine learning by FCA. In: Kryszkiewicz, M., Obiedkov, S. (eds.) Proc. CLA 2010, vol. 672, pp. 187-198. University of Sevilla, CEUR WS (2010)
    • (2010) Proc. CLA 2010 , vol.672 , pp. 187-198
    • Outrata, J.1
  • 20
    • 79952373637 scopus 로고    scopus 로고
    • Boolean factor analysis for data preprocessing in machine learning
    • Draghici, S., et al. (eds.) IEEE, Washington, DC
    • Outrata, J.: Boolean factor analysis for data preprocessing in machine learning. In: Draghici, S., et al. (eds.) Proc. ICMLA 2010, Intern. Conf. on Machine Learning and Applications, pp. 899-902. IEEE, Washington, DC (2010)
    • (2010) Proc. ICMLA 2010, Intern. Conf. on Machine Learning and Applications , pp. 899-902
    • Outrata, J.1
  • 22
    • 0008049165 scopus 로고
    • The set basis problem is NP-complete
    • Yorktown Heights, NY
    • Stockmeyer, L.J.: The set basis problem is NP-complete. IBM Research Report RC5431, Yorktown Heights, NY (1975)
    • (1975) IBM Research Report RC5431
    • Stockmeyer, L.J.1
  • 25
    • 21344461394 scopus 로고
    • The basic theorem of triadic concept analysis
    • Wille, R.: The basic theorem of triadic concept analysis. Order 12, 149-158 (1995)
    • (1995) Order , vol.12 , pp. 149-158
    • Wille, R.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.