{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:52:19Z","timestamp":1725540739511},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642048197"},{"type":"electronic","value":"9783642048203"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-04820-3_11","type":"book-chapter","created":{"date-parts":[[2009,11,17]],"date-time":"2009-11-17T11:48:07Z","timestamp":1258458487000},"page":"114-125","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of Data Structures for Computing Formal Concepts"],"prefix":"10.1007","author":[{"given":"Petr","family":"Krajca","sequence":"first","affiliation":[]},{"given":"Vilem","family":"Vychodil","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"4","key":"11_CR1","doi-asserted-by":"publisher","first-page":"455","DOI":"10.1080\/03081070902857563","volume":"38","author":"R. Belohlavek","year":"2009","unstructured":"Belohlavek, R., De Baets, B., Outrata, J., Vychodil, V.: Inducing decision trees via concept lattices. Int. J. General Systems\u00a038(4), 455\u2013467 (2009)","journal-title":"Int. J. General Systems"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Belohlavek, R., Vychodil, V.: Discovery of optimal factors in binary data via a novel method of matrix decomposition. Journal of Computer and System Sciences (to appear)","DOI":"10.1016\/j.jcss.2009.05.002"},{"key":"11_CR3","doi-asserted-by":"publisher","DOI":"10.1002\/0470011297","volume-title":"Concept data analysis. Theory and applications","author":"C. Carpineto","year":"2004","unstructured":"Carpineto, C., Romano, G.: Concept data analysis. Theory and applications. J. Wiley, Chichester (2004)"},{"key":"11_CR4","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"2001","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2001)"},{"key":"11_CR5","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. Technical Report FB4-Preprint No.\u00a0831. TH Darmstadt (1984)"},{"key":"11_CR6","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)"},{"issue":"3","key":"11_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/0020-0190(88)90065-8","volume":"27","author":"D.S. Johnson","year":"1988","unstructured":"Johnson, D.S., Yannakakis, M., Papadimitriou, C.H.: On generating all maximal independent sets. Information Processing Letters\u00a027(3), 119\u2013123 (1988)","journal-title":"Information Processing Letters"},{"issue":"1","key":"11_CR8","first-page":"37","volume":"24","author":"S. Kuznetsov","year":"1989","unstructured":"Kuznetsov, S.: Interpretation on graphs and complexity characteristics of a search for specific patterns. Automatic Documentation and Mathematical Linguistics\u00a024(1), 37\u201345 (1989)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"issue":"5","key":"11_CR9","first-page":"11","volume":"27","author":"S. Kuznetsov","year":"1993","unstructured":"Kuznetsov, S.: A fast algorithm for computing all intersections of objects in a finite semi-lattice (\u0411\u044c\u0441\u0442\u0440\u044b\u0439 \u0430\u043b\u0433\u043e\u0440\u0438\u0442\u043c \u043f\u043e\u0441\u0442\u0440\u043e\u0435\u043d\u0438\u044f \u0432\u0441\u0435\u0445 \u043f\u0435\u0440\u0435\u0441\u0435\u0447\u0435\u043d\u0438\u0439 \u043e\u0431\u044a\u0435\u043a\u0442\u043e\u0432\u0438\u0437 \u043a\u043e\u043d\u0435\u0447\u043d\u043e\u0439 \u043f\u043e\u043b\u0443\u0440\u0435\u0448\u0435\u0442\u043a\u0438 in Russian). Automatic Documentation and Mathematical Linguistics\u00a027(5), 11\u201321 (1993)","journal-title":"Automatic Documentation and Mathematical Linguistics"},{"key":"11_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S. Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.: Learning of Simple Conceptual Graphs from Positive and Negative Examples. In: \u017bytkow, J.M., Rauch, J. (eds.) PKDD 1999. LNCS (LNAI), vol.\u00a01704, pp. 384\u2013391. Springer, Heidelberg (1999)"},{"key":"11_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. Int.\u00a014, 189\u2013216 (2002)","journal-title":"J. Exp. Theor. Artif. Int."},{"key":"11_CR12","volume-title":"Introduction to the Design and Analysis of Algorithms","author":"A.V. Levitin","year":"2002","unstructured":"Levitin, A.V.: Introduction to the Design and Analysis of Algorithms. Addison Wesley, Reading (2002)"},{"key":"11_CR13","first-page":"152","volume-title":"Working with Conceptual Structures\u2013\u2013Contributions to ICCS 2000","author":"C. Lindig","year":"2000","unstructured":"Lindig, C.: Fast concept analysis. In: Working with Conceptual Structures\u2013\u2013Contributions to ICCS 2000, pp. 152\u2013161. Shaker Verlag, Aachen (2000)"},{"issue":"2","key":"11_CR14","first-page":"243","volume":"23","author":"E.M. Norris","year":"1978","unstructured":"Norris, E.M.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Math\u00e9matiques Pures et Appliques\u00a023(2), 243\u2013250 (1978)","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliques"},{"key":"11_CR15","unstructured":"Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data (submitted)"},{"key":"11_CR16","unstructured":"Sedgewick, R.: Left-leaning red-black trees, \n                      \n                        http:\/\/www.cs.princeton.edu\/~rs\/talks\/LLRB\/LLRB.pdf"},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Wille, R.: Restructuring lattice theory: an approach based on hierarchies of concepts. In: Ordered Sets, Dordrecht-Boston, pp. 445\u2013470 (1982)","DOI":"10.1007\/978-94-009-7798-3_15"},{"key":"11_CR18","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"M.J. Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Mining and Knowledge Discovery\u00a09, 223\u2013248 (2004)","journal-title":"Data Mining and Knowledge Discovery"}],"container-title":["Lecture Notes in Computer Science","Modeling Decisions for Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04820-3_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T11:12:05Z","timestamp":1619781125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04820-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642048197","9783642048203"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04820-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}