General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations
General Algorithms for Mining Closed Flexible Patterns under Various Equivalence Relations
复制标题
DOI：
10.1007/978-3-642-33486-3_28
复制
发表时间：
2012-09
期刊：
影响因子：
--
通讯作者：
I. Tomohiro;Yuki Enokuma;H. Bannai;M. Takeda
中科院分区：
文献类型：
--
作者：
I. Tomohiro;Yuki Enokuma;H. Bannai;M. Takeda
我们解决了在顺序数据库中的类oflexiblepatterns封闭模式发现问题。我们提出了两种技术粗化现有的等价关系的模式集，以获得新的等价关系。我们的新算法GenCloFlex是Arimura和Uno（2007）提出的MaxFlex的推广，该算法是为特定的等价关系而设计的。GenCloFlex可以科普现有的，以及新的等价关系，我们调查各自的等价关系的算法的计算复杂性。然后，我们提出了一个改进的算法GenCloFlex+的基础上新的修剪技术，提高了延迟时间的一些等价关系的每个输出。通过对合成数据的计算实验，我们表明，大多数的冗余挖掘模式被删除使用建议的等价关系。
We address the closed pattern discovery problem in sequential databases for the class offlexiblepatterns. We propose two techniques of coarsening existing equivalence relations on the set of patterns to obtain new equivalence relations. Our new algorithm GenCloFlex is a generalization of MaxFlex proposed by Arimura and Uno (2007) that was designed for a particular equivalence relation. GenCloFlex can cope with existing, as well as new equivalence relations, and we investigate the computational complexities of the algorithm for respective equivalence relations. Then, we present an improved algorithm GenCloFlex+ based on new pruning techniques, which improve the delay time per output for some of the equivalence relations. By computational experiments on synthetic data, we show that most of the redundancies in the mined patterns are removed using the proposed equivalence relations.