BibTeX
@MISC{Wu_miningtop-k,
author = {Cheng-wei Wu and Vincent S. Tseng},
title = {Mining Top-K Association Rules},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Abstract. Mining association rules is a fundamental data mining task. However, depending on the choice of the parameters (the minimum confidence and minimum support), current algorithms can become very slow and generate an extremely large amount of results or generate too few results, omitting valuable information. This is a serious problem because in practice users have limited resources for analyzing the results and thus are often only interested in discovering a certain amount of results, and fine tuning the parameters is timeconsuming. To address this problem, we propose an algorithm to mine the top-k association rules, where k is the number of association rules to be found and is set by the user. The algorithm utilizes a new approach for generating association rules named rule expansions and includes several optimizations. Experimental results show that the algorithm has excellent performance and scalability, and that it is an advantageous alternative to classical association rule mining algorithms when the user want to control the number of rules generated.
Keyphrases
top-k association rule association rule practice user minimum support several optimization serious problem advantageous alternative valuable information minimum confidence excellent performance classical association rule mining algorithm fundamental data mining task new approach current algorithm large amount certain amount mining association rule experimental result rule expansion
