@inproceedings{AB:10,
  author = {Atzmueller, Martin and Beer, Stephanie},
  booktitle = {Proc. 55th IWK, International Workshop on Design, Evaluation and Refinement of Intelligent Systems (DERIS)},
  interhash = {7e80a6b45a723165b02d8e33581da64e},
  intrahash = {a735dbe20e7e04c577c3eb4e67ebede2},
  publisher = {University of Ilmenau},
  title = {Validation of Mixed-Structured Data Using Pattern Mining and Information Extraction},
  year = 2010
}

@inproceedings{AR:10b,
  author = {Atzmueller, Martin and Roth-Berghofer, Thomas},
  booktitle = {Proc. Workshop on Explanation-aware Computing ExaCt 2010 @ ECAI 2010},
  interhash = {7dab16aeb2f5567ca898435afde31a4f},
  intrahash = {d958a4e9a180a47b82c279a727ac53a5},
  title = {Towards Explanation-Aware Social Software: Applying the Mining and Analysis Continuum of Explaining},
  year = 2010
}

@inproceedings{AR:10a,
  author = {Atzmueller, Martin and Roth-Berghofer, Thomas},
  booktitle = {Proc. 30th SGAI International Conference on Artificial Intelligence (AI-2010)},
  interhash = {cd60e1435e394de7edde93e76c04795f},
  intrahash = {18d53f93993aff7d941de9df7089bd4b},
  title = {The Mining and Analysis Continuum of Explaining Uncovered},
  year = 2010
}

@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
}