The Impact of the Pattern-Growth Ordering on the Performances of Pattern Growth-Based Sequential Pattern Mining Algorithms


  •  Edith Kenmogne    

Abstract

Sequential Pattern Mining is an efficient technique for discovering recurring structures or patterns from very large datasetwidely addressed by the data mining community, with a very large field of applications, such as cross-marketing, DNA analysis, web log analysis,user behavior, sensor data, etc. The sequence pattern mining aims at extractinga set of attributes, shared across time among a large number of objects in a given database. Previous studies have developed two major classes of sequential pattern mining methods, namely, the candidate generation-and-test approach based on either vertical or horizontal data formats represented respectively by GSP and SPADE, and the pattern-growth approach represented by FreeSpan and PrefixSpan.In this paper, we are interested in the study of the impact of the pattern-growthordering on the performances of pattern growth-based sequential pattern mining algorithms.To this end, we introduce a class of pattern-growth orderings, called linear orderings, for which patterns are grown by making grow either the currentpattern prefix or the current pattern suffix from the same position at eachgrowth-step.We study the problem of pruning and partitioning the search space followinglinear orderings. Experimentations show that the order in which patternsgrow has a significant influence on the performances. 



This work is licensed under a Creative Commons Attribution 4.0 License.
  • ISSN(Print): 1913-8989
  • ISSN(Online): 1913-8997
  • Started: 2008
  • Frequency: quarterly

Journal Metrics

WJCI (2020): 0.439

Impact Factor 2020 (by WJCI): 0.247

Google Scholar Citations (March 2022): 6907

Google-based Impact Factor (2021): 0.68

h-index (December 2021): 37

i10-index (December 2021): 172

(Click Here to Learn More)

Contact