Characteristic Rule Discovery in Aurum-3

  • Authors:
  • David McSherry;Donal Roantree

  • Affiliations:
  • School of Information and Software Engineering, University of Ulster, Coleraine BT52 1SA, Northern Ireland. dmg.mcsherry@ulst.ac.uk;School of Information and Software Engineering, University of Ulster, Coleraine BT52 1SA, Northern Ireland. dk.roantree@ulst.ac.uk

  • Venue:
  • Applied Intelligence
  • Year:
  • 1999

Quantified Score

Hi-index 0.00

Visualization

Abstract

One strategy for increasing the efficiency of rule discoveryin data mining is to target a restricted class of rules, such asexact or almost exact rules, rules with a limited number ofconditions, or rules in which each condition, on its own, eliminatesa competing outcome class. An algorithm is presented for thediscovery of rules in which each condition is a distinctive featureof the outcome class on its right-hand side in the subset of the dataset defined by the conditions, if any, which precede it. Such a ruleis said to be characteristic for the outcome class. A feature isdefined as distinctive for an outcome class if it maximises awell-known measure of rule interest or is unique to the outcome classin the data set. In the special case of data mining which ariseswhen each outcome class is represented by a single instance in thedata set, a feature of an object is shown to be distinctive if andonly if no other feature is shared by fewer objects in the dataset.