Sixth IEEE International Conference on Computer and Information Technology (CIT'06) Improved Association Rule Mining by Modified Trimming Seoul, Korea September 20-September 22 ISBN: 0-7695-2687-X
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/CIT.2006.101
This paper presents a new association mining algorithm that uses two phase sampling for shortening the execution time at the cost of precision of the mining result. Previous FAST (Finding Association by Sampling Technique) algorithm has the weakness in that it only considered the frequent 1-itemsets in trimming/growing, thus, it did not have ways of considering mulit-itemsets including 2-itemsets. The new algorithm reflects the multi-itemsets in sampling transactions. It improves the mining results by adjusting the counts of both missing itemsets and false itemsets. Experimentally on a representative synthetic database, the accuracy of 2-itemsets reaches 0.68 compared to 0.46 while it maintains the same quality.
Citation:
Wontae Hwang, Dongseung Kim, "Improved Association Rule Mining by Modified Trimming," cit, pp.24, Sixth IEEE International Conference on Computer and Information Technology (CIT'06), 2006 Usage of this product signifies your acceptance of the Terms of Use. | |||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||