摘要
提出并发关系的概念,在此基础上给出并发度的概念,进而提出并发序列模式的概念。给出了用于挖掘并发序列模式的方法——基于支持向量的并发序列模式挖掘方法。该方法通过产生序列模式的支持向量求得2-分支并发序列模式及其支持向量;然后通过(k-1)-分支并发序列模式的支持向量和序列模式的支持向量产生k-分支并发序列模式及其支持向量,进而求得所有k分支并发序列模式。实验中采用IBM数据生成器产生的合成数据源对算法进行了验证实现,实验表明算法是有效和可行的,在不同的支持度和最小并发度下,挖掘得到并发序列模式总数随最小并发度的增大呈指数递减。
The definitions of concurrent relation and concurrence threshold were re-submitted. On the basis of these definitions, the concept of concurrent sequential pattern was given. The method to mine concurrent sequential patterns was also proposed, named concurrent sequential patterns mining method based on supporting vector. Under this method, through finding the supporting vector of each element of sequential patterns, the two branch concurrent sequential patterns and their supporting vectors could be got. The supporting vectors of k branch sequential pattern and their supporting vectors could be acquired using supporting vector of any k - 1 branch concurrent sequential pattern and supporting vector of any sequential pattern, and thus the whole k branch concurrent sequential patterns could be found. The method was tested and analyzed to be efficient and feasible through experiments.
出处
《计算机应用》
CSCD
北大核心
2009年第11期3096-3099,共4页
journal of Computer Applications
基金
辽宁省教育厅科学研究计划资助项目(05L338)
关键词
并发关系
并发度
并发序列模式
结构关系模式
concurrent relation
concurrence threshold
concurrent sequential pattern
structural relation pattern
