{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T22:02:44Z","timestamp":1743112964830,"version":"3.40.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319083889"},{"type":"electronic","value":"9783319083896"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-08389-6_5","type":"book-chapter","created":{"date-parts":[[2014,7,17]],"date-time":"2014-07-17T10:43:39Z","timestamp":1405593819000},"page":"37-50","source":"Crossref","is-referenced-by-count":6,"title":["A Partial-Closure Canonicity Test to Increase the Efficiency of CbO-Type Algorithms"],"prefix":"10.1007","author":[{"given":"Simon","family":"Andrews","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"5_CR1","unstructured":"Andrews, S., Orphanides, C.: Analysis of large data sets using formal concept lattices. In: [31], pp. 104\u2013115"},{"key":"5_CR2","doi-asserted-by":"crossref","first-page":"303","DOI":"10.20965\/jaciii.2010.p0303","volume":"14","author":"T. Tanabata","year":"2010","unstructured":"Tanabata, T., Sawase, K., Nobuhara, H., Bede, B.: Interactive data mining for image databases based on fca. Journal of Advanced Computational Intelligence and Intelligent Informatics\u00a014, 303\u2013308 (2010)","journal-title":"Journal of Advanced Computational Intelligence and Intelligent Informatics"},{"key":"5_CR3","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-01815-2_19","volume-title":"Formal Concept Analysis","author":"M. Kaytoue","year":"2009","unstructured":"Kaytoue, M., Duplessis, S., Kuznetsov, S.O., Napoli, A.: Two FCA-based methods for mining gene expression data. In: Ferr\u00e9, S., Rudolph, S. (eds.) ICFCA 2009. LNCS (LNAI), vol.\u00a05548, pp. 251\u2013266. Springer, Heidelberg (2009)"},{"key":"5_CR4","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1023\/A:1013970520933","volume":"18","author":"S.O. Kuznetsov","year":"2001","unstructured":"Kuznetsov, S.O.: On computing the size of a lattice and related decision problems. Order\u00a018, 313\u2013321 (2001)","journal-title":"Order"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Carpineto, C., Romano, G.: Concept Data Analysis: Theory and Applications. J. Wiley (2004)","DOI":"10.1002\/0470011297"},{"key":"5_CR6","doi-asserted-by":"publisher","first-page":"1654","DOI":"10.1007\/BF02362847","volume":"80","author":"S.O. Kuznetsov","year":"1996","unstructured":"Kuznetsov, S.O.: Mathematical aspects of concept analysis. Mathematical Science\u00a080, 1654\u20131698 (1996)","journal-title":"Mathematical Science"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer (1998)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"5_CR8","first-page":"152","volume-title":"Working with Conceptual Structures: Contributions to ICCS 2000","author":"C. Lindig","year":"2000","unstructured":"Lindig, C.: Fast concept analysis. In: Working with Conceptual Structures: Contributions to ICCS 2000, pp. 152\u2013161. Shaker Verlag, Aachen (2000)"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","volume":"11","author":"R. Godin","year":"1995","unstructured":"Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on Galois lattices. Computational Intelligence\u00a011, 246\u2013267 (1995)","journal-title":"Computational Intelligence"},{"key":"5_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"384","DOI":"10.1007\/978-3-540-48247-5_47","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"S.O. Kuznetsov","year":"1999","unstructured":"Kuznetsov, S.O.: 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":"5_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. Journal of Experimental and Theoretical Artificial Intelligence\u00a014, 189\u2013216 (2002)","journal-title":"Journal of Experimental and Theoretical Artificial Intelligence"},{"key":"5_CR12","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: Parallel recursive algorithm for FCA. In: Belohavlek, R., Kuznetsov, S. (eds.) Proceedings of Concept Lattices and their Applications (2008)"},{"key":"5_CR13","unstructured":"Andrews, S.: In-close, a fast algorithm for computing formal concepts. In: Rudolph, S., Dau, F., Kuznetsov, S.O. (eds.) ICCS 2009. CEUR WS, vol.\u00a0483 (2009), \n                      http:\/\/sunsite.informatik.rwth-aachen.de\/Publications\/CEUR-WS\/Vol-483\/"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Andrews, S.: In-close2, a high performance formal concept miner. In: Andrews, S., Polovina, S., Hill, R., Akhgar, B. (eds.) ICCS 2011. LNCS (LNAI), vol.\u00a06828, pp. 50\u201362. Springer, Heidelberg (2011)","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"5_CR15","unstructured":"Krajca, P., Vychodil, V., Outrata, J.: Advances in algorithms based on CbO. In: [31], pp. 325\u2013337"},{"key":"5_CR16","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","volume":"185","author":"J. Outrata","year":"2012","unstructured":"Outrata, J., Vychodil, V.: Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data. Inf. Sci.\u00a0185, 114\u2013127 (2012)","journal-title":"Inf. Sci."},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Strok, F., Neznanov, A.: Comparing and analyzing the computational complexity of fca algorithms. In: Proceedings of the 2010 Annual Research Conference of the South African Institute of Computer Scientists and Information Technologists, pp. 417\u2013420 (2010)","DOI":"10.1145\/1899503.1899557"},{"key":"5_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-29892-9_18","volume-title":"Formal Concept Analysis","author":"M. Kirchberg","year":"2012","unstructured":"Kirchberg, M., Leonardi, E., Tan, Y.S., Link, S., Ko, R.K.L., Lee, B.S.: Formal concept discovery in semantic web data. In: Domenach, F., Ignatov, D.I., Poelmans, J. (eds.) ICFCA 2012. LNCS (LNAI), vol.\u00a07278, pp. 164\u2013179. Springer, Heidelberg (2012)"},{"key":"5_CR19","unstructured":"Borchman, D.: A generalized next-closure algorithm - enumerating semilattice elements from a generating set. In: Szathmary, L., Priss, U. (eds.) Proceedings of Concept Lattices and thie Applications (CLA 2012), pp. 9\u201320. Universidad de Malaga (2012)"},{"key":"5_CR20","first-page":"21","volume":"13","author":"M. Chein","year":"1969","unstructured":"Chein, M.: Algorithme de recherche des sous-matrices premires dune matrice. Bull. Math. Soc. Sci. Math. R.S. Roumanie\u00a013, 21\u201325 (1969)","journal-title":"Bull. Math. Soc. Sci. Math. R.S. Roumanie"},{"key":"5_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1007\/3-540-08442-8_118","volume-title":"Fundamentals of Computation Theory","author":"E.M. Norris","year":"1977","unstructured":"Norris, E.M.: Maximal rectangular relations. In: Karpinski, M. (ed.) FCT 1977. LNCS, vol.\u00a056, pp. 476\u2013481. Springer, Heidelberg (1977)"},{"key":"5_CR22","unstructured":"Ganter, B.: Two basic algorithms in concept analysis. FB4-Preprint 831. TH Darmstadt (1984)"},{"key":"5_CR23","first-page":"31","volume":"96","author":"J.P. Bordat","year":"1986","unstructured":"Bordat, J.P.: Calcul pratique du treillis de Galois dune correspondance. Math. Sci. Hum.\u00a096, 31\u201347 (1986)","journal-title":"Math. Sci. Hum."},{"key":"5_CR24","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/S0020-0190(99)00108-8","volume":"71","author":"L. Nourine","year":"1999","unstructured":"Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Information Procesing Letters\u00a071, 199\u2013204 (1999)","journal-title":"Information Procesing Letters"},{"key":"5_CR25","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1007\/978-3-540-24651-0_31","volume-title":"Concept Lattices","author":"D. van der Merwe","year":"2004","unstructured":"van der Merwe, D., Obiedkov, S., Kourie, D.: Addintent: A new incremental algorithm for constructing concept lattices. In: Eklund, P. (ed.) ICFCA 2004. LNCS (LNAI), vol.\u00a02961, pp. 372\u2013385. Springer, Heidelberg (2004)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Andrews, S.: Appendix to a partial-closure canonicity test to increase the efficiency of CbO-type algorithms (2013), \n                      https:\/\/dl.dropboxusercontent.com\/u\/3318140\/partialclosureappendix.pdf","DOI":"10.1007\/978-3-319-08389-6_5"},{"key":"5_CR27","unstructured":"Frank, A., Asuncion, A.: UCI machine learning repository (2010), \n                      http:\/\/archive.ics.uci.edu\/ml"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Uno, T., Kiyomi, M., Arimura, H.: Lcm ver. 3: Collaboration of array, bitmap and prefix tree for frequent itemset mining. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 77\u201386. ACM (2005)","DOI":"10.1145\/1133905.1133916"},{"key":"5_CR29","unstructured":"Andrews, S.: In-Close program (2013), \n                      http:\/\/sourceforge.net\/projects\/inclose\/"},{"key":"5_CR30","unstructured":"Krajca, P., Outrata, J., Vychodil, V.: FCbO program (2012), \n                      http:\/\/fcalgs.sourceforge.net\/"},{"volume-title":"Proceeding of 7th International Conference on Concept Lattices and Their Applications, CLA 2010","year":"2010","key":"5_CR31","unstructured":"Kryszkiewicz, M., Obiedkov, S. (eds.): Proceeding of 7th International Conference on Concept Lattices and Their Applications, CLA 2010. University of Sevilla, Seville (2010)"}],"container-title":["Lecture Notes in Computer Science","Graph-Based Representation and Reasoning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-08389-6_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,1]],"date-time":"2023-02-01T08:48:48Z","timestamp":1675241328000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-08389-6_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319083889","9783319083896"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-08389-6_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}