2010
DOI: 10.1016/j.dss.2010.08.029
|View full text |Cite
|
Sign up to set email alerts
|

New approach for the sequential pattern mining of high-dimensional sequence databases

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 11 publications
(4 citation statements)
references
References 4 publications
0
4
0
Order By: Relevance
“…Table 1 shows a multidimensional multi-sequence database, where the corresponding events of two sequential dimensions in one tuple closely occur together. For example, in tuple 1, event (a) and event (1,2) closely occur together, likewise event (b,c) and event (2,3), event (b,c,d) and event (6), event (e) and event (4,5). A multi-dimensional multi-sequence database(MMSDB) is of schema (RID,A 1 ,A 2 ,…,A m , S 1, S 2 ,…S n ), where RID is a primary key, (A 1 ,A 2 ,…,A m ) is a set of dimensions and (S 1 ,S 2 ,…S n ) is a set of sequential dimensions.…”
Section: Problem Definitionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Table 1 shows a multidimensional multi-sequence database, where the corresponding events of two sequential dimensions in one tuple closely occur together. For example, in tuple 1, event (a) and event (1,2) closely occur together, likewise event (b,c) and event (2,3), event (b,c,d) and event (6), event (e) and event (4,5). A multi-dimensional multi-sequence database(MMSDB) is of schema (RID,A 1 ,A 2 ,…,A m , S 1, S 2 ,…S n ), where RID is a primary key, (A 1 ,A 2 ,…,A m ) is a set of dimensions and (S 1 ,S 2 ,…S n ) is a set of sequential dimensions.…”
Section: Problem Definitionsmentioning
confidence: 99%
“…Lin presented METISP [5] to find time constraint sequential patterns rapidly in large databases by effective time-indexing and a pattern-growth strategy. H Liu et al came up with TD-Seq [6], which exploits a top-down transposition-based searching strategy as well as a new support counting method, for mining sequential patterns from high-dimensional sequence databases. T Hong et al put forward a novel incremental mining algorithm for maintaining sequential patterns, which is based on the concept of pre-large sequences to reduce the need for rescanning original databases [7].…”
Section: Introductionmentioning
confidence: 99%
“…Pend and Liao [11] (2009) studied the problem of mining sequential patterns from multi-domain databases. Liu et al [12] (2010) also presented an algorithm-Top-Down mining of Sequential patterns (TD-Seq), for mining sequential patterns in high-dimensional stock sequence databases. Yiyong Xiao et al [13] (2011) proposed a new framework of mining association rules with time-windows on real-time transaction database.…”
Section: Introductionmentioning
confidence: 99%
“…Such inter-sentential language patterns can provide more precise information to improve the performance of causality detection because they can capture the associations of multiple words within and between sentences. Therefore, this study develops a text mining framework by extending the classical association rule mining algorithm [ 24 - 28 ] such that it can mine inter-sentential language patterns by associating frequently co-occurred patterns across the sentence boundary. The discovered patterns are then incorporated into a probabilistic model to detect causality between sentences.…”
Section: Introductionmentioning
confidence: 99%