PUMA publications for /author/Yves%20Bastide/associationhttps://puma.uni-kassel.de/author/Yves%20Bastide/associationPUMA RSS feed for /author/Yves%20Bastide/association2024-03-28T23:04:32+01:00- Efficient mining of association rules using closed itemset latticeshttps://puma.uni-kassel.de/bibtex/2dd4cac14856b487b0819ebe042301d56/stephandoerfelstephandoerfel2015-05-19T19:45:06+02:00association fca rule <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Information Systems</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">24 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">25 - 46</span></em> </span>(<em><span>1999<meta content="1999" itemprop="datePublished"/></span></em>)Tue May 19 19:45:06 CEST 2015Information Systems 125 - 46Efficient mining of association rules using closed itemset lattices 241999association fca rule Discovering association rules is one of the most important task in data mining. Many efficient algorithms have been proposed in the literature. The most noticeable are Apriori, Mannila's algorithm, Partition, Sampling and DIC, that are all based on the Apriori mining method: pruning the subset lattice (itemset lattice). In this paper we propose an efficient algorithm, called Close, based on a new mining method: pruning the closed set lattice (closed itemset lattice). This lattice, which is a sub-order of the subset lattice, is closely related to Wille's concept lattice in formal concept analysis. Experiments comparing Close to an optimized version of Apriori showed that Close is very efficient for mining dense and/or correlated data such as census style data, and performs reasonably well for market basket style data. Efficient mining of association rules using closed itemset lattices
- Generating a Condensed Representation for Association Ruleshttps://puma.uni-kassel.de/bibtex/240f59a7fa7ce5015f9ee81709db89de0/itegiteg2011-11-22T10:26:32+01:00concept discovery 2005 association OntologyHandbook l3s analysis kdd itemset myown rule data knowledge closed formal rules itegpub condensed fca sets representations mining <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gerd Stumme" itemprop="url" href="/author/Gerd%20Stumme"><span itemprop="name">G. Stumme</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Journal Intelligent Information Systems (JIIS)</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">24 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">29-60</span></em> </span>(<em><span>2005<meta content="2005" itemprop="datePublished"/></span></em>)Tue Nov 22 10:26:32 CET 2011Journal Intelligent Information Systems (JIIS)129-60Generating a Condensed Representation for Association Rules242005concept discovery 2005 association OntologyHandbook l3s analysis kdd itemset myown rule data knowledge closed formal rules itegpub condensed fca sets representations mining
- Generating a Condensed Representation for Association Ruleshttps://puma.uni-kassel.de/bibtex/240f59a7fa7ce5015f9ee81709db89de0/stummestumme2010-04-07T13:54:41+02:00concept discovery 2005 association OntologyHandbook l3s analysis kdd itemset myown rule data knowledge closed formal rules itegpub condensed fca sets representations mining <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Gerd Stumme" itemprop="url" href="/author/Gerd%20Stumme"><span itemprop="name">G. Stumme</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/PublicationIssue" itemscope="itemscope" itemprop="isPartOf"><span itemtype="http://schema.org/Periodical" itemscope="itemscope" itemprop="isPartOf"><span itemprop="name"><em>Journal Intelligent Information Systems (JIIS)</em></span></span> <em><span itemtype="http://schema.org/PublicationVolume" itemscope="itemscope" itemprop="isPartOf"><span itemprop="volumeNumber">24 </span></span>(<span itemprop="issueNumber">1</span>):
<span itemprop="pagination">29-60</span></em> </span>(<em><span>2005<meta content="2005" itemprop="datePublished"/></span></em>)Wed Apr 07 13:54:41 CEST 2010Journal Intelligent Information Systems (JIIS)129-60Generating a Condensed Representation for Association Rules242005concept discovery 2005 association OntologyHandbook l3s analysis kdd itemset myown rule data knowledge closed formal rules itegpub condensed fca sets representations mining Publications of Gerd Stumme
- Pruning closed itemset lattices for associations rules.https://puma.uni-kassel.de/bibtex/220dd28b712c5380c17f536734fb1a804/stummestumme2008-03-28T12:11:30+01:00rules closed concept formal association OntologyHandbook FCA analysis fca itemset mining <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Bases de Donn�es Avanc�es</span>, </em></span>(<em><span>1998<meta content="1998" itemprop="datePublished"/></span></em>)Fri Mar 28 12:11:30 CET 2008Bases de Donn�es Avanc�esconf/bda/1998Pruning closed itemset lattices for associations rules.1998rules closed concept formal association OntologyHandbook FCA analysis fca itemset mining
- Pruning closed itemset lattices for associations rules.https://puma.uni-kassel.de/bibtex/22fcd39ace346867762f3e6abe5a35ccb/stummestumme2007-09-05T14:45:38+02:00rules closed concept formal association analysis fca itemset mining <span class="authorEditorList"><span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Nicolas Pasquier" itemprop="url" href="/author/Nicolas%20Pasquier"><span itemprop="name">N. Pasquier</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Yves Bastide" itemprop="url" href="/author/Yves%20Bastide"><span itemprop="name">Y. Bastide</span></a></span>, <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Rafik Taouil" itemprop="url" href="/author/Rafik%20Taouil"><span itemprop="name">R. Taouil</span></a></span>, und <span itemtype="http://schema.org/Person" itemscope="itemscope" itemprop="author"><a title="Lotfi Lakhal" itemprop="url" href="/author/Lotfi%20Lakhal"><span itemprop="name">L. Lakhal</span></a></span>. </span><span itemtype="http://schema.org/Book" itemscope="itemscope" itemprop="isPartOf"><em><span itemprop="name">Bases de Données Avancées</span>, </em></span>(<em><span>1998<meta content="1998" itemprop="datePublished"/></span></em>)Wed Sep 05 14:45:38 CEST 2007Bases de Données Avancéesconf/bda/1998Pruning closed itemset lattices for associations rules.1998rules closed concept formal association analysis fca itemset mining