@article{guigues1986familles,
  author = {Guigues, J.-L. and Duquenne, V.},
  interhash = {3671be91dd80e5c415ede85e94ada3d7},
  intrahash = {fee9525a2e89b5ebced886b3a9f0194d},
  journal = {Mathématiques et Sciences Humaines},
  pages = {5--18},
  title = {Familles minimales d'implications informatives résultant d'un tableau de données binaires},
  volume = 95,
  year = 1986
}

@incollection{ganter1998stepwise,
  abstract = {Lattices are mathematical structures which are frequently used for the representation of data. Several authors have considered the problem of incremental construction of lattices. We show that with a rather general approach, this problem becomes well-structured. We give simple algorithms with satisfactory complexity bounds.},
  address = {Berlin/Heidelberg},
  author = {Ganter, Bernhard and Kuznetsov, Sergei},
  booktitle = {Conceptual Structures: Theory, Tools and Applications},
  doi = {10.1007/BFb0054922},
  editor = {Mugnier, Marie-Laure and Chein, Michel},
  interhash = {6ab4d800575b90bf787ade575b38994b},
  intrahash = {0c986e520647b86c202633cc6945d524},
  isbn = {978-3-540-64791-1},
  pages = {295--302},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Stepwise construction of the Dedekind-MacNeille completion},
  url = {http://dx.doi.org/10.1007/BFb0054922},
  volume = 1453,
  year = 1998
}

@article{yong2001lattices,
  abstract = {The main purposes of this article are to uncover interesting features in real-world citationnetworks, and to highlight important substructures. In particular, it applies lattice theory tocitation analysis. On the applied side, it shows that lattice substructures exist in real-word citationnetworks. It is further shown that, through its relations with co-citations and bibliographiccoupling, the diamond (a four-element lattice) is a basic structural element in citation analysis.Finally, citation compactness is calculated for the four- and five element lattices. },
  author = {Yong, Fang and Rousseau, Ronald},
  doi = {10.1023/A:1010573723540},
  interhash = {e9391bc849fa1c37c94f123a42cce4f3},
  intrahash = {3e02f4c97f1e075cb05e13c235cfd875},
  issn = {0138-9130},
  journal = {Scientometrics},
  month = feb,
  number = 2,
  pages = {273--287},
  title = {Lattices in citation networks: An investigation into the structure of citation graphs},
  url = {http://dx.doi.org/10.1023/A:1010573723540},
  volume = 50,
  year = 2001
}

@article{stumme2002computing,
  abstract = {We introduce the notion of iceberg concept lattices and show their use in knowledge discovery in databases. Iceberg lattices are a conceptual clustering method, which is well suited for analyzing very large databases. They also serve as a condensed representation of frequent itemsets, as starting point for computing bases of association rules, and as a visualization method for association rules. Iceberg concept lattices are based on the theory of Formal Concept Analysis, a mathematical theory with applications in data analysis, information retrieval, and knowledge discovery. We present a new algorithm called TITANIC for computing (iceberg) concept lattices. It is based on data mining techniques with a level-wise approach. In fact, TITANIC can be used for a more general problem: Computing arbitrary closure systems when the closure operator comes along with a so-called weight function. The use of weight functions for computing closure systems has not been discussed in the literature up to now. Applications providing such a weight function include association rule mining, functional dependencies in databases, conceptual clustering, and ontology engineering. The algorithm is experimentally evaluated and compared with Ganter's Next-Closure algorithm. The evaluation shows an important gain in efficiency, especially for weakly correlated data.},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},
  doi = {10.1016/S0169-023X(02)00057-5},
  interhash = {d500ac8a249ca8bf0fb05f382799d48f},
  intrahash = {fc31933f0eec502e305b6aecb9ef6e8a},
  issn = {0169-023X},
  journal = {Data \& Knowledge Engineering},
  month = aug,
  number = 2,
  pages = {189--222},
  publisher = {Elsevier Science Publishers B. V.},
  title = {Computing iceberg concept lattices with TITANIC},
  url = {http://portal.acm.org/citation.cfm?id=606457},
  volume = 42,
  year = 2002
}

@article{freeman1993galois,
  abstract = {Galois lattices are introduced as a device to provide a general representation for two mode social network data. It is shown that Galois lattices yield a single visual image of such data in cases where most alternative models produce dual images. The inzage provided by the Galois lattice produces, moreover, an inzage that can suggest useful insights about the structural properties of the data. An example, based on data from Davis, Gardner, and Gardner (1941), is used to spell out in detail the kinds of structural insights that can be gained from this approach. In addition, other potential applications are suggested.},
  author = {Freeman, L.C. and White, D.R.},
  interhash = {8231848d3051b517f6dc33e54e6e76d2},
  intrahash = {50103469c4e839b6f05a522eaacaa3a8},
  journal = {Sociological Methodology},
  pages = {127--146},
  title = {Using Galois Lattices to Represent Network Data},
  url = {http://www.polisci.berkeley.edu/courses/coursepages/Fall2004/ps289/Galois.pdf},
  volume = 23,
  year = 1993
}

@inproceedings{DBLP:conf/iccs/GanterR01,
  author = {Ganter, Bernhard and Rudolph, Sebastian},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {Proceedings of the 9th International Conference on Conceptual Structures (ICCS 2001)},
  crossref = {DBLP:conf/iccs/2001},
  editor = {Delugach, Harry S. and Stumme, Gerd},
  ee = {http://link.springer.de/link/service/series/0558/bibs/2120/21200143.htm},
  interhash = {7e65d75d108c42ac5449e9a0f094cfca},
  intrahash = {a25ab4987c25f31c9c7a69b9925ec8f9},
  isbn = {3-540-42344-3},
  pages = {143-156},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Formal Concept Analysis Methods for Dynamic Conceptual Graphs.},
  volume = 2120,
  year = 2001
}

@inproceedings{wille1982restructuring,
  abstract = {Lattice theory today reflects the general Status of current mathematics: there is a rich production of theoretical concepts, results, and developments, many of which are reached by elaborate mental gymnastics; on the other hand, the connections of the theory to its surroundings are getting weaker and weaker, with the result that the theory and even many of its parts become more isolated. Restructuring lattice theory is an attempt to reinvigorate connections with our general culture by interpreting the theory as concretely as possible, and in this way to promote better communication between lattice theorists and potential users of lattice theory.},
  address = {Dordrecht--Boston},
  author = {Wille, Rudolf},
  booktitle = {Ordered sets},
  editor = {Rival, Ivan},
  interhash = {1e021e8bace9683c92416cd882eb4c4d},
  intrahash = {e43626656aa7d98700fb4572b75bcbb1},
  pages = {445--470},
  publisher = {Reidel},
  title = {Restructuring lattice theory: an approach based on hierarchies of concepts},
  year = { 1982 }
}

@book{birkhoff40,
  address = {Providence, Rhode Island},
  author = {Birkhoff, Garrett},
  edition = {3.},
  interhash = {155513001f337274bb35db352a6a3a02},
  intrahash = {693d3857c685d6eb6c2edfdeb51180f8},
  publisher = {American Mathematical Society},
  series = {American Mathematical Society Colloqium Publi},
  title = {Lattice Theory},
  volume = {XXV},
  year = 1967
}