1 June 2014 in Engineering Applications of Artificial Intelligence
7 June 2024 in Expert Systems with Applications
1 January 2013 in International Journal of Intelligent Information and Database Systems
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.
1 July 2015 in Fundamenta Informaticae
Mining long frequent sequences that contain a combinatorial number of frequent subsequences or using very low support thresholds to mine sequential patterns is usually both time- and memory-consuming. The mining of closed sequential patterns, sequential generator patterns, and maximum sequences has been proposed to overcome this problem. Sequential generator patterns, when used together with closed sequential patterns, can provide additional information that closed sequential patterns alone cannot provide. Mining sequential generator patterns is thus an important task in data mining as well. This paper proposes an algorithm called MSGP-PreTree for mining all sequential generator patterns based on the prefix-tree structure. The algorithm uses the characteristics of sequential generator patterns and sequence extensions to efficiently perform a depth-first search on a prefix tree. It also uses a vertical approach to list and count the supports of sequences based on the prime block encoding approach for representing candidate sequences and determining the frequencies of candidates. Besides, the search space of the MSGP-PreTree algorithm is much smaller than those of other algorithms because two pruning strategies are applied. Experimental results conducted on synthetic and real databases show that the proposed algorithm is effective than a previous one.