Computing the minimum-support for mining frequent patterns

Publication Type:
Journal Article
Knowledge and Information Systems, 2008, 15 (2), pp. 233 - 257
Issue Date:
Filename Description Size
Thumbnail2007000702OK.pdf458.22 kB
Adobe PDF
Full metadata record
Frequent pattern mining is based on the assumption that users can specify the minimum-support for mining their databases. It has been recognized that setting the minimum-support is a difficult task to users. This can hinder the widespread applications of these algorithms. In this paper we propose a computational strategy for identifying frequent itemsets, consisting of polynomial approximation and fuzzy estimation. More specifically, our algorithms (polynomial approximation and fuzzy estimation) automatically generate actual minimum-supports (appropriate to a database to be mined) according to users' mining requirements. We experimentally examine the algorithms using different datasets, and demonstrate that our fuzzy estimation algorithm fittingly approximates actual minimum-supports from the commonly-used requirements. © Springer-Verlag London Limited 2007.
Please use this identifier to cite or link to this item: