检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:鲍文燕[1] 尹江[1] 徐杰[1] 李晨[1] 李云[1]
出 处:《小型微型计算机系统》2014年第9期2009-2013,共5页Journal of Chinese Computer Systems
基 金:国家自然科学基金项目(61070133;61003180)资助;江苏省教育厅自然科学基金项目(11KJD520011;12KJB520018)资助;江苏省"六大人才高峰"项目(2012-WLW-024)资助;江苏省产学研联合创新资金(前瞻性联合研究)项目(BY2013063-10)资助
摘 要:在普通ER模型下,为了避免多表物理连接,本文提出了一种挖掘多关系序列模式的算法(MSPEM).该算法首先指定目标表及关键原子,建立相应的语义关系图,再根据语义关系图中的连接路径,传播元组标号.挖掘过程可分为单表挖掘和跨表挖掘,支持度的计算以关键原子为依据进行统计,最终得到基于虚拟连接表的多关系序列模式.MSPEM是一种ER模型下的基于元组传播的多关系序列模式挖掘方法,同时通过指定关键原子解决了基于虚拟连接表存在的统计偏斜问题.实验结果表明MSPEM算法具有更高的执行效率.In order to avoid physical link in normal ER model , this paper proposes a method for mining multi-relational sequence pattern( MSPEM ). In this Algorithm, the target table and the key element are firstly assigned, and the semantic relationship graph is established. , then tuple labels are propagated along with the connected paths in the graph. Mining process can be divided into single-table mining and cross-table mining, and the support is calculated based on key element, eventually multi-relational sequence patterns are obtained based on the virtual connection table. MSPEM is a way to mine multi-relational sequence sequence pattern in ER model based on tuple propagation, which can solve the statistics decline by assigning key element based on virtual table connection. Experimental result shows that MSPEM has higher efficiency.
分 类 号:TP311[自动化与计算机技术—计算机软件与理论]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.80