Year: 2011
Type: conference-paper
Abstract: Mining frequent sequences patterns invokes the interests of many searchers. However, the result set of frequent sequences is tremendous. While frequent sequential generator patterns can compact the result set of frequent sequences greatly and are superior to the frequent sequential closed patterns in classification and model selection. The existing sequential generator patterns mining algorithm fails to make full use of the relationship between a sequence and its subsequence. And when mining the frequent sequential generators, the existing algorithms are ineffective and inefficient. In order to resolve this problem, an effective and efficient algorithm is presented. A lot of experiments about the performance on datasets are conducted. The results show that the algorithm proposed is better than the existing algorithms for mining the sequential generators.
Source: Procedia Engineering
Language: English
Subfield: Information Systems
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Award: G5179843675
OpenAlex ID: W2158906891
