A new approach for problem of sequential pattern mining

Authors:
Thanh-Trung Nguyen;Phi-Khu Nguyen
Affiliations:
Department of Computer Science, University of Information Technology, Vietnam National University HCM City, Vietnam;Department of Computer Science, University of Information Technology, Vietnam National University HCM City, Vietnam
Venue:
ICCCI'12 Proceedings of the 4th international conference on Computational Collective Intelligence: technologies and applications - Volume Part I
Year:
2012

Citing 8
Cited 0

Data Mining: Concepts and Techniques

Data Mining: Concepts and Techniques
Efficient algorithms for incremental maintenance of closed sequential patterns in large databases

Data & Knowledge Engineering
Discovering recency, frequency, and monetary (RFM) sequential patterns from customers' purchasing data

Electronic Commerce Research and Applications
A network algorithm to discover sequential patterns

EPIA'07 Proceedings of the aritficial intelligence 13th Portuguese conference on Progress in artificial intelligence
LAPIN: effective sequential pattern mining algorithms by last position induction for dense databases

DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms

Proceedings of the 14th International Conference on Extending Database Technology
A sequential pattern mining algorithm using rough set theory

International Journal of Approximate Reasoning
An efficient GA-Based algorithm for mining negative sequential patterns

PAKDD'10 Proceedings of the 14th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

Frequent Pattern Mining is an important data mining task and it has been a focus theme in data mining research. One of the main issues in Frequent Pattern Mining is Sequential Pattern Mining retrieved the relationships among objects in sequential dataset. AprioriAll is a typical algorithm to solve the problem in Sequential Pattern Mining but its complexity is so high and it is difficult to apply in large datasets. Recently, to overcome the technical difficulty, there are a lot of researches on new approaches such as custom-built Apriori algorithm, modified Apriori algorithm, Frequent Pattern-tree and its developments, integrating Genetic algorithms, Rough Set Theory or Dynamic Function to solve the problem of Sequential Pattern Mining. However, there are still some challenging research issues that time consumption is still hard problem in Sequential Pattern Mining. This paper introduces a new approach with a model presented with definitions and operations. The proposed algorithm based on this model finds out the sequential patterns with quadratic time to solve absolutely problems in Sequential Pattern Mining and significantly improve the speed of calculation and data analysis.