@inproceedings{jaeschke2006trias,
  abstract = {In this paper, we present the foundations for mining frequent tri-concepts, which extend the notion of closed itemsets to three-dimensional data to allow for mining folk-sonomies. We provide a formal definition of the problem, and present an efficient algorithm for its solution as well as experimental results on a large real-world example.},
  added-at = {2011-01-27T12:14:52.000+0100},
  address = {Washington, DC, USA},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/2797d40e05a48f4343d7695dac87b5870/jaeschke},
  booktitle = {ICDM '06: Proceedings of the Sixth International Conference on Data Mining},
  doi = {10.1109/ICDM.2006.162},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {797d40e05a48f4343d7695dac87b5870},
  isbn = {0-7695-2701-9},
  keywords = {2006 fca iceberg myown ol_tut2010 triadic trias},
  pages = {907--911},
  publisher = {IEEE Computer Society},
  timestamp = {2011-01-27T12:14:52.000+0100},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  url = {http://www.kde.cs.uni-kassel.de/pub/pdf/jaeschke2006trias.pdf},
  year = 2006
}

@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.},
  added-at = {2011-01-19T15:17:53.000+0100},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},
  biburl = {http://www.bibsonomy.org/bibtex/2fc31933f0eec502e305b6aecb9ef6e8a/sdo},
  doi = {10.1016/S0169-023X(02)00057-5},
  interhash = {d500ac8a249ca8bf0fb05f382799d48f},
  intrahash = {fc31933f0eec502e305b6aecb9ef6e8a},
  issn = {0169-023X},
  journal = {Data & Knowledge Engineering},
  keywords = {computing concept fca iceberg kdd titanic},
  month = aug,
  number = 2,
  pages = {189--222},
  publisher = {Elsevier Science Publishers B. V.},
  timestamp = {2011-01-19T15:17:53.000+0100},
  title = {Computing iceberg concept lattices with TITANIC},
  url = {http://portal.acm.org/citation.cfm?id=606457},
  volume = 42,
  year = 2002
}

@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.},
  added-at = {2010-06-30T09:35:22.000+0200},
  address = {Amsterdam, The Netherlands, The Netherlands},
  author = {Stumme, Gerd and Taouil, Rafik and Bastide, Yves and Pasquier, Nicolas and Lakhal, Lotfi},
  biburl = {http://www.bibsonomy.org/bibtex/2fc31933f0eec502e305b6aecb9ef6e8a/jaeschke},
  doi = {10.1016/S0169-023X(02)00057-5},
  interhash = {d500ac8a249ca8bf0fb05f382799d48f},
  intrahash = {fc31933f0eec502e305b6aecb9ef6e8a},
  issn = {0169-023X},
  journal = {Data \& Knowledge Engineering},
  keywords = {analysis concept fca formal iceberg lattice titanic},
  month = aug,
  number = 2,
  pages = {189--222},
  publisher = {Elsevier Science Publishers B. V.},
  timestamp = {2010-06-30T09:35:22.000+0200},
  title = {Computing iceberg concept lattices with TITANIC},
  url = {http://portal.acm.org/citation.cfm?id=606457},
  volume = 42,
  year = 2002
}

@inproceedings{stumme01conceptualclustering,
  added-at = {2009-07-03T00:19:24.000+0200},
  address = {Universität Dortmund 763},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2f4ec21d5f63dbc213a3a6eae076c4b62/stumme},
  booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
  editor = {Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.},
  interhash = {c99f2ae002435208c58f9244d298a10b},
  intrahash = {f4ec21d5f63dbc213a3a6eae076c4b62},
  keywords = {2001 analysis closed clustering concept conceptual discovery fca formal iceberg itemsets kdd knowledge lattices myown},
  month = {October},
  timestamp = {2009-07-03T00:19:24.000+0200},
  title = {Conceptual  Clustering  with  Iceberg  Concept Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf},
  year = 2001
}

