In-Close, a fast algorithm for computing formal concepts

ANDREWS, S. (2009). In-Close, a fast algorithm for computing formal concepts. In: International Conference on Conceptual Structures (ICCS), Moscow, 2009.

Preview

PDF fulltext.pdf Download (207kB) | Preview

Abstract

This paper presents an algorithm, called In-Close, that uses incremental closure and matrix searching to quickly compute all formal concepts in a formal context. In-Close is based, conceptually, on a well known algorithm called Close-By-One. The serial version of a recently published algorithm (Krajca, 2008) was shown to be in the order of 100 times faster than several well-known algorithms, and timings of other algorithms in reviews suggest that none of them are faster than Krajca. This paper compares In-Close to Krajca, discussing computational methods, data requirements and memory considerations. From experiments using several public data sets and random data, this paper shows that In-Close is in the order of 20 times faster than Krajca. In-Close is small, straightforward, requires no matrix pre-processing and is simple to implement.

Item Type:	Conference or Workshop Item (Paper)
Additional Information:	Final version of paper accepted (via peer review) for the International Conference on Conceptual Structures (ICCS) 2009, Moscow
Research Institute, Centre or Group - Does NOT include content added after October 2018:	Cultural Communication and Computing Research Institute > Communication and Computing Research Centre
Departments - Does NOT include content added after October 2018:	Faculty of Science, Technology and Arts > Department of Computing
Depositing User:	Ann Betterton
Date Deposited:	02 Apr 2009
Last Modified:	18 Mar 2021 14:03
URI:	https://shura.shu.ac.uk/id/eprint/38

Actions (login required)

View Item

Downloads

Publication Metrics