An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees Online publication date: Mon, 31-Mar-2014
by Thi-Thiet Pham; Jiawei Luo; Bay Vo
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 7, No. 4, 2013
Abstract: Sequential generator patterns and closed sequential patterns play an important role in data mining tasks. They are proposed to address difficult problems in mining sequential pattern and have often been used together to generate non-redundant rules. Based on their important role, this paper proposes an efficient algorithm called CloGen for mining closed sequential patterns and their minimal sequential generator patterns. The CloGen algorithm uses the parent-child relationship on prefix tree structure and inserts fields into each node on prefix tree to determine whether that is a minimal sequential generator pattern or closed sequential pattern. Experimental results show that the performance runtime of CloGen algorithm is much faster than that of other algorithms by more than one order of magnitude.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com