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...
| Main Authors: | , , |
|---|---|
| Format: | Conference or Workshop Item |
| Language: | English |
| Published: |
Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan , Sarawak
2007
|
| Subjects: | |
| Online Access: | http://scholars.utp.edu.my/id/eprint/1179/ http://scholars.utp.edu.my/id/eprint/1179/1/CITAJuly07.pdf |
| _version_ | 1848659082442964992 |
|---|---|
| author | Saputra, Dhany Rambli, Dayang R.A. Foong, Oi Mean |
| author_facet | Saputra, Dhany Rambli, Dayang R.A. Foong, Oi Mean |
| author_sort | Saputra, Dhany |
| building | UTP Institutional Repository |
| collection | Online Access |
| description | 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 that MEMISP algorithm has outperformed all other algorithms in terms of efficiency and scalability. The algorithm, however, has to posess a high performance characteristic. In this paper, we introduce a general tree-like data structure framework for mining sequential patterns. The experimental result shows that this framework considerably improves the performance of MEMISP. |
| first_indexed | 2025-11-13T07:24:46Z |
| format | Conference or Workshop Item |
| id | oai:scholars.utp.edu.my:1179 |
| institution | Universiti Teknologi Petronas |
| institution_category | Local University |
| language | English |
| last_indexed | 2025-11-13T07:24:46Z |
| publishDate | 2007 |
| publisher | Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan , Sarawak |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | oai:scholars.utp.edu.my:11792017-01-19T08:26:55Z http://scholars.utp.edu.my/id/eprint/1179/ An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP Saputra, Dhany Rambli, Dayang R.A. Foong, Oi Mean QA75 Electronic computers. Computer science 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 that MEMISP algorithm has outperformed all other algorithms in terms of efficiency and scalability. The algorithm, however, has to posess a high performance characteristic. In this paper, we introduce a general tree-like data structure framework for mining sequential patterns. The experimental result shows that this framework considerably improves the performance of MEMISP. Faculty of Computer Science and Information Technology, Universiti Malaysia Sarawak, 94300 Kota Samarahan , Sarawak 2007-07 Conference or Workshop Item PeerReviewed application/pdf en http://scholars.utp.edu.my/id/eprint/1179/1/CITAJuly07.pdf Saputra, Dhany and Rambli, Dayang R.A. and Foong, Oi Mean (2007) An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP. In: International Conference on Information Technology in Asia (CITA 2007), 10-12 July 2007, Kucing, Sarawak. 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 |
| spellingShingle | QA75 Electronic computers. Computer science Saputra, Dhany Rambli, Dayang R.A. Foong, Oi Mean An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title | An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title_full | An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title_fullStr | An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title_full_unstemmed | An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title_short | An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP |
| title_sort | efficient data structure for general tree-like framework in mining sequential patterns using memisp |
| topic | QA75 Electronic computers. Computer science |
| url | http://scholars.utp.edu.my/id/eprint/1179/ http://scholars.utp.edu.my/id/eprint/1179/ http://scholars.utp.edu.my/id/eprint/1179/1/CITAJuly07.pdf |