A New Rapid Incremental Algorithm for Constructing Concept Lattices
AbstractFormal 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. View Full-Text
Share & Cite This Article
Zhang, J.; Liu, R.; Zou, L.; Zeng, L. A New Rapid Incremental Algorithm for Constructing Concept Lattices. Information 2019, 10, 78.
Zhang J, Liu R, Zou L, Zeng L. A New Rapid Incremental Algorithm for Constructing Concept Lattices. Information. 2019; 10(2):78.Chicago/Turabian Style
Zhang, Jingpu; Liu, Ronghui; Zou, Ligeng; Zeng, Licheng. 2019. "A New Rapid Incremental Algorithm for Constructing Concept Lattices." Information 10, no. 2: 78.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.