http://www.bibsonomy.org/burst/user/stumme/dataBibSonomy BuRST Feed for /user/stumme/data2008-07-21T01:34:04+02:00http://www.bibsonomy.org/bibtex/209244927cabf900accd89964a28c41de/stummestumme2006-11-07T16:33:48+01:00systems formal lattices tu information 1997 analysis fba relational scaling formale myown conceptual darmstadt fca forschungsgruppe begriffsanalyse concept databases ag1 data <span style="color:#555555;">Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and Karl Erich <a href="http://www.bibsonomy.org/author/Wolff">Wolff</a> </span><em>Proc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for Efficiency, </em><em>page206-219. </em><em>Vancouver, Canada, </em><em>Aug 11-131997. </em>Tue Nov 07 16:33:48 CET 2006Vancouver, CanadaProc. Intl. Symposium on Knowledge Retrieval, Use, and Storage for EfficiencyAug 11-13206-219Computing in Conceptual Data systems with relational structures1997systems formal lattices tu information 1997 analysis fba relational scaling formale myown conceptual darmstadt fca forschungsgruppe begriffsanalyse concept databases ag1 data http://www.bibsonomy.org/bibtex/204c7d86337d68e4ed9ae637029c43414/stummestumme2006-09-21T16:23:46+02:00ir information myown kmeans discovery clustering knowledge mining text kdd wordnet data 2003 document retrieval <span style="color:#555555;">A <a href="http://www.bibsonomy.org/author/Hotho">Hotho</a> and S. <a href="http://www.bibsonomy.org/author/Staab">Staab</a> and G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>Proc. SIGIR Semantic Web Workshop, </em><em>Toronto, </em>(<em>2003</em>)Thu Sep 21 16:23:46 CEST 2006TorontoProc. SIGIR Semantic Web WorkshopWordnet improves text document clustering2003ir information myown kmeans discovery clustering knowledge mining text kdd wordnet data 2003 document retrieval http://www.bibsonomy.org/bibtex/240f59a7fa7ce5015f9ee81709db89de0/stummestumme2006-09-21T15:43:37+02:00sets OntologyHandbook itemset rule knowledge mining fca formal closed concept rules l3s association analysis data representations 2005 discovery kdd myown condensed <span style="color:#555555;">Nicolas <a href="http://www.bibsonomy.org/author/Pasquier">Pasquier</a> and Rafik <a href="http://www.bibsonomy.org/author/Taouil">Taouil</a> and Yves <a href="http://www.bibsonomy.org/author/Bastide">Bastide</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and Lotfi <a href="http://www.bibsonomy.org/author/Lakhal">Lakhal</a> </span><em>Journal Intelligent Information Systems (JIIS)</em><em>24(1):29-60</em>(<em>2005</em>)Thu Sep 21 15:43:37 CEST 2006Journal Intelligent Information Systems (JIIS)129-60Generating a Condensed Representation for Association Rules242005sets OntologyHandbook itemset rule knowledge mining fca formal closed concept rules l3s association analysis data representations 2005 discovery kdd myown condensed http://www.bibsonomy.org/bibtex/2a0e7b52680f1876cdd9cd21f7cb2f95c/stummestumme2006-09-21T15:29:47+02:00ontologies web 2003 myown kdd semantic data mining <span style="color:#555555;">Rudi <a href="http://www.bibsonomy.org/author/Studer">Studer</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and Siegfried <a href="http://www.bibsonomy.org/author/Handschuh">Handschuh</a> and Andreas <a href="http://www.bibsonomy.org/author/Hotho">Hotho</a> and B. <a href="http://www.bibsonomy.org/author/Motik">Motik</a> </span><em>New Trends in Knowledge Processing -- Data Mining, Semantic Web and Computational, </em><em>page31-34. </em><em>Osaka, Japan, </em><em>March 10-11,2003. </em>Thu Sep 21 15:29:47 CEST 2006Osaka, JapanNew Trends in Knowledge Processing -- Data Mining, Semantic Web and ComputationalMarch 10-11,31-34Building and Using the Semantic Web2003ontologies web 2003 myown kdd semantic data mining http://www.bibsonomy.org/bibtex/2a11de6a74851c7076452159d1b12489b/stummestumme2006-09-21T15:28:15+02:00condensed formal data fca itemsets knowledge concept kdd algorithm discovery algorithms analysis myown representations mining 2000 frequent association rules closed <span style="color:#555555;">Y. <a href="http://www.bibsonomy.org/author/Bastide">Bastide</a> and R. <a href="http://www.bibsonomy.org/author/Taouil">Taouil</a> and N. <a href="http://www.bibsonomy.org/author/Pasquier">Pasquier</a> and G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and L. <a href="http://www.bibsonomy.org/author/Lakhal">Lakhal</a> </span><em>Actes des 16i&#232;mes Journ&#233;es Bases de Donn&#233;es Avanc&#233;es, </em><em>page307-322. </em><em>France, </em><em>Blois, </em><em>Oct 24-272000. </em>Thu Sep 21 15:28:15 CEST 2006FranceActes des 16ièmes Journées Bases de Données AvancéesOct 24-27307-322Levelwise Search of Frequent Patterns2000condensed formal data fca itemsets knowledge concept kdd algorithm discovery algorithms analysis myown representations mining 2000 frequent association rules closed http://www.bibsonomy.org/bibtex/2d83a44b00abdeb6699f25c2652b51b84/stummestumme2006-09-21T15:27:05+02:00analysis data olap formal 2000 myown fca conceptual concept <span style="color:#555555;">G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>Information Organization and Databases, </em><em>chapter 14, </em><em>Kluwer, </em><em>Boston-Dordrecht-London, </em>(<em>2000</em>)Thu Sep 21 15:27:05 CEST 2006Boston-Dordrecht-LondonInformation Organization and Databases14191-203Conceptual {O}n-{L}ine {A}nalytical {P}rocessing2000analysis data olap formal 2000 myown fca conceptual concept http://www.bibsonomy.org/bibtex/26d562dc043ba698acee8a83ce35bde6e/stummestumme2006-09-20T19:42:33+02:00data condensed association iceberg analysis lattices myown formal knowledge rule frequent rules fca 1999 mining representations concept discovery itemsets kdd closed <span style="color:#555555;">G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>FB4-Preprint 2043, </em><em>TU Darmstadt, </em>(<em>1999</em>)Wed Sep 20 19:42:33 CEST 2006Conceptual Knowledge Discovery with Frequent Concept Lattices{FB}4-{P}reprint 20431999data condensed association iceberg analysis lattices myown formal knowledge rule frequent rules fca 1999 mining representations concept discovery itemsets kdd closed http://www.bibsonomy.org/bibtex/20ddc3bd8b6a99ac8da2c693e1416000c/stummestumme2006-09-20T19:32:15+02:00rule fca myown frequent discovery kdd data representations formal mining representation knowledge closed condensed 2000 association analys rules itemsets concept <span style="color:#555555;">Y. <a href="http://www.bibsonomy.org/author/Bastide">Bastide</a> and R. <a href="http://www.bibsonomy.org/author/Taouil">Taouil</a> and N. <a href="http://www.bibsonomy.org/author/Pasquier">Pasquier</a> and G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and L. <a href="http://www.bibsonomy.org/author/Lakhal">Lakhal</a> </span><em>SIGKDD Explorations 2(2), Special Issue on Scalable Algorithms</em>(<em>2000</em>) <em>Short version of citebastide02unalogorithme . </em>Wed Sep 20 19:32:15 CEST 2006SIGKDD Explorations 2(2), Special Issue on Scalable AlgorithmsShort version of \cite{bastide02unalogorithme}71-80Mining Frequent Patterns with Counting Inference2000rule fca myown frequent discovery kdd data representations formal mining representation knowledge closed condensed 2000 association analys rules itemsets concept http://www.bibsonomy.org/bibtex/225fa3431e7bdd7057f9b80a7385cd718/stummestumme2006-09-20T19:31:53+02:00rules itemsets rule discovery representation knowledge fca analys concept formal data mining closed frequent kdd condensed 2000 myown association representations <span style="color:#555555;">Y. <a href="http://www.bibsonomy.org/author/Bastide">Bastide</a> and N. <a href="http://www.bibsonomy.org/author/Pasquier">Pasquier</a> and R. <a href="http://www.bibsonomy.org/author/Taouil">Taouil</a> and G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> and L. <a href="http://www.bibsonomy.org/author/Lakhal">Lakhal</a> </span><em>Computational Logic --- CL 2000 Proc. CL'00, </em><em>volume1861ofLNAI, </em><em>Heidelberg, </em><em>Springer, </em>(<em>2000</em>) <em>Part of citepasquierinpressgenerating . </em>Wed Sep 20 19:31:53 CEST 2006HeidelbergComputational Logic --- CL 2000 Proc. CL'00{P}art of \cite{pasquierinpressgenerating}LNAIMining Minimal Non-Redundant Association Rules Using Frequent Closed Itemsets18612000rules itemsets rule discovery representation knowledge fca analys concept formal data mining closed frequent kdd condensed 2000 myown association representations http://www.bibsonomy.org/bibtex/22b350f817428e4c6c7259cd279815091/stummestumme2006-09-20T19:21:48+02:00myown concept association rules l3s discovery analysis fca mining itemsets condensed representations 2005 book knowledge data formal closed kdd <span style="color:#555555;">Lotfi <a href="http://www.bibsonomy.org/author/Lakhal">Lakhal</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>volume3626ofLNAI, </em><em>page180-195. </em><em>Springer, </em><em>Heidelberg, </em>(<em>2005</em>) <em>http://www.springerlink.com/content/31aa2gtve59x3jh1/ . </em>Wed Sep 20 19:21:48 CEST 2006HeidelbergFormal Concept Analysis: Foundations and Applicationshttp://www.springerlink.com/content/31aa2gtve59x3jh1/180-195LNAIEfficient Mining of Association Rules Based on Formal Concept Analysis36262005myown concept association rules l3s discovery analysis fca mining itemsets condensed representations 2005 book knowledge data formal closed kdd 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.http://www.bibsonomy.org/bibtex/20adce6a0db24566bb55d6e2d6667c8e7/stummestumme2006-09-20T19:20:59+02:00closed condensed 2002 itemsets myown association discovery knowledge representations fca rules kdd mining data <span style="color:#555555;">G. <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>Database and Expert Systems Applications. Proc. DEXA 2002, </em><em>volume2453ofLNCS, </em><em>page534-546. </em><em>Heidelberg, </em><em>Springer, </em>(<em>2002</em>) <em>Invited Talk, summary of citestumme02computing and citepasquierinpressgenerating . </em>Wed Sep 20 19:20:59 CEST 2006HeidelbergDatabase and Expert Systems Applications. Proc. DEXA 2002Invited Talk, summary of \cite{stumme02computing} and \cite{pasquierinpressgenerating}534-546LNCSEfficient Data Mining Based on Formal Concept Analysis24532002closed condensed 2002 itemsets myown association discovery knowledge representations fca rules kdd mining data http://www.bibsonomy.org/bibtex/257a39c81cff1982dbefed529be934bee/stummestumme2006-09-18T21:43:24+02:00myown text data clustering kdd ontologies 2003 mining <span style="color:#555555;">Andreas <a href="http://www.bibsonomy.org/author/Hotho">Hotho</a> and Steffen <a href="http://www.bibsonomy.org/author/Staab">Staab</a> and Gerd <a href="http://www.bibsonomy.org/author/Stumme">Stumme</a> </span><em>Proceedings of the 2003 IEEE International Conference on Data Mining, </em><em>page541-544 (Poster. </em><em>Melbourne, Florida, </em><em>IEEE Computer Society, </em><em>November 19-22,2003. </em>Mon Sep 18 21:43:24 CEST 2006Melbourne, FloridaProceedings of the 2003 IEEE International Conference on Data MiningNovember 19-22,541-544 (PosterOntologies improve text document clustering2003myown text data clustering kdd ontologies 2003 mining http://www.bibsonomy.org/bibtex/2b60dbc902a2e19877aec154fa5747751/stummestumme2006-09-13T16:17:47+02:00ir Retrieval mining data lecture Information Web Mining information standard Data <span style="color:#555555;">Reginald <a href="http://www.bibsonomy.org/author/Ferber">Ferber</a> </span><em>dpunkt Verlag, </em><em>Heidelberg, </em>(<em>2003</em>)Wed Sep 13 16:17:47 CEST 2006HeidelbergInformation Retrieval: Suchmodelle und Data-Mining-Verfahren für Textsammlungen und das Web2003ir Retrieval mining data lecture Information Web Mining information standard Data