Improved association rule mining by modified trimming

Wontae Hwang; Dongseung Kim

doi:10.1109/CIT.2006.101

Improved association rule mining by modified trimming

Wontae Hwang, Dongseung Kim

GREEN SCHOOL (Graduate School of Energy and Environment)

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

13 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 language	English
Title of host publication	Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006
Publisher	IEEE Computer Society
Pages	24-28
Number of pages	5
ISBN (Print)	076952687X, 9780769526874
DOIs	https://doi.org/10.1109/CIT.2006.101
Publication status	Published - 2006
Event	6th IEEE International Conference on Computer and Information Technology, CIT 2006 - Seoul, Korea, Republic of Duration: 2006 Sept 20 → 2006 Sept 22

Publication series

Name	Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006

Other

Other	6th IEEE International Conference on Computer and Information Technology, CIT 2006
Country/Territory	Korea, Republic of
City	Seoul
Period	06/9/20 → 06/9/22

ASJC Scopus subject areas

Computer Science Applications
Information Systems
Software
Mathematics(all)

Access to Document

10.1109/CIT.2006.101

Cite this

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

Improved association rule mining by modified trimming. / Hwang, Wontae; Kim, Dongseung.

Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006. IEEE Computer Society, 2006. p. 24-28 4019847 (Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Hwang, W & Kim, D 2006, Improved association rule mining by modified trimming. in Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006., 4019847, Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006, IEEE Computer Society, pp. 24-28, 6th IEEE International Conference on Computer and Information Technology, CIT 2006, Seoul, Korea, Republic of, 06/9/20. https://doi.org/10.1109/CIT.2006.101

@inproceedings{d064d02463194e9bb58329555e4887f3,

title = "Improved association rule mining by modified trimming",

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.",

author = "Wontae Hwang and Dongseung Kim",

year = "2006",

doi = "10.1109/CIT.2006.101",

language = "English",

isbn = "076952687X",

series = "Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006",

publisher = "IEEE Computer Society",

pages = "24--28",

booktitle = "Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006",

note = "6th IEEE International Conference on Computer and Information Technology, CIT 2006 ; Conference date: 20-09-2006 Through 22-09-2006",

}

TY - GEN

T1 - Improved association rule mining by modified trimming

AU - Hwang, Wontae

AU - Kim, Dongseung

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=34547374462&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547374462&partnerID=8YFLogxK

U2 - 10.1109/CIT.2006.101

DO - 10.1109/CIT.2006.101

M3 - Conference contribution

AN - SCOPUS:34547374462

SN - 076952687X

SN - 9780769526874

T3 - Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006

SP - 24

EP - 28

BT - Proceedings - Sixth IEEE International Conference on Computer and Information Technology, CIT 2006

PB - IEEE Computer Society

T2 - 6th IEEE International Conference on Computer and Information Technology, CIT 2006

Y2 - 20 September 2006 through 22 September 2006

ER -

Improved association rule mining by modified trimming

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this