Looking into the seeds of time: Discovering temporal patterns in large transaction sets

Yingjiu Li, Sencun Zhu, X. Sean Wang, Sushil Jajodia

Research output: Contribution to journalArticle

21 Citations (Scopus)

Abstract

This paper studies the problem of mining frequent itemsets along with their temporal patterns from large transaction sets. A model is proposed in which users define a large set of temporal patterns that are interesting or meaningful to them. A temporal pattern defines the set of time points where the user expects a discovered itemset to be frequent. The model is general in that (i) no constraints are placed on the interesting patterns given by the users, and (ii) two measures-inclusiveness and exclusiveness-are used to capture how well the temporal patterns match the time points given by the discovered itemsets. Intuitively, these measures indicate to what extent a discovered itemset is frequent at time points included in a temporal pattern p, but not at time points not in p. Using these two measures, one is able to model many temporal data mining problems appeared in the literature, as well as those that have not been studied. By exploiting the relationship within and between itemset space and pattern space simultaneously, a series of pruning techniques are developed to speed up the mining process. Experiments show that these pruning techniques allow one to obtain performance benefits up to 100 times over a direct extension of non-temporal data mining algorithms.

Original languageEnglish (US)
Pages (from-to)1003-1031
Number of pages29
JournalInformation Sciences
Volume176
Issue number8
DOIs
StatePublished - Apr 22 2006

Fingerprint

Transactions
Seed
Data mining
Pruning
Data Mining
Process Mining
Frequent Itemsets
Large Set
Experiments
Mining
Speedup
Model
Series
Experiment

All Science Journal Classification (ASJC) codes

  • Control and Systems Engineering
  • Theoretical Computer Science
  • Software
  • Computer Science Applications
  • Information Systems and Management
  • Artificial Intelligence

Cite this

Li, Yingjiu ; Zhu, Sencun ; Wang, X. Sean ; Jajodia, Sushil. / Looking into the seeds of time : Discovering temporal patterns in large transaction sets. In: Information Sciences. 2006 ; Vol. 176, No. 8. pp. 1003-1031.
@article{6b11714b0d7d402aa4a72d8623a0a1d1,
title = "Looking into the seeds of time: Discovering temporal patterns in large transaction sets",
abstract = "This paper studies the problem of mining frequent itemsets along with their temporal patterns from large transaction sets. A model is proposed in which users define a large set of temporal patterns that are interesting or meaningful to them. A temporal pattern defines the set of time points where the user expects a discovered itemset to be frequent. The model is general in that (i) no constraints are placed on the interesting patterns given by the users, and (ii) two measures-inclusiveness and exclusiveness-are used to capture how well the temporal patterns match the time points given by the discovered itemsets. Intuitively, these measures indicate to what extent a discovered itemset is frequent at time points included in a temporal pattern p, but not at time points not in p. Using these two measures, one is able to model many temporal data mining problems appeared in the literature, as well as those that have not been studied. By exploiting the relationship within and between itemset space and pattern space simultaneously, a series of pruning techniques are developed to speed up the mining process. Experiments show that these pruning techniques allow one to obtain performance benefits up to 100 times over a direct extension of non-temporal data mining algorithms.",
author = "Yingjiu Li and Sencun Zhu and Wang, {X. Sean} and Sushil Jajodia",
year = "2006",
month = "4",
day = "22",
doi = "10.1016/j.ins.2005.01.019",
language = "English (US)",
volume = "176",
pages = "1003--1031",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier Inc.",
number = "8",

}

Looking into the seeds of time : Discovering temporal patterns in large transaction sets. / Li, Yingjiu; Zhu, Sencun; Wang, X. Sean; Jajodia, Sushil.

In: Information Sciences, Vol. 176, No. 8, 22.04.2006, p. 1003-1031.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Looking into the seeds of time

T2 - Discovering temporal patterns in large transaction sets

AU - Li, Yingjiu

AU - Zhu, Sencun

AU - Wang, X. Sean

AU - Jajodia, Sushil

PY - 2006/4/22

Y1 - 2006/4/22

N2 - This paper studies the problem of mining frequent itemsets along with their temporal patterns from large transaction sets. A model is proposed in which users define a large set of temporal patterns that are interesting or meaningful to them. A temporal pattern defines the set of time points where the user expects a discovered itemset to be frequent. The model is general in that (i) no constraints are placed on the interesting patterns given by the users, and (ii) two measures-inclusiveness and exclusiveness-are used to capture how well the temporal patterns match the time points given by the discovered itemsets. Intuitively, these measures indicate to what extent a discovered itemset is frequent at time points included in a temporal pattern p, but not at time points not in p. Using these two measures, one is able to model many temporal data mining problems appeared in the literature, as well as those that have not been studied. By exploiting the relationship within and between itemset space and pattern space simultaneously, a series of pruning techniques are developed to speed up the mining process. Experiments show that these pruning techniques allow one to obtain performance benefits up to 100 times over a direct extension of non-temporal data mining algorithms.

AB - This paper studies the problem of mining frequent itemsets along with their temporal patterns from large transaction sets. A model is proposed in which users define a large set of temporal patterns that are interesting or meaningful to them. A temporal pattern defines the set of time points where the user expects a discovered itemset to be frequent. The model is general in that (i) no constraints are placed on the interesting patterns given by the users, and (ii) two measures-inclusiveness and exclusiveness-are used to capture how well the temporal patterns match the time points given by the discovered itemsets. Intuitively, these measures indicate to what extent a discovered itemset is frequent at time points included in a temporal pattern p, but not at time points not in p. Using these two measures, one is able to model many temporal data mining problems appeared in the literature, as well as those that have not been studied. By exploiting the relationship within and between itemset space and pattern space simultaneously, a series of pruning techniques are developed to speed up the mining process. Experiments show that these pruning techniques allow one to obtain performance benefits up to 100 times over a direct extension of non-temporal data mining algorithms.

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

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

U2 - 10.1016/j.ins.2005.01.019

DO - 10.1016/j.ins.2005.01.019

M3 - Article

AN - SCOPUS:31944451673

VL - 176

SP - 1003

EP - 1031

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

IS - 8

ER -