Efficient mining of time interval-based association rules

Ki Yong Lee, Young Kyoon Suh

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

2 Scopus citations

Abstract

Given market or log data, it is very useful to find two sets of items or events that occur frequently with a regular time interval. We call a time-dependent relationship between two itemsets a time interval-based association rule. Finding time interval-based association rules, however, has not been much investigated yet until now. In this paper, we propose an efficient method for finding time interval-based association rules. The proposed method transforms the original input data into a more efficient form and then utilizes the transformed data in the subsequent steps. As a result, the input/output (I/O) cost of reading the data from disk is significantly reduced. Our experiments demonstrate the efficiency of the proposed method compared with those of the existing methods.

Original languageEnglish
Title of host publicationBig Data Applications and Services 2017 - The 4th International Conference on Big Data Applications and Services
EditorsCarson K. Leung, Wookey Lee
PublisherSpringer Verlag
Pages121-125
Number of pages5
ISBN (Print)9789811306945
DOIs
StatePublished - 2019
Event4th International Conference on Big Data Applications and Services, BigDAS 2017 - Tashkent, Uzbekistan
Duration: 15 Aug 201718 Aug 2017

Publication series

NameAdvances in Intelligent Systems and Computing
Volume770
ISSN (Print)2194-5357

Conference

Conference4th International Conference on Big Data Applications and Services, BigDAS 2017
Country/TerritoryUzbekistan
CityTashkent
Period15/08/1718/08/17

Keywords

  • Association rule mining
  • Time-interval association rule

Fingerprint

Dive into the research topics of 'Efficient mining of time interval-based association rules'. Together they form a unique fingerprint.

Cite this