Logo

An Efficient Data Structure for General Tree-Like Framework in Mining Sequential Patterns Using MEMISP

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.

[img] PDF
Restricted to Registered users only

215Kb

Official URL: http://scholar.google.com.my/scholar?q=An+Efficien...

Abstract

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.

Item Type:Conference or Workshop Item (Paper)
Subjects:Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Departments / MOR / COE:Departments > Computer Information Sciences
ID Code:1179
Deposited By: Foong Oi Mean
Deposited On:14 Apr 2010 06:16
Last Modified:19 Jan 2017 08:26

Repository Staff Only: item control page

Document Downloads

More statistics for this item...