@inproceedings{jaeschke06trias,
  added-at = {2009-03-02T21:40:27.000+0100},
  address = {Hong Kong},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/2e387c294129e11f4221514d5fa807e26/stumme},
  booktitle = {Proceedings of the 6th IEEE International Conference on Data Mining     (ICDM 06)},
  doi = {http://doi.ieeecomputersociety.org/10.1109/ICDM.2006.162},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {e387c294129e11f4221514d5fa807e26},
  isbn = {0-7695-2701-9},
  issn = {1550-4786},
  keywords = {2006 FCA OntologyHandbook algorithm analysis concept fca folksonomies folksonomy formal iceberg itegpub lattices myown nepomuk tagging tri triadic trias},
  month = {December},
  pages = {907-911},
  publisher = {IEEE Computer Society},
  timestamp = {2009-03-02T21:40:27.000+0100},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2006/jaeschke2006trias.pdf},
  vgwort = {19},
  year = 2006
}

@article{stumme02computing,
  added-at = {2008-03-27T15:28:26.000+0100},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2a590bd9ffa84e218d2d78c36feea9e1d/stumme},
  comment = {alpha},
  interhash = {5d7f2955cda84c348e5224c929829823},
  intrahash = {a590bd9ffa84e218d2d78c36feea9e1d},
  journal = {{J.} Data and KnowledgeEngineering (DKE)},
  keywords = {2002 analysis closed concept fca formal iceberg itemsets lattices myown titanic},
  number = 2,
  pages = {189-222},
  timestamp = {2008-03-27T15:28:26.000+0100},
  title = {Computing Iceberg Concept Lattices with {Titanic}},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/stumme2002computing.pdf},
  volume = 42,
  year = 2002
}

@inproceedings{DBLP:conf/iccs/Stumme04,
  added-at = {2007-08-02T10:26:58.000+0200},
  author = {Stumme, Gerd},
  bibsource = {DBLP, http://dblp.uni-trier.de},
  biburl = {http://www.bibsonomy.org/bibtex/24d02913280a822b25c2889621fa3987d/iccs},
  booktitle = {Proceedings of the 12th International Conference on Conceptual Structures (ICCS 2004)},
  crossref = {DBLP:conf/iccs/2004},
  editor = {Wolff, Karl Erich and Pfeiffer, Heather D. and Delugach, Harry S.},
  ee = {http://springerlink.metapress.com/openurl.asp?genre=article{\&}issn=0302-9743{\&}volume=3127{\&}spage=109},
  interhash = {5e81311b4e69d49a2f0aa7cd3f52b21d},
  intrahash = {4d02913280a822b25c2889621fa3987d},
  isbn = {3-540-22392-4},
  keywords = {2004 analysis concept datalog fca formal iccs iceberg lattice},
  pages = {109-125},
  publisher = {Springer},
  series = {Lecture Notes in Computer Science},
  timestamp = {2007-08-02T10:26:58.000+0200},
  title = {Iceberg Query Lattices for Datalog.},
  volume = 3127,
  year = 2004
}

@inproceedings{jaeschke2006trias,
  added-at = {2006-11-17T08:46:17.000+0100},
  address = {Hong Kong},
  author = {Jäschke, Robert and Hotho, Andreas and Schmitz, Christoph and Ganter, Bernhard and Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/226ff196335caf137b1862d050bc1c515/grahl},
  interhash = {b4964c3bdd2991a80873d7080ef6a73e},
  intrahash = {26ff196335caf137b1862d050bc1c515},
  journal = {Proc. 6th ICDM conference},
  keywords = {algorithm analysis concept fca folksonomy formal iceberg lattices nepomuk tagging triadic trias},
  month = {December},
  note = {(to appear)},
  timestamp = {2006-11-17T08:46:17.000+0100},
  title = {TRIAS - An Algorithm for Mining Iceberg Tri-Lattices},
  year = 2006
}

@article{stumme02computing,
  added-at = {2006-11-17T08:45:54.000+0100},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/29e173344e960e124e6226df64b6ea237/grahl},
  comment = {alpha},
  interhash = {5d7f2955cda84c348e5224c929829823},
  intrahash = {9e173344e960e124e6226df64b6ea237},
  journal = {{J.} Knowledge and Data Engineering (KDE)},
  keywords = {analysis closed concept fca formal iceberg itemset lattices titanic},
  number = 2,
  pages = {189-222},
  timestamp = {2006-11-17T08:45:54.000+0100},
  title = {Computing Iceberg Concept Lattices with {Titanic}},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/stumme2002computing.pdf},
  volume = 42,
  year = 2002
}

@article{bastide02unalogorithme,
  added-at = {2006-11-17T08:45:54.000+0100},
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2494ab134ddccac2af4a1d4a7cb52a78d/grahl},
  comment = {alpha},
  interhash = {57813a40a2892bdbdae79116ce2f9d5a},
  intrahash = {494ab134ddccac2af4a1d4a7cb52a78d},
  journal = {Technique et Science Informatiques (TSI)},
  keywords = {analysis association closed concept condensed fca formal iceberg itemset lattices pascal representation rule titanic},
  number = 1,
  pages = {65-95},
  timestamp = {2006-11-17T08:45:54.000+0100},
  title = {Pascal: un alogorithme d'extraction des motifs fréquents},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf},
  volume = 21,
  year = 2002
}

@inproceedings{stumme01conceptualclustering,
  added-at = {2006-11-17T08:45:47.000+0100},
  address = {Universität Dortmund 763},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2f4ec21d5f63dbc213a3a6eae076c4b62/grahl},
  booktitle = {Proc. GI-Fachgruppentreffen Maschinelles Lernen (FGML'01)},
  comment = {alpha},
  editor = {Klinkenberg, R. and Rüping, S. and Fick, A. and Henze, N. and Herzog, C. and Molitor, R. and Schröder, O.},
  interhash = {c99f2ae002435208c58f9244d298a10b},
  intrahash = {f4ec21d5f63dbc213a3a6eae076c4b62},
  keywords = {analysis closed clustering concept conceptual discovery fca formal iceberg itemset kdd knowledge lattices},
  month = {October},
  note = {{P}art of \cite{stumme02computing}},
  timestamp = {2006-11-17T08:45:47.000+0100},
  title = {Conceptual  Clustering  with  Iceberg  Concept Lattices},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf},
  year = 2001
}

@inproceedings{stumme00fast,
  added-at = {2006-11-17T08:45:35.000+0100},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2dcfad94fb256027fbe41150d5ca35d5f/grahl},
  booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
  comment = {alpha},
  editor = {Bouzeghoub, M. and Klusch, M. and Nutt, W. and Sattler, U.},
  interhash = {12f70b6e4c9bd5fbbec7aea5aba76a89},
  intrahash = {dcfad94fb256027fbe41150d5ca35d5f},
  keywords = {algorithm analysis closed computation concept condensed fca formal iceberg itemset lattices representation},
  note = {\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}},
  timestamp = {2006-11-17T08:45:35.000+0100},
  title = {Fast Computation of Concept Lattices Using Data Mining Techniques},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf},
  year = 2000
}

