Abstract
This paper introduces a novel pattern called indirect association and examines its utility in various application domains. Existing algorithms for mining associations, such as Apriori, will only discover itemsets that have support above a user-defined threshold. Any itemsets with support below the minimum support requirement are filtered out. We believe that an infrequent pair of items can be useful if the items are related indirectly via some other set of items. In this paper, we propose an algorithm for deriving indirectly associated itempairs and demonstrate the potential application of these patterns in the retail, textual and stock market domains.
| Original language | English (US) |
|---|---|
| Title of host publication | Principles of Data Mining and Knowledge Discovery - 4th European Conference, PKDD 2000, Proceedings |
| Editors | Djamel A. Zighed, Jan Komorowski, Jan Zytkow |
| Publisher | Springer Verlag |
| Pages | 632-637 |
| Number of pages | 6 |
| ISBN (Print) | 9783540410669 |
| DOIs | |
| State | Published - 2000 |
| Event | 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2000 - Lyon, France Duration: Sep 13 2000 → Sep 16 2000 |
Publication series
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Volume | 1910 |
| ISSN (Print) | 0302-9743 |
| ISSN (Electronic) | 1611-3349 |
Other
| Other | 4th European Conference on Principles and Practice of Knowledge Discovery in Databases, PKDD 2000 |
|---|---|
| Country/Territory | France |
| City | Lyon |
| Period | 9/13/00 → 9/16/00 |
Bibliographical note
Publisher Copyright:© Springer-Verlag Berlin Heidelberg 2000.