Abstract
The problem that we tackle here is a practical one: When users interactively mine association rules, it is often the case that they have to continuously tune two thresholds: minimum support and minimum confidence, which describe the users' changing requirements. In this paper, we present an efficient data re-mining (DRM) technique for updating previously discovered association rules in light of threshold changes.
| Original language | English |
|---|---|
| Title of host publication | Advances in Knowledge Discovery and Data Mining - 5th Pacific-Asia Conference, PAKDD 2001, Proceedings |
| Editors | David Cheung, Graham J. Williams, Qing Li |
| Publisher | Springer Verlag |
| Pages | 406-412 |
| Number of pages | 7 |
| ISBN (Print) | 3540419101, 9783540419105 |
| DOIs | |
| Publication status | Published - 2001 |
| Event | 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001 - Hong Kong, Hong Kong, China Duration: 16 Apr 2001 → 18 Apr 2001 https://link.springer.com/book/10.1007/3-540-45357-1 (Conference Proceedings) |
Publication series
| Name | Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) |
|---|---|
| Volume | 2035 |
| ISSN (Print) | 0302-9743 |
Conference
| Conference | 5th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2001 |
|---|---|
| Country/Territory | Hong Kong, China |
| City | Hong Kong |
| Period | 16/04/01 → 18/04/01 |
| Internet address |
|