.png){kind=icon}
Return
A tree structure for event-based sequence mining
.png){kind=icon}
PRE
AI
DOI：10.1016/j.knosys.2012.04.027.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The incorporation of temporal semantics into traditional data mining techniques has led to the development of a new field called temporal data mining. This is especially necessary for extracting useful knowledge from dynamic domains, which by nature are time-varying. However, in practical terms, this is a computationally intractable problem, and therefore, it poses more challenges to efficient processing than non-temporal techniques. In this paper, we present a tree-based structure and a handling algorithm, called TSET - Miner, for frequent temporal pattern mining from time-stamped datasets. The algorithm is based on mining inter-transaction association, and is mainly characterized by the use of a single tree-based data structure for generation and storage of all frequent sequences discovered by mining. Given the versatility involved in the use of a single data structure, it may be extended an adapted to extract other types of patterns with relative little effort. To demonstrate this, we also present TSETmax - Miner, an algorithm based on the TSET structure, designed to extract maximal frequent event-based sequences. (C) 2012 Elsevier B.V. All rights reserved.
Keywords:
Temporal data mining
Inter-transaction itemsets
Event-based sequences
Inter-transactional mining
Temporal associations
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
K
IF:
7.6
Papers:
1.2W
Citations:
4.5W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSave
ShareSaveShareSaveShareSaveShareSave
View more