An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP
Sequential pattern mining is a relatively new data-mining problem with many areas of applications. One of the challenges is to develop a method that is efficient and scalable especially when the sequence database provided gets larger or the minimum support threshold gets smaller. It has been shown t...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Published: |
Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan , Sarawak
2007
|
| Subjects: | |
| Online Access: | http://eprints.utp.edu.my/1179/1/CITAJuly07.pdf http://scholar.google.com.my/scholar?q=An+Efficient+Data+Structure+for+General+Tree-Like+Framework+in+Mining+Sequential+Patterns+Using+MEMISP&hl=en&btnG=Search&as_sdt=2001&as_sdtp=on http://eprints.utp.edu.my/1179/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|