๐Ÿ“–
Generating Rare Association Rules Using the Minimal Rare Itemsets Family
Laszlo Szathmary, Petko Valtchev, Amedeo Napoli

Generating Rare Association Rules Using the Minimal Rare Itemsets Family

Science & Mathematics Published 2010 Verification Pending

Overview & Synopsis

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. We also propose an efficient solution for finding the set of minimal rare itemsets. This set serves as a basis for generating rare association rules.

Indexed from repository: HAL Open Science (hal.science)
Loading document from verified source...
Keyboard Shortcuts: ← / → for pages • + / - for zoom • 0 to fit width Powered by Mozilla PDF.js v3.11

Document Information

Document Title Generating Rare Association Rules Using the Minimal Rare Itemsets Family
Author / Organization Laszlo Szathmary, Petko Valtchev, Amedeo Napoli
Subject & Discipline Multidisciplinary Academic Open Research
Categories Science & Mathematics
Publication Year 2010
License / Rights Open Access / Creative Commons
Resource Verification Listed PDF (Verification Pending)
Original Host Website HAL Open Science (hal.science)
File Format application/pdf (Portable Document Format)
Language EN
Catalog ID DOC-186487
Original Source Link Visit Source Page on hal.science »