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 Kra-
jca, discussing computational methods, data requirements and memory
considerations. From experiments using several public data sets and ran-
dom data, this paper shows that In-Close is in the order of 20 times
faster than Krajca. In-Close is small, straightforward, requires no ma-
trix pre-processing and is simple to implement.
%0 Journal Article
%1 SimonAndrews_2009
%A Andrews, Simon
%D 2009
%K 2017 In-Close algorithm concepts fca kde seminar
%T In-Close, a Fast Algorithm for Computing Formal Concepts
%X 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 Kra-
jca, discussing computational methods, data requirements and memory
considerations. From experiments using several public data sets and ran-
dom data, this paper shows that In-Close is in the order of 20 times
faster than Krajca. In-Close is small, straightforward, requires no ma-
trix pre-processing and is simple to implement.
@article{SimonAndrews_2009,
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 Kra-
jca, discussing computational methods, data requirements and memory
considerations. From experiments using several public data sets and ran-
dom data, this paper shows that In-Close is in the order of 20 times
faster than Krajca. In-Close is small, straightforward, requires no ma-
trix pre-processing and is simple to implement.},
added-at = {2017-08-14T23:33:09.000+0200},
author = {Andrews, Simon},
biburl = {https://www.bibsonomy.org/bibtex/2460836f27921176cb7533733b171f097/johirth},
interhash = {2f59ebe3757d4b944a3c14b9f0fa5c5d},
intrahash = {460836f27921176cb7533733b171f097},
keywords = {2017 In-Close algorithm concepts fca kde seminar},
timestamp = {2017-08-14T23:33:09.000+0200},
title = {In-Close, a Fast Algorithm for Computing Formal Concepts},
urldate = {15.07.2012},
year = 2009
}