Next Article in Journal
Readiness and Success of Ubiquitous Learning in Indonesia: Perspectives from the Implementation of a Pilot Project
Previous Article in Journal
DFTHR: A Distributed Framework for Trajectory Similarity Query Based on HBase and Redis
Article Menu

Export Article

Open AccessArticle

A New Rapid Incremental Algorithm for Constructing Concept Lattices

1
School of Computer and Data Science, Henan University of Urban Construction, Pingdingshan 467000, China
2
Information and Communication Branch of State Grid Hunan Electric Power Company Limited, Changsha 410083, China
3
Zhuzhou CRRC (China Railway Rolling Stock Corporation) Times Electric Corporation Limited, ZhuZhou 412001, China
*
Author to whom correspondence should be addressed.
Information 2019, 10(2), 78; https://doi.org/10.3390/info10020078
Received: 12 January 2019 / Revised: 18 February 2019 / Accepted: 19 February 2019 / Published: 25 February 2019
(This article belongs to the Section Information Theory and Methodology)
  |  
PDF [2992 KB, uploaded 25 February 2019]
  |  

Abstract

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. View Full-Text
Keywords: formal concept analysis; concept lattice; AddExtent algorithm; construction algorithm; incremental algorithm formal concept analysis; concept lattice; AddExtent algorithm; construction algorithm; incremental algorithm
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited (CC BY 4.0).
SciFeed

Share & Cite This Article

MDPI and ACS Style

Zhang, J.; Liu, R.; Zou, L.; Zeng, L. A New Rapid Incremental Algorithm for Constructing Concept Lattices. Information 2019, 10, 78.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Information EISSN 2078-2489 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top