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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Kakoti Mahanta, A., Mazarbhuiya, F. A., & Baruah, H. K. (2005). Finding locally and periodically frequent sets and periodic association rules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3776 LNCS, pp. 576–582). https://doi.org/10.1007/11590316_91
Mendeley helps you to discover research relevant for your work.