Mining frequent closed patterns with item constraints in data streams

Abstract

In order to efficiently filter the useful association rules through a large number of mined rules, some item constraints that are Boolean expressions are integrated into the associations discovery algorithm. The set of frequent closed patterns uniquely determines the complete set of all frequent patterns, and it can be orders of magnitude smaller than the… (More)

3 Figures and Tables

Topics

  • Presentations referencing similar topics