Efficient Vertical Mining of Frequent Closed Itemsets and Generators
Identifieur interne : 003E02 ( Main/Merge ); précédent : 003E01; suivant : 003E03Efficient Vertical Mining of Frequent Closed Itemsets and Generators
Auteurs : Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France]Source :
English descriptors
- mix :
Abstract
The effective construction of many association rule bases require the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, these two tasks are rarely combined. Most of the existing solutions apply levelwise breadth-first traversal, though depth-first traversal is knowingly superior. Hence, we address here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one called Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.
Url:
Links toward previous steps (curation, corpus...)
- to stream Hal, to step Corpus: 001E86
- to stream Hal, to step Curation: 001E86
- to stream Hal, to step Checkpoint: 002F63
Links to Exploration step
Hal:inria-00371193Le document en format XML
<record><TEI><teiHeader><fileDesc><titleStmt><title xml:lang="en">Efficient Vertical Mining of Frequent Closed Itemsets and Generators</title>
<author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-74129" status="VALID"><orgName>Laboratory for Research on Technology for ECommerce</orgName>
<orgName type="acronym">LATECE Laboratory - UQAM Montreal</orgName>
<desc><address><addrLine>Département d'informatique Université du Québec à Montréal 201 President Kennedy Montreal (Québec) H2X 3Y7</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.latece.uqam.ca/index.html</ref>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-74129" status="VALID"><orgName>Laboratory for Research on Technology for ECommerce</orgName>
<orgName type="acronym">LATECE Laboratory - UQAM Montreal</orgName>
<desc><address><addrLine>Département d'informatique Université du Québec à Montréal 201 President Kennedy Montreal (Québec) H2X 3Y7</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.latece.uqam.ca/index.html</ref>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2358" status="OLD"><idno type="RNSR">200818291B</idno>
<orgName>Knowledge representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">HAL</idno>
<idno type="RBID">Hal:inria-00371193</idno>
<idno type="halId">inria-00371193</idno>
<idno type="halUri">https://hal.inria.fr/inria-00371193</idno>
<idno type="url">https://hal.inria.fr/inria-00371193</idno>
<date when="2009">2009</date>
<idno type="wicri:Area/Hal/Corpus">001E86</idno>
<idno type="wicri:Area/Hal/Curation">001E86</idno>
<idno type="wicri:Area/Hal/Checkpoint">002F63</idno>
<idno type="wicri:explorRef" wicri:stream="Hal" wicri:step="Checkpoint">002F63</idno>
<idno type="wicri:Area/Main/Merge">003E02</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title xml:lang="en">Efficient Vertical Mining of Frequent Closed Itemsets and Generators</title>
<author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-74129" status="VALID"><orgName>Laboratory for Research on Technology for ECommerce</orgName>
<orgName type="acronym">LATECE Laboratory - UQAM Montreal</orgName>
<desc><address><addrLine>Département d'informatique Université du Québec à Montréal 201 President Kennedy Montreal (Québec) H2X 3Y7</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.latece.uqam.ca/index.html</ref>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name>
<affiliation wicri:level="1"><hal:affiliation type="laboratory" xml:id="struct-74129" status="VALID"><orgName>Laboratory for Research on Technology for ECommerce</orgName>
<orgName type="acronym">LATECE Laboratory - UQAM Montreal</orgName>
<desc><address><addrLine>Département d'informatique Université du Québec à Montréal 201 President Kennedy Montreal (Québec) H2X 3Y7</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.latece.uqam.ca/index.html</ref>
</desc>
<listRelation><relation active="#struct-360045" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-360045" type="direct"><org type="institution" xml:id="struct-360045" status="VALID"><orgName>Université du Québec à Montréal </orgName>
<orgName type="acronym">UQAM</orgName>
<desc><address><addrLine>Université du Québec à MontréalCase postale 8888, succursale Centre-villeMontréal (Québec) H3C 3P8 Canada</addrLine>
<country key="CA"></country>
</address>
<ref type="url">http://www.uqam.ca/en/about/presentation_en.htm</ref>
</desc>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>Canada</country>
</affiliation>
</author>
<author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name>
<affiliation wicri:level="1"><hal:affiliation type="researchteam" xml:id="struct-2358" status="OLD"><idno type="RNSR">200818291B</idno>
<orgName>Knowledge representation, reasonning</orgName>
<orgName type="acronym">ORPAILLEUR</orgName>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/equipes/orpailleur</ref>
</desc>
<listRelation><relation active="#struct-160" type="direct"></relation>
<relation name="UMR7503" active="#struct-441569" type="indirect"></relation>
<relation active="#struct-300009" type="indirect"></relation>
<relation active="#struct-300291" type="indirect"></relation>
<relation active="#struct-300292" type="indirect"></relation>
<relation active="#struct-300293" type="indirect"></relation>
<relation active="#struct-2496" type="direct"></relation>
</listRelation>
<tutelles><tutelle active="#struct-160" type="direct"><org type="laboratory" xml:id="struct-160" status="OLD"><orgName>Laboratoire Lorrain de Recherche en Informatique et ses Applications</orgName>
<orgName type="acronym">LORIA</orgName>
<desc><address><addrLine>Campus Scientifique BP 239 54506 Vandoeuvre-lès-Nancy Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.loria.fr</ref>
</desc>
<listRelation><relation name="UMR7503" active="#struct-441569" type="direct"></relation>
<relation active="#struct-300009" type="direct"></relation>
<relation active="#struct-300291" type="direct"></relation>
<relation active="#struct-300292" type="direct"></relation>
<relation active="#struct-300293" type="direct"></relation>
</listRelation>
</org>
</tutelle>
<tutelle name="UMR7503" active="#struct-441569" type="indirect"><org type="institution" xml:id="struct-441569" status="VALID"><idno type="ISNI">0000000122597504</idno>
<idno type="IdRef">02636817X</idno>
<orgName>Centre National de la Recherche Scientifique</orgName>
<orgName type="acronym">CNRS</orgName>
<date type="start">1939-10-19</date>
<desc><address><country key="FR"></country>
</address>
<ref type="url">http://www.cnrs.fr/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300009" type="indirect"><org type="institution" xml:id="struct-300009" status="VALID"><orgName>Institut National de Recherche en Informatique et en Automatique</orgName>
<orgName type="acronym">Inria</orgName>
<desc><address><addrLine>Domaine de VoluceauRocquencourt - BP 10578153 Le Chesnay Cedex</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/en/</ref>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300291" type="indirect"><org type="institution" xml:id="struct-300291" status="OLD"><orgName>Université Henri Poincaré - Nancy 1</orgName>
<orgName type="acronym">UHP</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>24-30 rue Lionnois, BP 60120, 54 003 NANCY cedex, France</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300292" type="indirect"><org type="institution" xml:id="struct-300292" status="OLD"><orgName>Université Nancy 2</orgName>
<date type="end">2011-12-31</date>
<desc><address><addrLine>91 avenue de la Libération, BP 454, 54001 Nancy cedex</addrLine>
<country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-300293" type="indirect"><org type="institution" xml:id="struct-300293" status="OLD"><orgName>Institut National Polytechnique de Lorraine</orgName>
<orgName type="acronym">INPL</orgName>
<date type="end">2011-12-31</date>
<desc><address><country key="FR"></country>
</address>
</desc>
</org>
</tutelle>
<tutelle active="#struct-2496" type="direct"><org type="laboratory" xml:id="struct-2496" status="OLD"><orgName>INRIA Lorraine</orgName>
<desc><address><addrLine>615 rue du Jardin Botanique 54600 Villers-lès-Nancy</addrLine>
<country key="FR"></country>
</address>
<ref type="url">http://www.inria.fr/centre-de-recherche-inria/nancy-grand-est</ref>
</desc>
<listRelation><relation active="#struct-300009" type="direct"></relation>
</listRelation>
</org>
</tutelle>
</tutelles>
</hal:affiliation>
<country>France</country>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Université Nancy 2</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
<placeName><settlement type="city">Nancy</settlement>
<region type="region" nuts="2">Grand Est</region>
<region type="old region" nuts="2">Lorraine (région)</region>
</placeName>
<orgName type="university">Institut national polytechnique de Lorraine</orgName>
<orgName type="institution" wicri:auto="newGroup">Université de Lorraine</orgName>
</affiliation>
</author>
</analytic>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><textClass><keywords scheme="mix" xml:lang="en"><term>algorithms</term>
<term>association rules</term>
<term>closed itemsets</term>
<term>data mining</term>
<term>formal concept analysis (FCA)</term>
<term>frequent itemset mining</term>
<term>generators</term>
<term>knowledge discovery in databases (KDD)</term>
</keywords>
</textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">The effective construction of many association rule bases require the computation of both frequent closed and frequent generator itemsets (FCIs/FGs). However, these two tasks are rarely combined. Most of the existing solutions apply levelwise breadth-first traversal, though depth-first traversal is knowingly superior. Hence, we address here the depth-first FCI/FG-mining. The proposed algorithm, Touch, deals with both tasks separately, i.e., uses a well-known vertical method, Charm, to extract FCIs and a novel one called Talky-G, to extract FGs. The respective outputs are matched in a post-processing step. Experimental results indicate that Touch is highly efficient and outperforms its levelwise competitors.</div>
</front>
</TEI>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Merge
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 003E02 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 003E02 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Main |étape= Merge |type= RBID |clé= Hal:inria-00371193 |texte= Efficient Vertical Mining of Frequent Closed Itemsets and Generators }}
This area was generated with Dilib version V0.6.33. |