Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
S. Kuznetsov, and S. Obiedkov. Principles of Data Mining and Knowledge Discovery, page 289--300. Berlin, Heidelberg, Springer Berlin Heidelberg, (2001)
Abstract
Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.
Description
Algorithms for the Construction of Concept Lattices and Their Diagram Graphs | SpringerLink
%0 Conference Paper
%1 kuznetsov2001algorithms
%A Kuznetsov, Sergei O.
%A Obiedkov, Sergei A.
%B Principles of Data Mining and Knowledge Discovery
%C Berlin, Heidelberg
%D 2001
%E De Raedt, Luc
%E Siebes, Arno
%I Springer Berlin Heidelberg
%K analysis concept drawing fca formal graph visualization
%P 289--300
%T Algorithms for the Construction of Concept Lattices and Their Diagram Graphs
%X Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.
%@ 978-3-540-44794-8
@inproceedings{kuznetsov2001algorithms,
abstract = {Several algorithms that generate the set of all formal concepts and graphs of line (Hasse) diagrams of concept lattices are considered. Some modifications of well-known algorithms are proposed. Algorithmic complexity of the algorithms is studied both theoretically (in the worst case) and experimentally. Conditions of preferable use of some algorithms are given in terms of density/sparsity of underlying formal contexts.},
added-at = {2018-07-13T15:29:42.000+0200},
address = {Berlin, Heidelberg},
author = {Kuznetsov, Sergei O. and Obiedkov, Sergei A.},
biburl = {https://www.bibsonomy.org/bibtex/2bc6667c6bbccd0c13327e81319877600/jaeschke},
booktitle = {Principles of Data Mining and Knowledge Discovery},
description = {Algorithms for the Construction of Concept Lattices and Their Diagram Graphs | SpringerLink},
editor = {De Raedt, Luc and Siebes, Arno},
interhash = {610c214129d266a2f43fa999251f856b},
intrahash = {bc6667c6bbccd0c13327e81319877600},
isbn = {978-3-540-44794-8},
keywords = {analysis concept drawing fca formal graph visualization},
pages = {289--300},
publisher = {Springer Berlin Heidelberg},
timestamp = {2018-07-13T15:29:42.000+0200},
title = {Algorithms for the Construction of Concept Lattices and Their Diagram Graphs},
year = 2001
}