%0 Journal Article %1 BERTET2016 %A Bertet, Karell %A Demko, Christophe %A Viaud, Jean-François %A Guérin, Clément %D 2016 %J Theoretical Computer Science %K base canonical closure fca implication lattices %R https://doi.org/10.1016/j.tcs.2016.11.021 %T Lattices, closures systems and implication bases: A survey of structural aspects and algorithms %U http://www.sciencedirect.com/science/article/pii/S0304397516306806 %X Abstract Concept lattices and closed set lattices are graphs with the lattice property. They have been increasingly used this last decade in various domains of computer science, such as data mining, knowledge representation, databases or information retrieval. A fundamental result of lattice theory establishes that any lattice is the concept lattice of its binary table. A consequence is the existence of a bijective link between lattices, contexts (via the table) and a set of implicational rules (via the canonical (direct) basis). The possible transformations between these objects give rise to relevant tools for data analysis. In this paper, we present a survey of lattice theory, from the algebraic definition of a lattice, to that of a concept lattice, through closure systems and implicational rules; including the exploration of fundamental bijective links between lattices, reduced contexts and bases of implicational rules; and concluding with the presentation of the main generation algorithms of these objects.

@article{BERTET2016, abstract = {Abstract Concept lattices and closed set lattices are graphs with the lattice property. They have been increasingly used this last decade in various domains of computer science, such as data mining, knowledge representation, databases or information retrieval. A fundamental result of lattice theory establishes that any lattice is the concept lattice of its binary table. A consequence is the existence of a bijective link between lattices, contexts (via the table) and a set of implicational rules (via the canonical (direct) basis). The possible transformations between these objects give rise to relevant tools for data analysis. In this paper, we present a survey of lattice theory, from the algebraic definition of a lattice, to that of a concept lattice, through closure systems and implicational rules; including the exploration of fundamental bijective links between lattices, reduced contexts and bases of implicational rules; and concluding with the presentation of the main generation algorithms of these objects.}, added-at = {2018-01-08T11:05:09.000+0100}, author = {Bertet, Karell and Demko, Christophe and Viaud, Jean-François and Guérin, Clément}, biburl = {https://www.bibsonomy.org/bibtex/26e5e94c17d70fd087812952f9b404b21/tomhanika}, doi = {https://doi.org/10.1016/j.tcs.2016.11.021}, interhash = {c47464ff0f5e7fa037fa80d5a1ce226d}, intrahash = {6e5e94c17d70fd087812952f9b404b21}, issn = {0304-3975}, journal = {Theoretical Computer Science}, keywords = {base canonical closure fca implication lattices}, timestamp = {2018-01-08T11:05:09.000+0100}, title = {Lattices, closures systems and implication bases: A survey of structural aspects and algorithms}, url = {http://www.sciencedirect.com/science/article/pii/S0304397516306806}, year = 2016 }