@techreport{stumme99conceptualknowledge,
  added-at = {2006-11-17T08:45:28.000+0100},
  author = {Stumme, G.},
  biburl = {http://www.bibsonomy.org/bibtex/26d562dc043ba698acee8a83ce35bde6e/grahl},
  comment = {alpha},
  institution = {TU Darmstadt},
  interhash = {c33970150f97bad7972281e38b42738f},
  intrahash = {6d562dc043ba698acee8a83ce35bde6e},
  keywords = {analysis association closed concept condensed data-mining discovery fca formal frequent iceberg itemset kdd knowledge lattices representation rule},
  timestamp = {2006-11-17T08:45:28.000+0100},
  title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},
  type = {{FB}4-{P}reprint 2043},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf},
  year = 1999
}

@techreport{stumme99conceptualknowledge,
  added-at = {2006-09-20T19:42:33.000+0200},
  author = {Stumme, G.},
  biburl = {http://www.bibsonomy.org/bibtex/26d562dc043ba698acee8a83ce35bde6e/stumme},
  comment = {alpha},
  institution = {TU Darmstadt},
  interhash = {c33970150f97bad7972281e38b42738f},
  intrahash = {6d562dc043ba698acee8a83ce35bde6e},
  keywords = {frequent discovery formal rules concept knowledge condensed association iceberg kdd mining itemsets lattices analysis 1999 rule myown representations data closed fca},
  timestamp = {2006-09-20T19:42:33.000+0200},
  title = {Conceptual Knowledge Discovery with Frequent Concept Lattices},
  type = {{FB}4-{P}reprint 2043},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/1999/P2043.pdf},
  year = 1999
}

