An efficient algorithm to discover calendar-based temporal association rules

Wan J. Lee, Jung-Yi Jiang, Shie J. Lee

Research output: Contribution to journalConference article

3 Citations (Scopus)

Abstract

This work is to discover all calendar-based temporal association rules that may occur over any time interval in a temporal database. A user-given calendar schema, e.g., year, month, and day, is firstly adopted to specify the interesting time intervals as calendar patterns. Then, in every time interval, the frequent 2-itemsets are discovered along with their 1-star calendar patterns. After that, information of the rest k-star calendar patterns of the frequent 2-itemsets are levelwisely aggregated from their 1-star calendar patterns. A minimal set of candidate calendar patterns are generated and counted in the first scan of database. To avoid multiple scans over the database, all candidate itemsets are generated from frequent 2-itemsets and the Apriori downward property is utilized to reduce the number of candidate calendar patterns. Finally, all frequent itemsets with their frequent calendar patterns are discovered in one shot. Calendar-based temporal association rules are then obtained. Experimental results have shown that our method is more efficient than others.

Original languageEnglish
Pages (from-to)3122-3127
Number of pages6
JournalConference Proceedings - IEEE International Conference on Systems, Man and Cybernetics
Volume4
Publication statusPublished - 2004 Dec 1
Event2004 IEEE International Conference on Systems, Man and Cybernetics, SMC 2004 - The Hague, Netherlands
Duration: 2004 Oct 102004 Oct 13

Fingerprint

Association rules
Stars

All Science Journal Classification (ASJC) codes

  • Engineering(all)

Cite this

@article{cea50d7354954cb49d833b67060800f5,
title = "An efficient algorithm to discover calendar-based temporal association rules",
abstract = "This work is to discover all calendar-based temporal association rules that may occur over any time interval in a temporal database. A user-given calendar schema, e.g., year, month, and day, is firstly adopted to specify the interesting time intervals as calendar patterns. Then, in every time interval, the frequent 2-itemsets are discovered along with their 1-star calendar patterns. After that, information of the rest k-star calendar patterns of the frequent 2-itemsets are levelwisely aggregated from their 1-star calendar patterns. A minimal set of candidate calendar patterns are generated and counted in the first scan of database. To avoid multiple scans over the database, all candidate itemsets are generated from frequent 2-itemsets and the Apriori downward property is utilized to reduce the number of candidate calendar patterns. Finally, all frequent itemsets with their frequent calendar patterns are discovered in one shot. Calendar-based temporal association rules are then obtained. Experimental results have shown that our method is more efficient than others.",
author = "Lee, {Wan J.} and Jung-Yi Jiang and Lee, {Shie J.}",
year = "2004",
month = "12",
day = "1",
language = "English",
volume = "4",
pages = "3122--3127",
journal = "Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics",
issn = "1062-922X",

}

An efficient algorithm to discover calendar-based temporal association rules. / Lee, Wan J.; Jiang, Jung-Yi; Lee, Shie J.

In: Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics, Vol. 4, 01.12.2004, p. 3122-3127.

Research output: Contribution to journalConference article

TY - JOUR

T1 - An efficient algorithm to discover calendar-based temporal association rules

AU - Lee, Wan J.

AU - Jiang, Jung-Yi

AU - Lee, Shie J.

PY - 2004/12/1

Y1 - 2004/12/1

N2 - This work is to discover all calendar-based temporal association rules that may occur over any time interval in a temporal database. A user-given calendar schema, e.g., year, month, and day, is firstly adopted to specify the interesting time intervals as calendar patterns. Then, in every time interval, the frequent 2-itemsets are discovered along with their 1-star calendar patterns. After that, information of the rest k-star calendar patterns of the frequent 2-itemsets are levelwisely aggregated from their 1-star calendar patterns. A minimal set of candidate calendar patterns are generated and counted in the first scan of database. To avoid multiple scans over the database, all candidate itemsets are generated from frequent 2-itemsets and the Apriori downward property is utilized to reduce the number of candidate calendar patterns. Finally, all frequent itemsets with their frequent calendar patterns are discovered in one shot. Calendar-based temporal association rules are then obtained. Experimental results have shown that our method is more efficient than others.

AB - This work is to discover all calendar-based temporal association rules that may occur over any time interval in a temporal database. A user-given calendar schema, e.g., year, month, and day, is firstly adopted to specify the interesting time intervals as calendar patterns. Then, in every time interval, the frequent 2-itemsets are discovered along with their 1-star calendar patterns. After that, information of the rest k-star calendar patterns of the frequent 2-itemsets are levelwisely aggregated from their 1-star calendar patterns. A minimal set of candidate calendar patterns are generated and counted in the first scan of database. To avoid multiple scans over the database, all candidate itemsets are generated from frequent 2-itemsets and the Apriori downward property is utilized to reduce the number of candidate calendar patterns. Finally, all frequent itemsets with their frequent calendar patterns are discovered in one shot. Calendar-based temporal association rules are then obtained. Experimental results have shown that our method is more efficient than others.

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

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

M3 - Conference article

AN - SCOPUS:15744367510

VL - 4

SP - 3122

EP - 3127

JO - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

JF - Conference Proceedings - IEEE International Conference on Systems, Man and Cybernetics

SN - 1062-922X

ER -