@inproceedings{hotho03ontologies, address = {Melbourne, Florida}, author = {Hotho, Andreas and Staab, Steffen and Stumme, Gerd}, booktitle = {Proceedings of the 2003 IEEE International Conference on Data Mining}, comment = {alpha}, interhash = {b56c36d6d9c9ca9e6bd236a0f92415a5}, intrahash = {57a39c81cff1982dbefed529be934bee}, month = {November 19-22,}, pages = {541-544 (Poster}, publisher = {IEEE {C}omputer {S}ociety}, title = {Ontologies improve text document clustering}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003ontologies.pdf}, year = 2003 } @article{hereth03conceptual, abstract = {In this paper we discuss Conceptual Knowledge Discovery in Databases (CKDD) as it is developing in the field of Conceptual Knowledge Processing. Conceptual Knowledge Processing is based on the mathematical theory of Formal Concept Analysis which has become a successful theory for data analysis during the last two decades. CKDD aims to support a human-centered process of discovering knowledge from data by visualizing and analyzing the conceptual structure of the data. We dicuss how the management system TOSCANA for conceptual information systems supports CKDD, and illustrate it by two applications in database marketing and flight movement analysis. Finally, we present a new tool for conceptual deviation discovery, Chianti.}, author = {Hereth, Joachim and Stumme, Gerd and Wille, Rudolf and Wille, Uta}, comment = {alpha}, interhash = {a9c05101aeb799232425d7651a581684}, intrahash = {edffeb9bd2aaac559f2a6233dd49ae3b}, journal = {Journal of Applied Artificial Intelligence (AAI)}, number = 3, pages = {281-301}, title = {Conceptual Knowledge Discovery - a Human-Centered Approach}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hereth2003conceptual.pdf}, volume = 17, year = 2003 } @techreport{stumme99conceptualknowledge, author = {Stumme, G.}, comment = {alpha}, institution = {TU Darmstadt}, interhash = {c33970150f97bad7972281e38b42738f}, intrahash = {6d562dc043ba698acee8a83ce35bde6e}, 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{bastide00levelwise, address = {France}, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, booktitle = {Actes des 16ièmes Journées Bases de Données Avancées}, comment = {alpha}, interhash = {a3181cc73b190099592107cf465c4e43}, intrahash = {a11de6a74851c7076452159d1b12489b}, month = {Oct 24-27}, pages = {307-322}, publisher = {Blois}, title = {Levelwise Search of Frequent Patterns}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/BDA00.pdf}, year = 2000 } @inproceedings{studer03building, address = {Osaka, Japan}, author = {Studer, Rudi and Stumme, Gerd and Handschuh, Siegfried and Hotho, Andreas and Motik, B.}, booktitle = {New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational}, comment = {alpha}, interhash = {67d164f4a531ddf0f84df0b5de52e80a}, intrahash = {a0e7b52680f1876cdd9cd21f7cb2f95c}, month = {March 10-11,}, pages = {31-34}, title = {Building and Using the Semantic Web}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/Sanken03.pdf}, year = 2003 } @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 } @inproceedings{hotho03wordnet, address = {Toronto}, author = {Hotho, A and Staab, S. and Stumme, G.}, booktitle = {Proc. SIGIR Semantic Web Workshop}, comment = {alpha}, interhash = {c2a9a89ce20cef90a1e78d34dc2c2afe}, intrahash = {04c7d86337d68e4ed9ae637029c43414}, title = {Wordnet improves text document clustering}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2003/hotho2003wordnet.pdf}, year = 2003 } @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 } @inproceedings{stumme02efficient, address = {Heidelberg}, author = {Stumme, G.}, booktitle = {Database and Expert Systems Applications. Proc. DEXA 2002}, editor = {Hameurlain, A. and Cicchetti, R. and Traunmüller, R.}, interhash = {56611a15d60e2711a0aafc257715c03d}, intrahash = {0adce6a0db24566bb55d6e2d6667c8e7}, pages = {534-546}, publisher = {Springer}, series = {LNCS}, title = {Efficient Data Mining Based on Formal Concept Analysis}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2002/DEXA02.pdf}, volume = 2453, year = 2002 } @proceedings{stumme01semantic, address = {Freiburg}, editor = {Stumme, G. and Hotho, A. and Berendt, B.}, interhash = {8e0ea487e66cca158e69263d18d856f8}, intrahash = {ee4f8a6316e6454df268067b4e47f818}, month = {September 3rd,}, title = {Semantic Web Mining. Workshop Proceedings.}, url = {http://semwebmine2001.aifb.uni-karlsruhe.de/online.html}, year = 2001 } @inproceedings{stumme01conceptualclustering, address = {Universität Dortmund 763}, author = {Stumme, G. and Taouil, R. and Bastide, Y. and Lakhal, L.}, 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}, month = {October}, title = {Conceptual Clustering with Iceberg Concept Lattices}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/FGML01.pdf}, year = 2001 } @inproceedings{bastide00miningminimal, address = {Heidelberg}, author = {Bastide, Y. and Pasquier, N. and Taouil, R. and Stumme, G. and Lakhal, L.}, booktitle = {Computational Logic --- CL 2000 Proc. CL'00}, editor = {Lloyd, J. and Dahl, V. and Furbach, U. and Kerber, M. and Laus, K.-K. and Palamidessi, C. and Pereira, L.M. and Sagiv, Y. and Stuckey, P.J.}, interhash = {dc10d0ad3c40463f049ac775cb250f3d}, intrahash = {25fa3431e7bdd7057f9b80a7385cd718}, page = {972-986}, publisher = {Springer}, series = {LNAI}, title = {Mining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/DOOD00.pdf}, volume = 1861, year = 2000 } @article{bastide00miningfrequent, author = {Bastide, Y. and Taouil, R. and Pasquier, N. and Stumme, G. and Lakhal, L.}, interhash = {86c9586115ef1c7ec8539257849d9842}, intrahash = {1e79f8ba76044d2c78cea441eeba84aa}, journal = {SIGKDD Explorations, Special Issue on Scalable Algorithms}, number = 2, pages = {71-80}, title = {Mining Frequent Patterns with Counting Inference.}, volume = 2, year = 2000 } @inproceedings{hereth2000conceptual, address = {Heidelberg}, author = {Hereth, J. and Stumme, G. and Wille, R. and Wille, U.}, booktitle = {Conceptual Structures: Logical, Linguistic, and Computational Issues. Proc. ICCS '00}, editor = {Ganter, B. and Mineau, G. W.}, interhash = {8a4c0c21d83c25bb78f80e89dd36a89a}, intrahash = {577e0f2074bbece17498848014d14705}, page = {{P}art of \cite{hereth03conceptual}}, pages = {421-437}, publisher = {Springer}, series = {LNAI}, title = {Conceptual Knowledge Discovery and Data Analysis}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2000/P2092_ICCS00_kdd.pdf}, volume = 1867, year = 2000 } @inproceedings{stumme01intelligent, address = {Heidelberg}, author = {Stumme, G. and Taouil, R. and Bastide, Y. and Pasquier, N. and Lakhal, L.}, booktitle = {KI 2001: Advances in Artificial Intelligence. KI 2001}, editor = {Baader, F. and Brewker, G. and Eiter, T.}, interhash = {15d7d015c8820a41323ab4e7639ff151}, intrahash = {d93292a7637bd2061b67f4934e7dde46}, pages = {335-350}, publisher = {Springer}, series = {LNAI}, title = {Intelligent Structuring and Reducing of Association Rules and with Formal Concept Analysis}, url = {http://www.kde.cs.uni-kassel.de/stumme/papers/2001/KI01.pdf}, volume = 2174, year = 2001 } @article{wille02why, author = {Wille, Rudolf}, date = {2004-02-13}, ee = {http://taylorandfrancis.metapress.com/openurl.asp?genre=article&issn=0952-813x&volume=14&issue=2&spage=81}, interhash = {c214a68383b61756ff05b64d8098afea}, intrahash = {dd266b193c76d6cb46be6afa3e9396bb}, journal = {J. Exp. Theor. Artif. Intell.}, number = {2-3}, pages = {81-92}, title = {Why can concept lattices support knowledge discovery in databases?}, url = {http://dblp.uni-trier.de/db/journals/jetai/jetai14.html#Wille02}, volume = 14, year = 2002 } @inproceedings{boulicaut00approximation, author = {Boulicaut, Jean-Francois and Bykowski, Artur and Rigotti, Christophe}, booktitle = {Principles of Data Mining and Knowledge Discovery}, interhash = {bcaa8a570d6b987b6171c4b7aff7cacd}, intrahash = {7e53b931a9ba3d36c7536f31901376bf}, pages = {75-85}, title = {Approximation of Frequency Queris by Means of Free-Sets}, url = {citeseer.ist.psu.edu/boulicaut00approximation.html}, year = 2000 }