Efficient Mining of Closed Repetitive Gapped Subsequences from a Sequence Database
There is a huge wealth of sequence data available, for example, customer purchase histories, program execution traces, DNA, and protein sequences. Analyzing this wealth of data to mine important knowledge is certainly a worthwhile goal. In this paper, as a step forward to analyzing patterns in seque...
Saved in:
Main Authors: | DING, Bolin, LO, David, Han, Jiawei, KHOO, Siau-Cheng |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2009
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/sis_research/297 https://ink.library.smu.edu.sg/context/sis_research/article/1296/viewcontent/icde09.pdf |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
Similar Items
-
Efficient mining of closed repetitive gapped subsequences from a sequence database
by: Ding, B., et al.
Published: (2013) -
Bidirectional Mining of Non-Redundant Recurrent Rules from a Sequence Database
by: LO, David, et al.
Published: (2011) -
Efficient Mining of Recurrent Rules from a Sequence Database
by: LO, David, et al.
Published: (2008) -
Mining Message Sequence Graphs
by: KUMAR, Sandeep, et al.
Published: (2011) -
Specification Mining: A Concise Introduction
by: LO, David, et al.
Published: (2011)