@inproceedings{stumme00fast,
  added-at = {2006-09-20T19:25:10.000+0200},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2dcfad94fb256027fbe41150d5ca35d5f/stumme},
  booktitle = {Proc. 7th Intl. Workshop on Knowledge Representation Meets Databases},
  comment = {alpha},
  editor = {Bouzeghoub, M. and Klusch, M. and Nutt, W. and Sattler, U.},
  interhash = {12f70b6e4c9bd5fbbec7aea5aba76a89},
  intrahash = {dcfad94fb256027fbe41150d5ca35d5f},
  keywords = {computation formal concept condensed 2000 iceberg itemsets algorithm lattices analysis myown representations closed algorithms fca},
  note = {\url{http://ceur-ws.org/Vol-29.} {P}art of \cite{stumme02computing}},
  timestamp = {2006-09-20T19:25:10.000+0200},
  title = {Fast Computation of Concept Lattices Using Data Mining Techniques},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/KRDB00.pdf},
  year = 2000
}

@article{bastide02unalogorithme,
  added-at = {2006-09-20T19:20:19.000+0200},
  author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.},
  biburl = {http://www.bibsonomy.org/bibtex/2494ab134ddccac2af4a1d4a7cb52a78d/stumme},
  comment = {alpha},
  interhash = {57813a40a2892bdbdae79116ce2f9d5a},
  intrahash = {494ab134ddccac2af4a1d4a7cb52a78d},
  journal = {Technique et Science Informatiques (TSI)},
  keywords = {formal rules concept condensed iceberg association itemsets lattices analysis pascal myown representations closed 2002 titanic fca},
  number = 1,
  pages = {65-95},
  timestamp = {2006-09-20T19:20:19.000+0200},
  title = {Pascal: un alogorithme d'extraction des motifs fréquents},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/TSI01.pdf},
  volume = 21,
  year = 2002
}

@inproceedings{stumme2004iceberg,
  added-at = {2006-09-18T21:04:23.000+0200},
  address = {Heidelberg},
  author = {Stumme, Gerd},
  biburl = {http://www.bibsonomy.org/bibtex/270b05439d41b24c2476e9eba1f74ec87/stumme},
  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},
  keywords = {2004 analysis concept datalog fca formal iceberg itegpub l3s lattices myown queries query},
  pages = {109-125},
  publisher = {Springer},
  series = {LNCS},
  timestamp = {2006-09-18T21:04:23.000+0200},
  title = {Iceberg Query Lattices for Datalog},
  url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2004/stumme2004iceberg.pdf},
  volume = 3127,
  year = 2004
}

@inproceedings{stumme2004iceberg,
  added-at = {2006-02-02T17:47:46.000+0100},
  address = {Heidelberg},
  author = {Stumme, G.},
  biburl = {http://www.bibsonomy.org/bibtex/2d4f2156834bf606730140c08e092aa0d/prolearn},
  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 = {d4f2156834bf606730140c08e092aa0d},
  keywords = {kde query 2004 datalog watchdog iceberg kassel prolearn lattices},
  pages = {109-125},
  publisher = {Springer},
  series = {LNCS},
  timestamp = {2006-02-02T17:47:46.000+0100},
  title = {Iceberg Query Lattices for Datalog},
  volume = 3127,
  year = 2004
}

@article{STBPL01,
  added-at = {2005-12-20T20:21:42.000+0100},
  author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasqier, N. and Lakhal, L.},
  bb-further-address = {--Dordrecht--London},
  biburl = {http://www.bibsonomy.org/bibtex/254a98970c6aad7936e6f246b3cc414a7/hotho},
  interhash = {5d7f2955cda84c348e5224c929829823},
  intrahash = {54a98970c6aad7936e6f246b3cc414a7},
  journal = {J. on Knowledge and Data Engineering},
  keywords = {computing concept iceberg lattices titanic},
  number = 2,
  pages = {189--222},
  timestamp = {2005-12-20T20:21:42.000+0100},
  title = {Computing Iceberg Concept Lattices with Titanic},
  volume = 42,
  year = 2002
}