Name
Abstract | ||
|---|---|---|
Recently, the weakness of the canonical support-confidence framework for associations mining has been widely studied in the literature. One of the difficulties in applying association rules mining to real world applications is the setting of support constraint. A high support constraint avoids the combinatorial explosion in discovering frequent itemsets, but at the expense of missing interesting patterns of low support. Instead of seeking the way for setting the appropriate support constraint, all current approaches leave the users in charge of the support setting, which, however, puts the users in a dilemma. This paper is an effort to answer this long-standing open question. Based on the notion of confidence and lift measures, we propose an automatic support specification for mining high confidence and positive lift associations without consulting the users. Experimental results show that this specification is good at discovering the low support, but high confidence and positive lift associations, and is effective in reducing the spurious frequent itemsets. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/3-540-47887-6_14 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
support constraint,frequent itemsets,high support constraint,low support,high confidence,appropriate support constraint,support setting,automatic support specification,associations mining,interesting associations mining,confidence-lift support specification,positive lift association,specification,database,association rule,data mining,association rule mining | Lift (force),Data mining,Computer science,Association rule learning,Artificial intelligence,Dilemma,Combinatorial explosion,Spurious relationship,Machine learning | Conference |
ISBN | Citations | PageRank |
3-540-43704-5 | 8 | 0.57 |
References | Authors | |
12 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wen-Yang Lin | 1 | 399 | 35.72 |
| Ming-cheng Tseng | 2 | 73 | 6.47 |
| Ja-Hwung Su | 3 | 329 | 24.53 |