Is minimum-support appropriate to identifying large itemsets?
- Publication Type:
- Conference Proceeding
- Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science), 2004, 3157 pp. 474 - 484
- Issue Date:
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
Apriori-like algorithms have been based on the assumption that users can specify the minimum-support for their databases. In this paper, we propose a fuzzy strategy for identifying interesting itemsets without specifying the true minimum-support. This strategy allows users to specify their mining requirements in commonly sentences. And our algorithm generates potentially useful itemsets in fuzzy sets. © Springer-Verlag Berlin Heidelberg 2004.
Please use this identifier to cite or link to this item: