Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction

Research output: Chapter in Book/Report/Conference proceedingConference contribution

16 Citations (Scopus)

Abstract

A periodic pattern indicates something persistent and predictable, so it is important to identify and characterize the periodicity. This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixed order. Moreover, this approach treats the antecedent and consequent of a rule separately and allows time lag between them. Thus, rules discovered are useful in many applications for prediction. The approach is implemented using two algorithms based on two data structures, event-based linked list and window-based linked list.

Original languageEnglish (US)
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages332-341
Number of pages10
StatePublished - Dec 1 2005
Event15th International Symposium on Methodologies for Intelligent Systems, ISMIS 2005 - Saratoga Springs, NY, United States
Duration: May 25 2005May 28 2005

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3488 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Symposium on Methodologies for Intelligent Systems, ISMIS 2005
CountryUnited States
CitySaratoga Springs, NY
Period5/25/055/28/05

Fingerprint

Time Lag
Association rules
Association Rules
Data structures
Partial
Prediction
Periodicity
Temporal Databases
Databases
Mining
Data Structures

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Li, D., & Deogun, J. S. (2005). Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (pp. 332-341). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3488 LNAI).

Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction. / Li, Dan; Deogun, Jitender S.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 332-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3488 LNAI).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Li, D & Deogun, JS 2005, Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3488 LNAI, pp. 332-341, 15th International Symposium on Methodologies for Intelligent Systems, ISMIS 2005, Saratoga Springs, NY, United States, 5/25/05.
Li D, Deogun JS. Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. p. 332-341. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Li, Dan ; Deogun, Jitender S. / Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2005. pp. 332-341 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{bf003ce93a7149aa9f3cf0c83e6781af,
title = "Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction",
abstract = "A periodic pattern indicates something persistent and predictable, so it is important to identify and characterize the periodicity. This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixed order. Moreover, this approach treats the antecedent and consequent of a rule separately and allows time lag between them. Thus, rules discovered are useful in many applications for prediction. The approach is implemented using two algorithms based on two data structures, event-based linked list and window-based linked list.",
author = "Dan Li and Deogun, {Jitender S.}",
year = "2005",
month = "12",
day = "1",
language = "English (US)",
isbn = "3540258787",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "332--341",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - Discovering partial periodic sequential association rules with time lag in multiple sequences for prediction

AU - Li, Dan

AU - Deogun, Jitender S.

PY - 2005/12/1

Y1 - 2005/12/1

N2 - A periodic pattern indicates something persistent and predictable, so it is important to identify and characterize the periodicity. This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixed order. Moreover, this approach treats the antecedent and consequent of a rule separately and allows time lag between them. Thus, rules discovered are useful in many applications for prediction. The approach is implemented using two algorithms based on two data structures, event-based linked list and window-based linked list.

AB - A periodic pattern indicates something persistent and predictable, so it is important to identify and characterize the periodicity. This paper presents an approach for mining partial periodic association rules in temporal databases. This approach allows the discovery of periodic episodes such that the events in an episode are not limited to a fixed order. Moreover, this approach treats the antecedent and consequent of a rule separately and allows time lag between them. Thus, rules discovered are useful in many applications for prediction. The approach is implemented using two algorithms based on two data structures, event-based linked list and window-based linked list.

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

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

M3 - Conference contribution

AN - SCOPUS:26944451649

SN - 3540258787

SN - 9783540258780

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 332

EP - 341

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -