On-line generation association rules over data streams

Se Jung Shin, Won Suk Lee

Research output: Contribution to journalArticle

3 Citations (Scopus)

Abstract

In order to efficiently trace the changes of association rules over an online data stream, this paper proposes a method of generating association rules directly over the changing set of currently frequent itemsets. While all of the currently frequent itemsets in an online data stream are monitored by the estDec method, all the association rules of every frequent itemset in the prefix tree of the estDec method are generated by the proposed method in this paper. For this purpose, a traversal stack is introduced to efficiently enumerate all association rules in the prefix tree. This online implementation can avoid the drawbacks of the conventional two-step approach. In addition, the prefix tree itself can be utilized as an index structure for finding the current support of the antecedent of an association rule. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

Original languageEnglish
Pages (from-to)569-578
Number of pages10
JournalInformation and Software Technology
Volume50
Issue number6
DOIs
Publication statusPublished - 2008 May 1

Fingerprint

Association rules
Experiments

All Science Journal Classification (ASJC) codes

  • Software
  • Information Systems
  • Computer Science Applications

Cite this

@article{68bb9caa31274cd1ba8c866878e279f8,
title = "On-line generation association rules over data streams",
abstract = "In order to efficiently trace the changes of association rules over an online data stream, this paper proposes a method of generating association rules directly over the changing set of currently frequent itemsets. While all of the currently frequent itemsets in an online data stream are monitored by the estDec method, all the association rules of every frequent itemset in the prefix tree of the estDec method are generated by the proposed method in this paper. For this purpose, a traversal stack is introduced to efficiently enumerate all association rules in the prefix tree. This online implementation can avoid the drawbacks of the conventional two-step approach. In addition, the prefix tree itself can be utilized as an index structure for finding the current support of the antecedent of an association rule. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.",
author = "Shin, {Se Jung} and Lee, {Won Suk}",
year = "2008",
month = "5",
day = "1",
doi = "10.1016/j.infsof.2007.06.005",
language = "English",
volume = "50",
pages = "569--578",
journal = "Information and Software Technology",
issn = "0950-5849",
publisher = "Elsevier",
number = "6",

}

On-line generation association rules over data streams. / Shin, Se Jung; Lee, Won Suk.

In: Information and Software Technology, Vol. 50, No. 6, 01.05.2008, p. 569-578.

Research output: Contribution to journalArticle

TY - JOUR

T1 - On-line generation association rules over data streams

AU - Shin, Se Jung

AU - Lee, Won Suk

PY - 2008/5/1

Y1 - 2008/5/1

N2 - In order to efficiently trace the changes of association rules over an online data stream, this paper proposes a method of generating association rules directly over the changing set of currently frequent itemsets. While all of the currently frequent itemsets in an online data stream are monitored by the estDec method, all the association rules of every frequent itemset in the prefix tree of the estDec method are generated by the proposed method in this paper. For this purpose, a traversal stack is introduced to efficiently enumerate all association rules in the prefix tree. This online implementation can avoid the drawbacks of the conventional two-step approach. In addition, the prefix tree itself can be utilized as an index structure for finding the current support of the antecedent of an association rule. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

AB - In order to efficiently trace the changes of association rules over an online data stream, this paper proposes a method of generating association rules directly over the changing set of currently frequent itemsets. While all of the currently frequent itemsets in an online data stream are monitored by the estDec method, all the association rules of every frequent itemset in the prefix tree of the estDec method are generated by the proposed method in this paper. For this purpose, a traversal stack is introduced to efficiently enumerate all association rules in the prefix tree. This online implementation can avoid the drawbacks of the conventional two-step approach. In addition, the prefix tree itself can be utilized as an index structure for finding the current support of the antecedent of an association rule. Finally, the performance of the proposed method is analyzed by a series of experiments to identify its various characteristics.

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

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

U2 - 10.1016/j.infsof.2007.06.005

DO - 10.1016/j.infsof.2007.06.005

M3 - Article

AN - SCOPUS:40849088451

VL - 50

SP - 569

EP - 578

JO - Information and Software Technology

JF - Information and Software Technology

SN - 0950-5849

IS - 6

ER -