{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,5]],"date-time":"2025-11-05T06:33:53Z","timestamp":1762324433746,"version":"build-2065373602"},"reference-count":32,"publisher":"MDPI AG","issue":"2","license":[{"start":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T00:00:00Z","timestamp":1551052800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100008763","name":"Henan Institute of Science and Technology","doi-asserted-by":"publisher","award":["152102210093"],"award-info":[{"award-number":["152102210093"]}],"id":[{"id":"10.13039\/501100008763","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information"],"abstract":"<jats:p>Formal concept analysis has proven to be a very effective method for data analysis and rule extraction, but how to build formal concept lattices is a difficult and hot topic. In this paper, an efficient and rapid incremental concept lattice construction algorithm is proposed. The algorithm, named FastAddExtent, is seen as a modification of AddIntent in which we improve two fundamental procedures, including fixing the covering relation and searching the canonical generator. The proposed algorithm can locate the desired concept quickly by adding data fields to every concept. The algorithm is depicted in detail, using a formal context to show how the new algorithm works and discussing time and space complexity issues. We also present an experimental evaluation of its performance and comparison with AddExtent. Experimental results show that the FastAddExtent algorithm can improve efficiency compared with the primitive AddExtent algorithm.<\/jats:p>","DOI":"10.3390\/info10020078","type":"journal-article","created":{"date-parts":[[2019,2,25]],"date-time":"2019-02-25T03:06:52Z","timestamp":1551064012000},"page":"78","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["A New Rapid Incremental Algorithm for Constructing Concept Lattices"],"prefix":"10.3390","volume":"10","author":[{"given":"Jingpu","family":"Zhang","sequence":"first","affiliation":[{"name":"School of Computer and Data Science, Henan University of Urban Construction, Pingdingshan 467000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ronghui","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Computer and Data Science, Henan University of Urban Construction, Pingdingshan 467000, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ligeng","family":"Zou","sequence":"additional","affiliation":[{"name":"Information and Communication Branch of State Grid Hunan Electric Power Company Limited, Changsha 410083, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Licheng","family":"Zeng","sequence":"additional","affiliation":[{"name":"Zhuzhou CRRC (China Railway Rolling Stock Corporation) Times Electric Corporation Limited, ZhuZhou 412001, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2019,2,25]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","unstructured":"Wille, R. (2009). Restructuring lattice theory: An approach based on hierarchies of concepts. International Conference on Formal Concept Analysis, Springer.","DOI":"10.1007\/978-3-642-01815-2_23"},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Ganter, B., and Wille, R. (1999). Formal Concept Analysis: Mathematical Foundations. (Translated from the German by Cornelia Franzke), Springer.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Valtchev, P., and Missaoui, R. (2001). Building concept (Galois) lattices from parts: Generalizing the incremental methods. International Conference on Conceptual Structures, Springer.","DOI":"10.1007\/3-540-44583-8_21"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1111\/j.1467-8640.1995.tb00031.x","article-title":"Incremental concept formation algorithms based on Galois (concept) lattices","volume":"11","author":"Godin","year":"1995","journal-title":"Comput. Intell."},{"key":"ref_5","doi-asserted-by":"crossref","unstructured":"Ganter, B. (2010). Two basic algorithms in concept analysis. International Conference on Formal Concept Analysis, Springer.","DOI":"10.1007\/978-3-642-11928-6_22"},{"key":"ref_6","first-page":"31","article-title":"Calcul pratique du treillis de Galois d\u2019une correspondance","volume":"96","author":"Bordat","year":"1986","journal-title":"Math\u00e9matiques et Sciences Humaines"},{"key":"ref_7","first-page":"243","article-title":"An algorithm for computing the maximal rectangles in a binary relation","volume":"23","author":"Norris","year":"1978","journal-title":"Revue Roumaine de Math\u00e9matiques Pures et Appliqu\u00e9es"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1080\/09528130210164170","article-title":"Comparing performance of algorithms for generating concept lattices","volume":"14","author":"Kuznetsov","year":"2002","journal-title":"J. Exp. Theor. Artif. Intell."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1016\/j.knosys.2015.07.022","article-title":"A fast incremental algorithm for deleting objects from a concept lattice","volume":"89","author":"Zou","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.eswa.2015.10.026","article-title":"An efficient algorithm for increasing the granularity levels of attributes in formal concept analysis","volume":"46","author":"Zou","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Wermelinger, M., Yu, Y., and Strohmaier, M. (2009, January 16\u201324). Using formal concept analysis to construct and visualise hierarchies of socio-technical relations. Proceedings of the 2009 31st International Conference on Software Engineering\u2014Companion Volume, Vancouver, BC, Canada.","DOI":"10.1109\/ICSE-COMPANION.2009.5071013"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Ganter, B., Stumme, G., and Wille, R. (2005). Formal Concept Analysis: Foundations and Applications, Springer.","DOI":"10.1007\/978-3-540-31881-1"},{"key":"ref_13","doi-asserted-by":"crossref","unstructured":"Priss, U. (2005). Linguistic applications of formal concept analysis. Formal Concept Analysis, Springer.","DOI":"10.1007\/11528784_8"},{"key":"ref_14","first-page":"3925","article-title":"Software Climate Change and its Disruptive Weather: A Potential Shift from\u201dSoftware Engineering\u201d to Vibrant\/Dynamic Softology","volume":"10","author":"Ghani","year":"2016","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_15","doi-asserted-by":"crossref","unstructured":"Dau, F., Ducrou, J., and Eklund, P. (2008). Concept similarity and related categories in SearchSleuth. International Conference on Conceptual Structures, Springer.","DOI":"10.1007\/978-3-540-70596-3_18"},{"key":"ref_16","first-page":"2186","article-title":"The Adaptive SPAM Mail Detection System using Clustering based on Text Mining","volume":"8","author":"Hong","year":"2014","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.asoc.2011.09.004","article-title":"RSS-based e-learning recommendations exploiting fuzzy FCA for Knowledge Modeling","volume":"12","author":"Fenza","year":"2012","journal-title":"Appl. Soft Comput."},{"key":"ref_18","first-page":"150","article-title":"Text-based Image Indexing and Retrieval using Formal Concept Analysis","volume":"2","author":"Ahmad","year":"2008","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_19","doi-asserted-by":"crossref","unstructured":"Amin, I.I., Kassim, S.K., ella Hassanien, A., and Hefny, H.A. (2013, January 22\u201325). Using formal concept analysis for mining hyomethylated genes among breast cancer tumors subtypes. Proceedings of the 2013 International Conference on Advances in Computing, Communications and Informatics (ICACCI), Mysore, India.","DOI":"10.1109\/ICACCI.2013.6637226"},{"key":"ref_20","first-page":"38","article-title":"Enhanced Cloud Service Discovery for Na\u00efve users with Ontology based Representation","volume":"10","author":"Swamynathan","year":"2016","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"6601","DOI":"10.1016\/j.eswa.2013.05.007","article-title":"Formal Concept Analysis in knowledge processing: A survey on models and techniques","volume":"40","author":"Poelmans","year":"2013","journal-title":"Expert Syst. Appl."},{"key":"ref_22","first-page":"2784","article-title":"Increasing Splicing Site Prediction by Training Gene Set Based on Species","volume":"6","author":"Ahn","year":"2012","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"3777","DOI":"10.1109\/ACCESS.2017.2679038","article-title":"Identifying Influential Nodes in Complex Networks Based on Weighted Formal Concept Analysis","volume":"5","author":"Sun","year":"2017","journal-title":"IEEE Access"},{"key":"ref_24","first-page":"583","article-title":"Inter-category Map: Building Cognition Network of General Customers through Big Data Mining","volume":"8","author":"Song","year":"2014","journal-title":"KSII Trans. Internet Inf. Syst."},{"key":"ref_25","unstructured":"Lv, L., Zhang, L., Zhu, A., and Zhou, F. (2011, January 25\u201328). An improved addintent algorithm for building concept lattice. Proceedings of the 2011 2nd International Conference on Intelligent Control and Information Processing (ICICIP), Harbin, China."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Van Der Merwe, D., Obiedkov, S., and Kourie, D. (2004). AddIntent: A new incremental algorithm for constructing concept lattices. International Conference on Formal Concept Analysis, Springer.","DOI":"10.1007\/978-3-540-24651-0_31"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1016\/j.scico.2008.09.015","article-title":"An incremental algorithm to construct a lattice of set intersections","volume":"74","author":"Kourie","year":"2009","journal-title":"Sci. Comput. Programm."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1016\/j.ins.2011.09.023","article-title":"Fast algorithm for computing fixpoints of Galois connections induced by object-attribute relational data","volume":"185","author":"Outrata","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_29","first-page":"17","article-title":"A fast algorithm for computing all intersections of objects from an arbitrary semilattice","volume":"1","author":"Kuznetsov","year":"1993","journal-title":"Nauchno-Tekh. Informatsiya Ser. 2-Informatsionnye Protsessy I Sist."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"924","DOI":"10.1016\/j.dam.2007.08.004","article-title":"A framework for incremental generation of closed itemsets","volume":"156","author":"Valtchev","year":"2008","journal-title":"Discret. Appl. Math."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"4474","DOI":"10.1016\/j.eswa.2015.01.044","article-title":"A fast incremental algorithm for constructing concept lattices","volume":"42","author":"Zou","year":"2015","journal-title":"Expert Syst. Appl."},{"key":"ref_32","unstructured":"Van Der Merwe, F., and Kourie, D. (2002). AddAtom: An Incremental Algorithm for Constructing Concept Lattices and Concept Sublattices, Department of Computer Science, University of Pretoria. Technical Report."}],"container-title":["Information"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/2\/78\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T12:34:31Z","timestamp":1760186071000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2078-2489\/10\/2\/78"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,2,25]]},"references-count":32,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2019,2]]}},"alternative-id":["info10020078"],"URL":"https:\/\/doi.org\/10.3390\/info10020078","relation":{},"ISSN":["2078-2489"],"issn-type":[{"type":"electronic","value":"2078-2489"}],"subject":[],"published":{"date-parts":[[2019,2,25]]}}}