Name
Abstract | ||
|---|---|---|
Previous methods on mining association rules require users to input a minimum support threshold. However, there can be too many or too few resulting rules if the threshold is set inappropriately. It is difficult for end-users to find the suitable threshold. In this paper, we propose a different setting in which the user does not provide a support threshold, but instead indicates the amount of results that is required. |
Year | Venue | Keywords |
|---|---|---|
2000 | ISMIS | support threshold,different setting,minimum support threshold,previous method,mining association rule,suitable threshold,mining n-most interesting itemsets,difference set,association rule |
Field | DocType | ISBN |
Data mining,Computer science,Association rule learning,Artificial intelligence,Knowledge extraction,Machine learning | Conference | 3-540-41094-5 |
Citations | PageRank | References |
34 | 3.12 | 6 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ada Wai-Chee Fu | 1 | 4646 | 417.59 |
| Renfrew W.-w. Kwong | 2 | 34 | 3.12 |
| Jian Tang | 3 | 526 | 148.30 |