.png){kind=icon}
Return
Mining inter-sequence patterns
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2008.10.008.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Sequential pattern and inter-transaction pattern mining have long been important issues in data mining research. The former finds sequential patterns Without considering the relationships between transactions in databases, while the latter finds inter-transaction patterns without considering the ordered relationships of items within each transaction. However, if we want to find patterns that cross transactions in a sequence database, called inter-sequence patterns, neither of the above models can perform the task. In this paper, we propose a new data mining model for mining frequent inter-sequence patterns. We design two algorithms, M-Apriori and EISP-Miner. to find such patterns. The former is an Apriori-like algorithm that can mine inter-sequence patterns, but it is not efficient. The latter, a new method that we propose, employs several mechanisms for mining inter-sequence patterns efficiently. Experiments show that EISP-Miner is very efficient and outperforms M-Apriori by several orders of magnitude. (C) 2008 Elsevier Ltd. All rights reserved.
Keywords:
Data mining
Inter-sequence pattern
Inter-transaction pattern
Sequential pattern
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSaveShareSave
View more