@inproceedings{jaschke2013attribute,
  abstract = {We propose an approach for supporting attribute exploration by web information retrieval, in particular by posing appropriate queries to search engines, crowd sourcing systems, and the linked open data cloud. We discuss underlying general assumptions for this to work and the degree to which these can be taken for granted.},
  author = {Jäschke, Robert and Rudolph, Sebastian},
  booktitle = {Contributions to the 11th International Conference on Formal Concept Analysis},
  editor = {Cellier, Peggy and Distel, Felix and Ganter, Bernhard},
  interhash = {000ab7b0ae3ecd1d7d6ceb39de5c11d4},
  intrahash = {45e900e280661d775d8da949baee3747},
  month = may,
  organization = {Technische Universität Dresden},
  pages = {19--34},
  title = {Attribute Exploration on the Web},
  url = {http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-113133},
  urn = {urn:nbn:de:bsz:14-qucosa-113133},
  year = 2013
}

@inproceedings{stumme2004iceberg,
  address = {Heidelberg},
  author = {Stumme, Gerd},
  booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
  comment = {alpha},
  editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
  interhash = {5e81311b4e69d49a2f0aa7cd3f52b21d},
  intrahash = {70b05439d41b24c2476e9eba1f74ec87},
  pages = {109-125},
  publisher = {Springer},
  series = {LNCS},
  title = {Iceberg Query Lattices for Datalog},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf},
  volume = 3127,
  year = 2004
}

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

@article{jaeschke08discovering,
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {eb0bdaeab0aa5d4c528c97e2b10770b9},
  journal = {Journal of Web Semantics},
  number = 1,
  pages = {38-53},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://dx.doi.org/10.1016/j.websem.2007.11.004},
  volume = 6,
  year = 2008
}

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

@article{jaeschke2008discovering,
  abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.},
  address = {New York},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Semantic Web and Web 2.0},
  doi = {10.1016/j.websem.2007.11.004},
  editor = {Finin, T. and Mizoguchi, R. and Staab, S.},
  file = {jaeschke2008discovering.pdf:jaeschke2008discovering.pdf:PDF},
  groups = {public},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {18e8babe208fae2c0342438617b0ec31},
  issn = {1570-8268},
  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
  journalpub = {1},
  month = feb,
  number = 1,
  pages = {38--53},
  publisher = {Elsevier},
  timestamp = {2010-11-10 15:35:25},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://www.sciencedirect.com/science/article/B758F-4R53WD4-1/2/ae56bd6e7132074272ca2035be13781b},
  username = {dbenz},
  vgwort = {59},
  volume = 6,
  year = 2008
}

@article{jaeschke2008discovering,
  abstract = {Social bookmarking tools are rapidly emerging on the Web. In such systems users are setting up lightweight conceptual structures called folksonomies. Unlike ontologies, shared conceptualizations are not formalized, but rather implicit. We present a new data mining task, the mining of all frequent tri-concepts, together with an efficient algorithm, for discovering these implicit shared conceptualizations. Our approach extends the data mining task of discovering all closed itemsets to three-dimensional data structures to allow for mining folksonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution. Finally, we show the applicability of our approach on three large real-world examples.},
  address = {New York},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  booktitle = {Semantic Web and Web 2.0},
  doi = {10.1016/j.websem.2007.11.004},
  editor = {Finin, T. and Mizoguchi, R. and Staab, S.},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {18e8babe208fae2c0342438617b0ec31},
  issn = {1570-8268},
  journal = {Web Semantics: Science, Services and Agents on the World Wide Web},
  month = feb,
  number = 1,
  pages = {38--53},
  publisher = {Elsevier},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2008discovering.pdf},
  vgwort = {59},
  volume = 6,
  year = 2008
}

@inproceedings{stumme2004iceberg,
  address = {Heidelberg},
  author = {Stumme, Gerd},
  booktitle = {Conceptual Structures at Work: 12th International Conference on Conceptual Structures (ICCS 2004)},
  comment = {alpha},
  editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
  interhash = {5e81311b4e69d49a2f0aa7cd3f52b21d},
  intrahash = {70b05439d41b24c2476e9eba1f74ec87},
  pages = {109-125},
  publisher = {Springer},
  series = {LNCS},
  title = {Iceberg Query Lattices for Datalog},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf},
  volume = 3127,
  year = 2004
}

@article{jaeschke08discovering,
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  interhash = {cfca594f9dbe30694bfbcdeb40dc4e88},
  intrahash = {eb0bdaeab0aa5d4c528c97e2b10770b9},
  journal = {Journal of Web Semantics},
  number = 1,
  pages = {38-53},
  title = {Discovering Shared Conceptualizations in Folksonomies},
  url = {http://dx.doi.org/10.1016/j.websem.2007.11.004},
  volume = 6,
  year = 2008
}

@proceedings{dau05contributions,
  address = {Kassel},
  booktitle = {Contributions to ICCS 2005},
  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
  interhash = {1d639a4ee220bfb2e4e345921da8f57b},
  intrahash = {922eeab1c4a936636813e44c6b42092e},
  isbn = {3-89958-138-5},
  publisher = {kassel university press},
  title = {Contributions to ICCS 2005},
  url = {http://www.kde.cs.uni-kassel.de/conf/iccs05},
  year = 2005
}

@proceedings{conf/iccs/2005,
  bibsource = {DBLP, http://dblp.uni-trier.de},
  booktitle = {ICCS},
  editor = {Dau, Frithjof and Mugnier, Marie-Laure and Stumme, Gerd},
  interhash = {a8f702ec263f350956e647b7e0b54ee0},
  intrahash = {049a73d0f39efc7d4d988f262911c6f4},
  isbn = {3-540-27783-8},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  title = {Conceptual Structures: Common Semantics for Sharing Knowledge, 13th International Conference on Conceptual Structures, ICCS 2005, Kassel, Germany, July 17-22, 2005, Proceedings},
  url = {http://www.kde.cs.uni-kassel.de/conf/iccs05},
  volume = 3596,
  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
}