Third International Conference on Information Technology: New Generations (ITNG'06) 2006
DOI: 10.1109/itng.2006.41
|View full text |Cite
|
Sign up to set email alerts
|

Closed Multidimensional Sequential Pattern Mining

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
20
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
4
2

Relationship

0
6

Authors

Journals

citations
Cited by 18 publications
(20 citation statements)
references
References 10 publications
0
20
0
Order By: Relevance
“…These have been previously applied, for example, to analyze earthquake data [10] and source code in software engineering [24]. While traditional sequential pattern mining (SPM) algorithms have as their only goal to discover sequential patterns that occur frequently in several transactions of a database [13], other algorithms have proposed numerous extensions to the problem of sequential pattern mining such as mining patterns respecting time-constraints [10], mining compact representations of patterns [14,16,24], and incremental mining of patterns [24].…”
Section: B Step 2: Mining a Partial Task Model From Users' Plansmentioning
confidence: 99%
See 2 more Smart Citations
“…These have been previously applied, for example, to analyze earthquake data [10] and source code in software engineering [24]. While traditional sequential pattern mining (SPM) algorithms have as their only goal to discover sequential patterns that occur frequently in several transactions of a database [13], other algorithms have proposed numerous extensions to the problem of sequential pattern mining such as mining patterns respecting time-constraints [10], mining compact representations of patterns [14,16,24], and incremental mining of patterns [24].…”
Section: B Step 2: Mining a Partial Task Model From Users' Plansmentioning
confidence: 99%
“…For this work, we developed a custom sequential pattern mining algorithm [15] that combines several features from other algorithms such as accepting time constraints [10], processing databases with dimensional information [11], and mining a compact representation of all patterns [14,16], and that also adds some original features such as accepting symbols with parameter values. We have built this algorithm to address the type of data to be recorded in a tutoring system offering procedural exercises such as CanadarmTutor.…”
Section: B Step 2: Mining a Partial Task Model From Users' Plansmentioning
confidence: 99%
See 1 more Smart Citation
“…For this work, we chose a sequential pattern mining algorithm that we have developed [8], as it combines several features from other algorithms such as accepting time constraints [11], processing databases with dimensional information [17], eliminating redundancy [20,18], and also because it offers some original features such as accepting symbols with numeric values [8]. We describe next some basic features of the algorithm.…”
Section: Mining Temporal Patterns From Sequences Of Eventsmentioning
confidence: 99%
“…Mining frequent closed sequences has the advantage of greatly reducing the size of patterns found, without information loss (the set of closed frequent sequences allows reconstituting the set of all frequent sequences and their support) [20]. To mine only frequent closed sequences, our sequential pattern mining algorithm was extended based on [20] and [18] to mine closed MD-Sequences (see [8]). …”
Section: The Learning Phasementioning
confidence: 99%