{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T09:07:09Z","timestamp":1758272829125},"reference-count":55,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,11,23]],"date-time":"2013-11-23T00:00:00Z","timestamp":1385164800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2014,4]]},"DOI":"10.1007\/s00500-013-1176-6","type":"journal-article","created":{"date-parts":[[2013,11,22]],"date-time":"2013-11-22T14:50:06Z","timestamp":1385131806000},"page":"683-694","source":"Crossref","is-referenced-by-count":13,"title":["A new FCA algorithm enabling analyzing of complex and dynamic data sets"],"prefix":"10.1007","volume":"18","author":[{"given":"Petr","family":"Gajdo\u0161","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V\u00e1clav","family":"Sn\u00e1\u0161el","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2013,11,23]]},"reference":[{"key":"1176_CR1","doi-asserted-by":"crossref","unstructured":"Andrews S (2011) In-close2, a high performance formal concept miner. In: ICCS, pp 50\u201362","DOI":"10.1007\/978-3-642-22688-5_4"},{"key":"1176_CR2","unstructured":"ARG: Amphora Research Group (2012) V\u0160B-Technical University of Ostrava. http:\/\/arg.vsb.cz\/"},{"key":"1176_CR3","doi-asserted-by":"crossref","unstructured":"Baixeries J, Szathmary L, Valtchev P, Godin R (2009) Yet a faster algorithm for building the Hasse diagram of a concept lattice. In: Ferre\u2019s, Rudolph S (eds) Formal Concept Analysis. Lecture notes in computer science, vol 5548. Springer, Heidelberg","DOI":"10.1007\/978-3-642-01815-2_13"},{"key":"1176_CR4","unstructured":"Bank RE, Douglas CC (2012) Sparse Matrix Multiplication Package. http:\/\/www.mgnet.org\/~douglas\/Preprints\/pub34.pdf"},{"key":"1176_CR5","volume-title":"Lattice theory","author":"G Birkhoff","year":"1967","unstructured":"Birkhoff G (1967) Lattice theory, 3rd edn. American Mathematical Society, Providence","edition":"3"},{"key":"1176_CR6","unstructured":"Bordat JP (1986) Calcul pratique du Treillis de Galois dune Correspondance. Mathematiques et Sciences Humaines, pp 31\u201347"},{"key":"1176_CR7","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0045-6535(97)00133-1","volume":"1995","author":"R Br\u00fcggemann","year":"1997","unstructured":"Br\u00fcggemann R, Voigt K, Steinberg C (1997) Application of formal concept analysis to evaluate environmental databases (1997). Chemosphere 1995:479\u2013486","journal-title":"Chemosphere"},{"key":"1176_CR8","doi-asserted-by":"crossref","unstructured":"B\u011blohl\u00e1vek, R., Sklen\u00e1\u0159, V (2005) Formal concept analysis constrained by attribute-dependency formulas. In: International conference on formal concept analysis (ICFCA 2005), vol 3403. Springer, Berlin, pp 176\u2013191","DOI":"10.1007\/978-3-540-32262-7_12"},{"key":"1176_CR9","doi-asserted-by":"crossref","unstructured":"Carpineto C, Romano G (1996) A lattice conceptual clustering system and its application to browsing retrieval. Mach Learn 24:95\u2013122","DOI":"10.1007\/BF00058654"},{"key":"1176_CR10","unstructured":"Chain M (1969) Algorithme de recherche des sous-matrices premieres des sous-matrices. Bulletin Math. Soc. Sci. Math. R.S. Roumanie 13:21\u201325"},{"key":"1176_CR11","unstructured":"Cole RJ, Eklund PW (1996) Text retrieval for medical discharge summaries using snomed and formal concept analysis. In: First Australian Document Computing Symposium (ADCS 1996), pp 50\u201358 (RJ\u2019s first paper)"},{"key":"1176_CR12","doi-asserted-by":"crossref","unstructured":"Dencker P, D\u00fcrre K, Heuft J (1984) Optimization of parser tables for portable compilers. ACM Trans Progr Lang Syst 6:546\u2013572","DOI":"10.1145\/1780.1802"},{"key":"1176_CR13","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1006\/jmps.1993.1003","volume":"37","author":"CE Downling","year":"1993","unstructured":"Downling CE (1993) On the irredundant generation of knowledge spaces. Math. Psychol. 37:49\u201362","journal-title":"Math. Psychol."},{"key":"1176_CR14","unstructured":"Dvorsk\u00fd J (2004) Word-based Compression Methods for Information Retrieval Systems. Ph.D. thesis, Charles University, Prague, Czech Republice"},{"key":"1176_CR15","unstructured":"Eilenberg S (1974) Automata, languages, and machines, vol A. Academic Press, London"},{"key":"1176_CR16","unstructured":"Eklund P, Groh B, Stumme G, Wille R (2000) A contextual-logic extension of TOSCANA, conceptual structures: logical, linguistic, and computational issues. In: 8th International conference on conceptual structures (ICCS 2000). Springer, Berlin, pp 453\u2013467"},{"issue":"3","key":"1176_CR17","doi-asserted-by":"crossref","first-page":"698","DOI":"10.1109\/TNN.2007.891664","volume":"18","author":"A Frolov","year":"2007","unstructured":"Frolov A, Husek D, Muraviev I, Polyakov P (2007) Boolean factor analysis by attractor neural network. IEEE Trans Neural Netw 18(3):698\u2013707","journal-title":"IEEE Trans Neural Netw"},{"key":"1176_CR18","doi-asserted-by":"crossref","unstructured":"Galitsky B, de la Rosa JL (2011) Concept-based learning of human behavior for customer relationship management. Inf Sci 181(10):2016\u20132035. doi: 10.1016\/j.ins.2010.08.027","DOI":"10.1016\/j.ins.2010.08.027"},{"key":"1176_CR19","unstructured":"Ganter B (1984) Two basic algorithms in concept, analysis. FB4-Preprint No. 831 pp 312\u2013340"},{"key":"1176_CR20","doi-asserted-by":"crossref","unstructured":"Ganter B, Glodeanu C (2012) Ordinal factor analysis. Formal Concept Analysis. In: Domenach F, Ignatov D, Poelmans J (eds) Lecture notes in computer science, vol 7278. Springer, Berlin, pp 128\u2013139","DOI":"10.1007\/978-3-642-29892-9_15"},{"key":"1176_CR21","unstructured":"Ganter B, Kuznetzov S (1998) Stepwise construction of the Dedekind\u2013McNeille completion, conceptual structures: theory, tools and applications. In: 6th International conference on conceptual structures (ICCS 1998). Springer, Berlin, pp 295\u2013302"},{"key":"1176_CR22","doi-asserted-by":"crossref","first-page":"282","DOI":"10.1007\/BF00383449","volume":"8","author":"B Ganter","year":"1991","unstructured":"Ganter B, Reuter K (1991) Finding all closed sets: a general approach. Order 8:282\u2013290","journal-title":"Order"},{"key":"1176_CR23","doi-asserted-by":"crossref","unstructured":"Ganter B, Wille, R (199) Formal concept analysis. Springer, Berlin (1999)","DOI":"10.1007\/978-3-642-59830-2"},{"key":"1176_CR24","doi-asserted-by":"crossref","unstructured":"Godin R, Missaoui R, Alaoui H (1995) Incremental concept formation algorithms based on galois (concept) lattices. Comput Intell 11:246\u2013267","DOI":"10.1111\/j.1467-8640.1995.tb00031.x"},{"key":"1176_CR25","doi-asserted-by":"crossref","unstructured":"Godin R, Missaoui R, April A (1993) Experimental comparison of navigation in a Galois lattice with conventional information retrieval methods. Int J Man Mach Stud, pp 747\u2013767","DOI":"10.1006\/imms.1993.1035"},{"key":"1176_CR26","unstructured":"Goethals B (2002) Efficient Frequent Pattern Mining. Ph.D. thesis, Transnationale Universiteit Limburg, School voor Informatietechnologie"},{"key":"1176_CR27","doi-asserted-by":"crossref","unstructured":"Kaytoue M, Kuznetsov SO, Napoli A, Duplessis S (2011) Mining gene expression data with pattern structures in formal concept analysis. Inf Sci 181(10), 1989\u20132001. doi: 10.1016\/j.ins.2010.07.007","DOI":"10.1016\/j.ins.2010.07.007"},{"key":"1176_CR28","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1844-9","volume-title":"Automata and computability","author":"DC Kozen","year":"1997","unstructured":"Kozen DC (1997) Automata and computability. Springer, Berlin"},{"key":"1176_CR29","unstructured":"Krajca P, Outrata J, Vychodil V (2008) V.: Parallel recursive algorithm for FCA. Palacky university, Olomouc, pp 71\u201382"},{"issue":"2","key":"1176_CR30","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1007\/s10472-010-9199-5","volume":"59","author":"P Krajca","year":"2010","unstructured":"Krajca P, Outrata J, Vychodil V (2010) Parallel algorithm for computing fixpoints of galois connections. Ann Math Artif Intell 59(2):257\u2013272","journal-title":"Ann Math Artif Intell"},{"key":"1176_CR31","unstructured":"Kuznetsov SO (1993) A fast algorithms for computing all intersections of objects in a finite semi-lattic. Autom Documentation Math Linguist 27:11\u201321"},{"key":"1176_CR32","unstructured":"Kuznetsov SO, Ob\u2019edkov SA (2001) Comparing performance of algorithms for generating concept lattices, international workshop on concept lattices-based theory. In: Methods and Tools for Knowledge Discovery in Databases (CLKDD01) in ICCS 2001, pp 35\u201347, Stanford University"},{"key":"1176_CR33","unstructured":"L\u00e9vy G, Baklouti F (2004) A distributed version of the Ganter algorithm for general Galois lattices"},{"key":"1176_CR34","doi-asserted-by":"crossref","unstructured":"Li J, Mei C, Lv Y (2012) Knowledge reduction in real decision formal contexts. Inf Sci 189:191\u2013207. doi: 10.1016\/j.ins.2011.11.041","DOI":"10.1016\/j.ins.2011.11.041"},{"key":"1176_CR35","unstructured":"Lindig C (1995) Concept based component retrieval. In: Working notes of the IJCAJ 1995 workshop: formal approaches to the reuse of plans, proofs, and programs, pp 21\u201325"},{"key":"1176_CR36","unstructured":"Lindig, C.: Algorithmen zur Begriffsanalyse und ihre Anwendung bei Softwarebibliotheken. Master\u2019s thesis, Technical University of Braunschweig (1999). http:\/\/www.gaertner.de\/lindig\/papers\/diss\/"},{"key":"1176_CR37","first-page":"103","volume":"2005","author":"J Martinovi\u010d","year":"2005","unstructured":"Martinovi\u010d J, Dvorsk\u00fd J, Sn\u00e1\u0161el V (2005) Sparse binary matrices. ITAT 2005:103\u2013116","journal-title":"ITAT"},{"key":"1176_CR38","doi-asserted-by":"crossref","unstructured":"Medina J, Ojeda-Aciego M (2010) Multi-adjoint t-concept lattices. Inf Sci 180(5):712\u2013725. doi: 10.1016\/j.ins.2009.11.018","DOI":"10.1016\/j.ins.2009.11.018"},{"key":"1176_CR39","unstructured":"Norris EM (1978) An algorithm for computing the maximal rectangles in a binary relation. Revue Roumaine de mathematiques Pures et Alliquees 23:243\u2013250"},{"key":"1176_CR40","doi-asserted-by":"crossref","unstructured":"Nourine L., Raynaud O (1999) A fast algorithm for building lattices. Inf Process Lett 71:199\u2013204","DOI":"10.1016\/S0020-0190(99)00108-8"},{"key":"1176_CR41","unstructured":"Priss U (2000) Lattice-based information retrieval. Knowl Organ, pp 132\u2013142"},{"key":"1176_CR42","doi-asserted-by":"crossref","unstructured":"Rozenberg GA, Salomaa E (1997) Handbook of formal language, vol I\u2013III","DOI":"10.1007\/978-3-642-59136-5"},{"key":"1176_CR43","doi-asserted-by":"crossref","unstructured":"Siff M, Reps T (1997) Identifying modules via concept analysis. In: Proceedings of the international conference on the software maintaince. IEEE Computer Society Press, New York, pp 170\u2013179","DOI":"10.1109\/ICSM.1997.624243"},{"key":"1176_CR44","volume-title":"ITAT 2002","author":"V Sn\u00e1\u0161el","year":"2002","unstructured":"Sn\u00e1\u0161el V, Dvorsk\u00fd J, Vondr\u00e1k V (2002) Random access storage system for sparse matrices. In: Andrejkov\u00e1 G, Lencses R (eds) ITAT 2002. Brdo, High Fatra, Slovakia"},{"key":"1176_CR45","doi-asserted-by":"crossref","unstructured":"Snelting G (2000) Software reengineering based on concept lattices. In: 4th European conference on software maintenance and reengineering (CSMR 2000). IEEE Computer Society, New York, pp 3\u201310","DOI":"10.1109\/CSMR.2000.827299"},{"key":"1176_CR46","unstructured":"Spangenberg N, Fischer R, Wolff KE (1999) Towards a methodology for the exploration of \u201ctacit structures of knowledge\u201d to gain access to personal knowledge reserve of psychoanalysis: the example of psychoanalysis versus psychotherapy. Psychoanalytic research by means of formal concept, analysis"},{"key":"1176_CR47","unstructured":"Stumme G, Taouil RY, Bastide NP, Lakhal L (2000) Fast computation of concept lattices using data mining techniques. In: 7th International workshop on knowledge representation meets databases (KRDB 2000), pp 129\u2013139 (2000)"},{"key":"1176_CR48","doi-asserted-by":"crossref","unstructured":"Stumme G, Wille R (1998) Conceptual knowledge discovery in databases using formal concept analysis methods. Principles of data mining and knowledge discovery. In: 2nd European Symposium on PKDD 1998. Springer, Berlin, pp 450\u2013458","DOI":"10.1007\/BFb0094849"},{"key":"1176_CR49","unstructured":"Valtchev P, Missaoui R (2001) Building concept (Galois) lattices from parts: generalizing the incremental methods, conceptual structures: broadening the base. In: 9th international conference on conceptual structures (ICCS 2001). Springer, Berlin, pp 290\u2013303"},{"key":"1176_CR50","doi-asserted-by":"crossref","unstructured":"Vogt F, Wille R (1995) TOSCANA\u2014a graphical tool for analyzing and exploring data. Graph Draw, pp 226\u2013233","DOI":"10.1007\/3-540-58950-3_374"},{"key":"1176_CR51","doi-asserted-by":"crossref","unstructured":"Wang L, Liu X, Cao J (2010) A new algebraic structure for formal concept analysis. Inf Sci 180(24):4865\u20134876. doi: 10.1016\/j.ins.2010.08.020","DOI":"10.1016\/j.ins.2010.08.020"},{"key":"1176_CR52","unstructured":"Wille R (2001) Why can concept lattice support knowledge discovery in databases? In: International workshop on concept lattices-based theory, methods and tools for knowledge discovery in databases (CLKDD 2001), ICCS 2001, pp 7\u201320"},{"key":"1176_CR53","unstructured":"Wille R (2009) Restructuring lattice theory: an approach based on hierarchies of concepts. In: Proceedings of the 7th international conference on formal concept analysis, ICFCA 2009. Springer, Berlin, pp 314\u2013339. doi: 10.1007\/978-3-642-01815-2-23"},{"key":"1176_CR54","unstructured":"Yevtushenko S (2004) Computing and Visualizing Concept Lattices. Ph.D. thesis, Fachbereich Informatik der Technischen Universit\u00e4t Darmstadt"},{"key":"1176_CR55","doi-asserted-by":"crossref","unstructured":"Yuster R, Zwick U (2005) Fast sparse matrix multiplication. ACM Trans Algorithms 1(1):2\u201313. doi: 10.1145\/1077464.1077466","DOI":"10.1145\/1077464.1077466"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1176-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-013-1176-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-013-1176-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,4]],"date-time":"2019-08-04T00:02:46Z","timestamp":1564876966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-013-1176-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,11,23]]},"references-count":55,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,4]]}},"alternative-id":["1176"],"URL":"https:\/\/doi.org\/10.1007\/s00500-013-1176-6","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,11,23]]}}}