@incollection{cimiano2004conceptual,
  address = {Berlin/Heidelberg},
  author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
  booktitle = {Concept Lattices},
  editor = {Eklund, Peter},
  interhash = {e42d9895b0d816f231227f1be15b03dc},
  intrahash = {9676ee1ded2b73fa90253a2a5dccdbf8},
  isbn = {978-3-540-21043-6},
  pages = {189--207},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Conceptual Knowledge Processing with Formal Concept
                   Analysis and Ontologies},
  url = {http://dx.doi.org/10.1007/978-3-540-24651-0_18},
  volume = 2961,
  year = 2004
}

@inproceedings{cimiano2004concept,
  abstract = {Among many other knowledge representations formalisms, Ontologies
and Formal Concept Analysis (FCA) aim at modeling 'concepts'. We
discuss how these two formalisms may complement another from an
application point of view. In particular, we will see how FCA can
be used to support Ontology Engineering, and how ontologies can be
exploited in FCA applications. The interplay of FCA and ontologies
is studied along the life cycle of an ontology:
 (i) FCA can support the building of the ontology as a
 learning technique.
 (ii) The established ontology can be analyzed and navigated by
 using techniques of FCA.
 (iii) Last but not least, the ontology may be used to improve an FCA
 application.},
  address = {Heidelberg},
  author = {Cimiano, Philipp and Hotho, Andreas and Stumme, Gerd and Tane, Julien},
  booktitle = {Concept Lattices},
  editor = {Eklund, Peter},
  interhash = {e42d9895b0d816f231227f1be15b03dc},
  intrahash = {062d956cd265215f53fdc7b8401b7f15},
  isbn = {3-540-23258-3},
  organization = {Second International Conference on Formal Concept Analysis, ICFCA 2004},
  pages = {189-207},
  publisher = {Springer},
  series = {LNAI},
  title = {Conceptual Knowledge Processing with Formal Concept Analysis and Ontologies},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/cimiano2004concept.pdf},
  volume = 2961,
  year = 2004
}

@inproceedings{stumme05conceptual,
  address = {Trondheim},
  author = {Stumme, Gerd},
  booktitle = {Ontologies-based techniques for DataBases and Information Systems},
  editor = {Collard, Martine and Cavarero, Jean-Louis},
  interhash = {946495ceddb971b4c276e1d1581eaf59},
  intrahash = {c0fef31a406a9e305ea459d24af29e0d},
  pages = 5,
  title = {Conceptual Knowledge Processing (Invited Talk)},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/stumme2005some_slides.pdf},
  year = 2005
}

@article{pasquier2005generating,
  author = {Pasquier, Nicolas and Taouil, Rafik and Bastide, Yves and Stumme, Gerd and Lakhal, Lotfi},
  comment = {alpha},
  interhash = {cb0ee99fae39f2a5e0af5be9d97978f5},
  intrahash = {40f59a7fa7ce5015f9ee81709db89de0},
  journal = {Journal Intelligent Information Systems (JIIS)},
  number = 1,
  pages = {29-60},
  publisher = {Kluwer Academic Publishers},
  title = {Generating a Condensed Representation for Association Rules},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/pasquier2005generating.pdf},
  volume = 24,
  year = 2005
}

@inbook{lakhal2005efficient,
  abstract = {Association rules are a popular knowledge discovery technique for
warehouse basket analysis. They indicate which items of the
warehouse are frequently bought together. The problem of association
rule mining has first been stated in 1993. Five years later, several
research groups discovered that this problem has a strong connection
to Formal Concept Analysis (FCA). In this survey, we will first
introduce some basic ideas of this connection along a specific
algorithm, \titanic, and show how FCA helps in reducing the number
of resulting rules without loss of information, before giving a
general overview over the history and state of the art of applying
FCA for association rule mining.},
  address = {Heidelberg},
  author = {Lakhal, Lotfi and Stumme, Gerd},
  booktitle = {Formal Concept Analysis: Foundations and Applications},
  editor = {Ganter, Bernhard and Stumme, Gerd and Wille, Rudolf},
  ee = {http://dx.doi.org/10.1007/11528784_10},
  interhash = {f5777a0f9dccfcf4f9968119d77297fc},
  intrahash = {2b350f817428e4c6c7259cd279815091},
  pages = {180-195},
  publisher = {Springer},
  series = {LNAI},
  title = {Efficient Mining of Association Rules Based on Formal Concept Analysis},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2005/lakhal2005efficient.pdf},
  volume = 3626,
  year = 2005
}