{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T14:19:25Z","timestamp":1775053165821,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540210436","type":"print"},{"value":"9783540246510","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24651-0_31","type":"book-chapter","created":{"date-parts":[[2010,8,2]],"date-time":"2010-08-02T15:14:05Z","timestamp":1280762045000},"page":"372-385","source":"Crossref","is-referenced-by-count":60,"title":["AddIntent: A New Incremental Algorithm for Constructing Concept Lattices"],"prefix":"10.1007","author":[{"given":"Dean","family":"van der Merwe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergei","family":"Obiedkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derrick","family":"Kourie","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"31_CR1","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, New York (1999)"},{"key":"31_CR2","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/978-94-009-7798-3_15","volume-title":"Ordered Sets","author":"R. Wille","year":"1982","unstructured":"Wille, R.: Restructuring Lattice Theory: An Approach Based on Hierarchies of Concepts. In: Rival, I. (ed.) Ordered Sets, pp. 445\u2013470. Reidel, Dordrecht (1982)"},{"key":"31_CR3","first-page":"31","volume":"96","author":"J. Bordat","year":"1986","unstructured":"Bordat, J.: Calcul pratique du treillis de Galois d\u2019une correspondance. Math. Sci. Hum.\u00a096, 31\u201347 (1986)","journal-title":"Math. Sci. Hum."},{"key":"31_CR4","unstructured":"Ganter, B.: Two Basic Algorithms in Concept Analysis. FB4-Preprint No. 831, TH Darmstadt (1984)"},{"key":"31_CR5","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. Computation Intelligence\u00a011, 246\u2013267 (1995)","journal-title":"Computation Intelligence"},{"key":"31_CR6","first-page":"243","volume":"23","author":"E. Norris","year":"1978","unstructured":"Norris, E.: An Algorithm for Computing the Maximal Rectangles in a Binary Relation. Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es\u00a023, 243\u2013250 (1978)","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"31_CR7","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/3-540-44583-8_21","volume-title":"Conceptual Structures: Broadening the Base","author":"P. Valtchev","year":"2001","unstructured":"Valtchev, P., Missaoui, R.: Building Concept (Galois) Lattices from Parts: Generalizing the Incremental Methods. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol.\u00a02120, pp. 290\u2013303. Springer, Heidelberg (2001)"},{"key":"31_CR8","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. Experimental and Theoretical Artificial Intelligence\u00a014, 189\u2013216 (2002)","journal-title":"J. Experimental and Theoretical Artificial Intelligence"},{"key":"31_CR9","unstructured":"Van Der Merwe, F., Kourie, D.: AddAtom: an Incremental Algorithm for Constructing Concept- and Concept Sublattices. Technical report of the Department of Computer Science, University of Pretoria, South Africa (2002)"},{"key":"31_CR10","first-page":"95","volume":"24","author":"C. Carpineto","year":"1996","unstructured":"Carpineto, C., Romano, G.: A Lattice Conceptual Clustering System and Its Application to Browsing Retrieval. Machine Learning\u00a024, 95\u2013122 (1996)","journal-title":"Machine Learning"},{"key":"31_CR11","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 Processing Letters\u00a071, 199\u2013204 (1999)","journal-title":"Information Processing Letters"},{"key":"31_CR12","unstructured":"Van Der Merwe, F.: Constructing Concept Lattices and Compressed Pseudo-Lattices. M.Sc. dissertation, University of Pretoria, South Africa (2003)"},{"key":"31_CR13","unstructured":"Obiedkov, S.: Algorithms and Methods of Lattice Theory and Their Application in Machine Learning. PhD thesis, Russian State University for the Humanities (2003)"},{"key":"31_CR14","unstructured":"Ferr\u00e9, S.: Incremental Concept Formation Made More Efficient by the Use of Associative Concepts. INRIA Research Report no 4569 (2002)"},{"key":"31_CR15","unstructured":"Valtchev, P., Missaoui, R., Lebrun, P.: A Partition-Based Approach towards Building Galois (Concept) Lattices. Rapport de recherche no. 2000-08, D\u00e9partement d\u2019Informatique, UQAM, Montr\u00e9al, Canada (2000)"},{"key":"31_CR16","unstructured":"Blake, C., Merz, C.: UCI Repository of Machine Learning Databases. University of California, Department of Information and Computer Science, Irvine, CA (1998), \n                  \n                    http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html"},{"key":"31_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-540-39644-4_28","volume-title":"Discovery Science","author":"P. Grigoriev","year":"2003","unstructured":"Grigoriev, P., Yevtushenko, S.: Elements of an Agile Discovery Environment. In: Grieser, G., Tanaka, Y., Yamamoto, A. (eds.) DS 2003. LNCS (LNAI), vol.\u00a02843, pp. 309\u2013316. Springer, Heidelberg (2003)"},{"key":"31_CR18","unstructured":"Grigoriev, P., Yevtushenko, S., Grieser, G.: QuDA, a Data Miner\u2019s Discovery Environment. Technical Report AIDA\u201303\u201306, TU Darmstadt (2003), \n                  \n                    http:\/\/www.intellektik.informatik.tu-darmstadt.de\/~peter\/QuDA.pdf"},{"key":"31_CR19","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1080\/09528130210164215","volume":"14","author":"F. Merwe Van Der","year":"2002","unstructured":"Van Der Merwe, F., Kourie, D.: Compressed Pseudo-Lattices. J. Expt. Theor. Artif. Intell.\u00a014, 229\u2013254 (2002)","journal-title":"J. Expt. Theor. Artif. Intell."},{"key":"31_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1080\/09528130210164198","volume":"14","author":"P. Valtchev","year":"2002","unstructured":"Valtchev, P., Missaoui, R., Godin, R., Meridji, M.: Generating Frequent Itemsets Incrementally: Two Novel Approaches Based on Galois Lattice Theory. J. Expt. Theor. Artif. Intell.\u00a014, 115\u2013142 (2002)","journal-title":"J. Expt. Theor. Artif. Intell."},{"key":"31_CR21","unstructured":"Mailing list on FCA-algorithms: \n                  \n                    http:\/\/www.aifb.uni-karlsruhe.de\/mailman\/listinfo\/fca-algo\n                  \n                  \n                , Internet site of the Workshop on Algorithms of Formal Concept Analysis: \n                  \n                    http:\/\/kvo.itee.uq.edu.au\/twiki\/bin\/view\/Tockit\/AlgoWorkshop"}],"container-title":["Lecture Notes in Computer Science","Concept Lattices"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24651-0_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T17:42:46Z","timestamp":1552844566000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24651-0_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540210436","9783540246510"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24651-0_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}