Improved association rule mining by modified trimming

Wontae Hwang, Dong Seung Kim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

11 Citations (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationProceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006
DOIs
Publication statusPublished - 2006 Dec 1
Event6th IEEE International Conference on Computer and Information Technology, CIT 2006 - Seoul, Korea, Republic of
Duration: 2006 Sep 202006 Sep 22

Other

Other6th IEEE International Conference on Computer and Information Technology, CIT 2006
CountryKorea, Republic of
CitySeoul
Period06/9/2006/9/22

    Fingerprint

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Software
  • Mathematics(all)

Cite this

Hwang, W., & Kim, D. S. (2006). Improved association rule mining by modified trimming. In Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006 [4019847] https://doi.org/10.1109/CIT.2006.101