TY - GEN
T1 - Concept shift detection for frequent itemsets from sliding windows over data streams
AU - Koh, Jia Ling
AU - Lin, Ching Yi
N1 - Funding Information:
This work was partially supported by the R.O.C. N.S.C. under Contract No. 97-2221-E-003-007 and 97-2631-S-003-003.
PY - 2009
Y1 - 2009
N2 - In a mobile business collaboration environment, frequent itemsets analysis will discover the noticeable associated events and data to provide important information of user behaviors. Many algorithms have been proposed for mining frequent itemsets over data streams. However, in many practical situations where the data arrival rate is very high, continuous mining the data sets within a sliding window is unfeasible. For such cases, we propose an approach whereby the data stream is monitored continuously to detect any occurrence of a concept shift. In this context, a "concept-shift" means a significant number of frequent itemsets in the up-to-date sliding window are different from the previously discovered frequent itemsets. Our goal is to detect the notable changes offrequent itemsets according to an estimated changing rate of frequent itemsets without having to perform mining of the frequent itemsets at every time point. Consequently, for saving the computing costs, it is triggered to discover the complete set of new frequent itemsets only when any significant change is observed. The experimental results show that the proposed method detects concept shifts of frequent itemsets both effectively and efficiently.
AB - In a mobile business collaboration environment, frequent itemsets analysis will discover the noticeable associated events and data to provide important information of user behaviors. Many algorithms have been proposed for mining frequent itemsets over data streams. However, in many practical situations where the data arrival rate is very high, continuous mining the data sets within a sliding window is unfeasible. For such cases, we propose an approach whereby the data stream is monitored continuously to detect any occurrence of a concept shift. In this context, a "concept-shift" means a significant number of frequent itemsets in the up-to-date sliding window are different from the previously discovered frequent itemsets. Our goal is to detect the notable changes offrequent itemsets according to an estimated changing rate of frequent itemsets without having to perform mining of the frequent itemsets at every time point. Consequently, for saving the computing costs, it is triggered to discover the complete set of new frequent itemsets only when any significant change is observed. The experimental results show that the proposed method detects concept shifts of frequent itemsets both effectively and efficiently.
KW - Change Detection
KW - Data Streams
KW - Frequent Itemsets
UR - http://www.scopus.com/inward/record.url?scp=70349317040&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349317040&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-04205-8_28
DO - 10.1007/978-3-642-04205-8_28
M3 - Conference contribution
AN - SCOPUS:70349317040
SN - 364204204X
SN - 9783642042041
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 334
EP - 348
BT - Database Systems for Advanced Applications - DASFAA 2009 International Workshops
T2 - International Workshops on Database Systems for Advanced Applications, DASFAA 2009: BenchmarX, MCIS, WDPP, PPDA, MBC, PhD
Y2 - 20 April 2009 through 23 April 2009
ER -