Finding Minimal Rare Itemsets and Rare Association Rules
Identifieur interne : 003136 ( Main/Merge ); précédent : 003135; suivant : 003137Finding Minimal Rare Itemsets and Rare Association Rules
Auteurs : Laszlo Szathmary [Canada] ; Petko Valtchev [Canada] ; Amedeo Napoli [France]Source :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: Rare association rules correspond to rare, or infrequent, itemsets, as opposed to frequent ones that are targeted by conventional pattern miners. Rare rules reflect regularities of local, rather than global, scope that can nevertheless provide valuable insights to an expert, especially in areas such as genetics and medical diagnosis where some specific deviations/illnesses occur only in a small number of cases. The work presented here is motivated by the long-standing open question of efficiently mining strong rare rules, i.e., rules with high confidence and low support.
Url:
DOI: 10.1007/978-3-642-15280-1_5
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003B63
- to stream Istex, to step Curation: 003B19
- to stream Istex, to step Checkpoint: 000841
Links to Exploration step
ISTEX:F8C145E4B057143C77B3997D4AE3B765E1578C4CLe document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Finding Minimal Rare Itemsets and Rare Association Rules</title><author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name></author><author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name></author><author><name sortKey="Napoli, Amedeo" sort="Napoli, Amedeo" uniqKey="Napoli A" first="Amedeo" last="Napoli">Amedeo Napoli</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F8C145E4B057143C77B3997D4AE3B765E1578C4C</idno><date when="2010" year="2010">2010</date><idno type="doi">10.1007/978-3-642-15280-1_5</idno><idno type="url">https://api.istex.fr/ark:/67375/HCB-HP55BM2W-W/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003B63</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003B63</idno><idno type="wicri:Area/Istex/Curation">003B19</idno><idno type="wicri:Area/Istex/Checkpoint">000841</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">000841</idno><idno type="wicri:doubleKey">0302-9743:2010:Szathmary L:finding:minimal:rare</idno><idno type="wicri:Area/Main/Merge">003136</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Finding Minimal Rare Itemsets and Rare Association Rules</title><author><name sortKey="Szathmary, Laszlo" sort="Szathmary, Laszlo" uniqKey="Szathmary L" first="Laszlo" last="Szathmary">Laszlo Szathmary</name><affiliation wicri:level="3"><country xml:lang="fr">Canada</country><wicri:regionArea>Dépt. d’Informatique UQAM, C.P. 8888, Succ. Centre-Ville, H3C 3P8, Montréal</wicri:regionArea><placeName><settlement type="city">Montréal</settlement><region type="state">Québec</region></placeName></affiliation><affiliation></affiliation></author><author><name sortKey="Valtchev, Petko" sort="Valtchev, Petko" uniqKey="Valtchev P" first="Petko" last="Valtchev">Petko Valtchev</name><affiliation wicri:level="3"><country xml:lang="fr">Canada</country><wicri:regionArea>Dépt. d’Informatique UQAM, C.P. 8888, Succ. Centre-Ville, H3C 3P8, Montréal</wicri:regionArea><placeName><settlement type="city">Montréal</settlement><region type="state">Québec</region></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">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="3"><country xml:lang="fr">France</country><wicri:regionArea>LORIA UMR 7503, B.P. 239, 54506, Vandœuvre-lès-Nancy Cedex</wicri:regionArea><placeName><region type="region" nuts="2">Grand Est</region><region type="old region" nuts="2">Lorraine (région)</region><settlement type="city">Vandœuvre-lès-Nancy</settlement></placeName></affiliation><affiliation wicri:level="1"><country wicri:rule="url">France</country></affiliation></author></analytic><monogr></monogr><series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Rare association rules correspond to rare, or infrequent, itemsets, as opposed to frequent ones that are targeted by conventional pattern miners. Rare rules reflect regularities of local, rather than global, scope that can nevertheless provide valuable insights to an expert, especially in areas such as genetics and medical diagnosis where some specific deviations/illnesses occur only in a small number of cases. The work presented here is motivated by the long-standing open question of efficiently mining strong rare rules, i.e., rules with high confidence and low support.</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 003136 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Merge/biblio.hfd -nk 003136 | 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é= ISTEX:F8C145E4B057143C77B3997D4AE3B765E1578C4C
|texte= Finding Minimal Rare Itemsets and Rare Association Rules
}}
| This area was generated with Dilib version V0.6.33. |  |