An effective algorithm for mining closed sequential patterns and their minimal generators based on prefix trees

Author： Pham Thi-Thiet   Luo Jiawei   Vo Bay  

Publisher： Inderscience Publishers

ISSN： 1751-5858

Source： International Journal of Intelligent Information and Database Systems, Vol.7, Iss.4, 2013-09, pp. : 324-339

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Mining frequent closed rooted trees

By Balcázar José   Bifet Albert   Lozano Antoni  

Machine Learning, Vol. 78, Iss. 1-2, 2010-01 ,pp. : 1-33

Springer Publishing Company

Access to resources Recommend Favorite

MAIL: mining sequential patterns with wildcards

By Xie Fei  

International Journal of Data Mining and Bioinformatics, Vol. 8, Iss. 1, 2013-06 ,pp. : 1-23

Inderscience Publishers

Access to resources Recommend Favorite

Efficient Mining of Frequent Patterns Using Ascending Frequency Ordered Prefix-Tree

By Liu Guimei   Lu Hongjun   Lou Wenwu   Xu Yabo   Yu Jeffrey  

Data Mining and Knowledge Discovery, Vol. 9, Iss. 3, 2004-11 ,pp. : 249-274

Springer Publishing Company

Access to resources Recommend Favorite

An efficient algorithm for mining condensed sequential pattern bases

By Wang Tao  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 41, Iss. 9, 2012-10 ,pp. : 1289-1296

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

Mining non-redundant time-gap sequential patterns

By Yen Show-Jane   Lee Yue-Shi  

Applied Intelligence, Vol. 39, Iss. 4, 2013-12 ,pp. : 727-738

Springer Publishing Company

Access to resources Recommend Favorite