.png){kind=icon}
Return
Mining association rules with multiple minimum supports using maximum constraints
.png){kind=icon}
PRE
AI
DOI：10.1016/j.ijar.2004.11.006.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Data mining is the process of extracting desirable knowledge or interesting patterns from existing databases for specific purposes. Most of the previous approaches set a single minimum support threshold for all the items or itemsets. But in real applications, different items may have different criteria to judge its importance. The support requirements should then vary with different items. In this paper, we provide another point of view about defining the minimum supports of itemsets when items have different minimum supports. The maximum constraint is used, which is well explained and may be suitable to some mining domains. We then propose a simple algorithm based on the Apriori approach to find the large-itemsets and association rules under this constraint. The proposed algorithm is easy and efficient when compared to Wang et al.'s under the maximum constraint. The numbers of association rules and large itemsets obtained by the proposed mining algorithm using the maximum constraint are also less than those using the minimum constraint. Whether to adopt the proposed approach thus depends on the requirements of mining problems. Besides, the granular computing technique of bit strings is used to speed up the proposed data mining algorithm. (c) 2005 Elsevier Inc. All rights reserved.
Keywords:
data mining
multiple minimum supports
association rule
maximum constraint
Journal
IF:
3
Papers:
3.0K
Citations:
5.1K
Organization
No organization information available
Cited Papers
Data mining and machine oriented modeling: A granular computing approach.png)
APPLIED INTELLIGENCE
APPLIED INTELLIGENCEIF3.5
PREAI
ShareSaveShareSaveUNE PROPRIÉTÉ DYNAMIQUE DES HOMÉOMORPHISMES DU PLAN AU VOISINAGE D’UN POINT FIXE D’INDICE >1Topology
OAAI
TopologyIF0
OAAIShareSaveShareSave
ShareSaveShareSave
View more