Pudi, Vikram and Haritsa, Jayant R (2002) How Good are Association-rule Mining Algorithms ? In: 18th International Conference on Data Engineering (ICDE’02), 26 February – 1 March, 2002, San Jose, USA, p. 276.
We address the question of how much space remains for performance improvement over current association rule mining algorithms. Our approach is to compare their performance against an "Oracle algorithm" that knows in advance the identities of all frequent itemsets in the database and only needs to gather the actual supports of these itemsets, in one scan over the database, to complete the mining process. Clearly, any practical algorithm will have to do at least this much work in order to generate mining rules.
|Item Type:||Conference Poster|
|Additional Information:||©2002 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Information Sciences > Supercomputer Education & Research Centre|
|Date Deposited:||15 Jul 2004|
|Last Modified:||19 Sep 2010 04:14|
Actions (login required)