Finding minimal rare itemsets and rare association rules

  • Authors:
  • Laszlo Szathmary;Petko Valtchev;Amedeo Napoli

  • Affiliations:
  • Dépt. d'Informatique UQAM, Montréal, Canada;Dépt. d'Informatique UQAM, Montréal, Canada;LORIA, UMR, Vandœuvre-lès-Nancy Cedex, France

  • Venue:
  • KSEM'10 Proceedings of the 4th international conference on Knowledge science, engineering and management
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

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.