文章基本信息

标题：A New Rapid Incremental Algorithm for Constructing Concept Lattices
本地全文：下载
作者：Jingpu Zhang ; Ronghui Liu ; Ligeng Zou 等
期刊名称：Information
电子版ISSN：2078-2489
出版年度：2019
卷号：10
期号：2
页码：78-89
DOI：10.3390/info10020078
出版社：MDPI Publishing
摘要：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.
关键词：formal concept analysis; concept lattice; AddExtent algorithm; construction algorithm; incremental algorithm formal concept analysis ; concept lattice ; AddExtent algorithm ; construction algorithm ; incremental algorithm