Name
Abstract | ||
|---|---|---|
Mining generalized association rules among items in the presence of taxonomies has been recognized as an important model for data mining. Earlier work on mining generalized association rules, however, required the taxonomies to be static, ignoring the fact that the taxonomies of items cannot necessarily be kept unchanged. For instance, some items may be reclassified from one hierarchy tree to another for more suitable classification, abandoned from the taxonomies if they will no longer be produced, or added into the taxonomies as new items. Additionally, the analysts might have to dynamically adjust the taxonomies from different viewpoints so as to discover more informative rules. Under these circumstances, effectively updating the discovered generalized association rules is a crucial task. In this paper, we examine this problem and propose two novel algorithms, called Diff_ET and Diff_ET2, to update the discovered frequent itemsets. Empirical evaluation shows that the proposed algorithms are very effective and have good linear scale-up characteristics. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1007/s10489-007-0096-5 | Appl. Intell. |
Keywords | Field | DocType |
Data mining,Generalized association rules,Frequent itemsets,Evolving taxonomies | Computer science,Viewpoints,Association rule learning,Artificial intelligence,Hierarchy,Machine learning | Journal |
Volume | Issue | ISSN |
29 | 3 | 0924-669X |
Citations | PageRank | References |
5 | 0.43 | 25 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ming-cheng Tseng | 1 | 73 | 6.47 |
| Wen-Yang Lin | 2 | 399 | 35.72 |
| Rong Jeng | 3 | 16 | 2.78 |