{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:31:18Z","timestamp":1725564678571},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642153860"},{"type":"electronic","value":"9783642153877"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15387-7_51","type":"book-chapter","created":{"date-parts":[[2010,9,3]],"date-time":"2010-09-03T08:20:39Z","timestamp":1283502039000},"page":"471-480","source":"Crossref","is-referenced-by-count":4,"title":["Factorizing Three-Way Binary Data with Triadic Formal Concepts"],"prefix":"10.1007","author":[{"given":"Radim","family":"Belohlavek","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vilem","family":"Vychodil","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Belohlavek, R.: Optimal decompositions of matrices with grades. In: IEEE IS 2008, pp. 15-2\u201315-7 (2008)","DOI":"10.1109\/IS.2008.4670530"},{"issue":"8","key":"51_CR2","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.ijar.2009.05.006","volume":"50","author":"R. Belohlavek","year":"2009","unstructured":"Belohlavek, R.: Optimal triangular decompositions of matrices with entries from residuated lattices. Int. J. of Approximate Reasoning\u00a050(8), 1250\u20131258 (2009)","journal-title":"Int. J. of Approximate Reasoning"},{"issue":"1","key":"51_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.jcss.2009.05.002","volume":"76","author":"R. Belohlavek","year":"2010","unstructured":"Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. J. Computer and System Sci.\u00a076(1), 3\u201320 (2010)","journal-title":"J. Computer and System Sci."},{"key":"51_CR4","series-title":"Lecture Notes in Artificial Intelligence","first-page":"83","volume-title":"Factor analysis of incidence data via novel decomposition of matrices","author":"R. Belohlavek","year":"2009","unstructured":"Belohlavek, R., Vychodil, V.: Factor analysis of incidence data via novel decomposition of matrices. LNCS (LNAI), vol.\u00a05548, pp. 83\u201397. Springer, Heidelberg (2009)"},{"key":"51_CR5","doi-asserted-by":"crossref","DOI":"10.1002\/9780470747278","volume-title":"Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation","author":"A. Cichocki","year":"2009","unstructured":"Cichocki, A., et al.: Nonnegative Matrix and Tensor Factorizations: Applications to Exploratory Multi-way Data Analysis and Blind Source Separation. J. Wiley, Chichester (2009)"},{"key":"51_CR6","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., et al.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"3","key":"51_CR7","doi-asserted-by":"publisher","first-page":"698","DOI":"10.1109\/TNN.2007.891664","volume":"18","author":"A.A. Frolov","year":"2007","unstructured":"Frolov, A.A., et al.: Boolean factor analysis by Hopfield-like autoassociative memory. IEEE Trans. Neural Networks\u00a018(3), 698\u2013707 (2007)","journal-title":"IEEE Trans. Neural Networks"},{"key":"51_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis. Mathematical Foundations","author":"B. Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Mathematical Foundations. Springer, Berlin (1999)"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"J\u00e4schke, R., Hotho, A., Schmitz, C., Ganter, B., Stumme, G.: TRIAS \u2013 An Algorithm for Mining Iceberg Tri-Lattices. In: Proc. ICDM 2006, pp. 907\u2013911 (2006)","DOI":"10.1109\/ICDM.2006.162"},{"issue":"3","key":"51_CR10","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1137\/07070111X","volume":"51","author":"T.G. Kolda","year":"2009","unstructured":"Kolda, T.G., Bader, B.W.: Tensor decompositions and applications. SIAM Review\u00a051(3), 455\u2013500 (2009)","journal-title":"SIAM Review"},{"issue":"2-3","key":"51_CR11","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1080\/09528130210164170","volume":"14","author":"S. Kuznetsov","year":"2002","unstructured":"Kuznetsov, S., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Exp. Theor. Artif. Intelligence\u00a014(2-3), 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Intelligence"},{"key":"51_CR12","doi-asserted-by":"publisher","first-page":"788","DOI":"10.1038\/44565","volume":"401","author":"D. Lee","year":"1999","unstructured":"Lee, D., Seung, H.: Learning the parts of objects by non-negative matrix factorization. Nature\u00a0401, 788\u2013791 (1999)","journal-title":"Nature"},{"key":"51_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"32","DOI":"10.1007\/3-540-60161-9_27","volume-title":"Conceptual Structures: Applications, Implementation and Theory","author":"F. Lehmann","year":"1995","unstructured":"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.\u00a0954, pp. 32\u201343. Springer, Heidelberg (1995)"},{"key":"51_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1007\/11871637_33","volume-title":"Knowledge Discovery in Databases: PKDD 2006","author":"P. Miettinen","year":"2006","unstructured":"Miettinen, P., Mielik\u00e4inen, T., Gionis, A., Das, G., Mannila, H.: The Discrete Basis Problem. In: F\u00fcrnkranz, J., Scheffer, T., Spiliopoulou, M. (eds.) PKDD 2006. LNCS (LNAI), vol.\u00a04213, pp. 335\u2013346. Springer, Heidelberg (2006)"},{"key":"51_CR15","unstructured":"Stockmeyer, L.J.: The set basis problem is NP-complete. IBM Research Report RC5431, Yorktown Heights, NY (1975)"},{"key":"51_CR16","series-title":"Lecture Notes in Artificial Intelligence","first-page":"603","volume-title":"Advances in Data Mining. Applications in Medicine, Web Mining, Marketing, Image and Signal Mining","author":"N. Tatti","year":"2006","unstructured":"Tatti, N., Mielik\u00e4inen, T., Gionis, A., Mannila, H.: What is the dimension of your binary data? In: Perner, P. (ed.) ICDM 2006. LNCS (LNAI), vol.\u00a04065, pp. 603\u2013612. Springer, Heidelberg (2006)"},{"key":"51_CR17","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF01108624","volume":"12","author":"R. Wille","year":"1995","unstructured":"Wille, R.: The basic theorem of triadic concept analysis. Order\u00a012, 149\u2013158 (1995)","journal-title":"Order"}],"container-title":["Lecture Notes in Computer Science","Knowledge-Based and Intelligent Information and Engineering Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15387-7_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:06:25Z","timestamp":1606187185000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15387-7_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642153860","9783642153877"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15387-7_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}