Finding locally and periodically frequent sets and periodic association rules

  • Authors:
  • A. Kakoti Mahanta;F. A. Mazarbhuiya;H. K. Baruah

  • Affiliations:
  • Department of Computer Science, Gauhati University, Assam, India;Department of Computer Science, Gauhati University, Assam, India;Department of Statistics, Gauhati University

  • Venue:
  • PReMI'05 Proceedings of the First international conference on Pattern Recognition and Machine Intelligence
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

The problem of finding association rules from a dataset is to find all possible associations that hold among the items, given a minimum support and confidence. This involves finding frequent sets first and then the association rules that hold within the items in the frequent sets. In temporal datasets as the time in which a transaction takes place is important we may find sets of items that are frequent in certain time intervals but not frequent throughout the dataset. These frequent sets may give rise to interesting rules but these can not be discovered if we calculate the supports of the item sets in the usual way. We call here these frequent sets locally frequent. Normally these locally frequent sets are periodic in nature. We propose modification to the Apriori algorithm to compute locally frequent sets and periodic frequent sets and periodic association rules.