Abstract:
This paper introduces the Boolean matrix into the both positive and negative association rules, based on the Duel Correlated Mining (DCM) algorithm, it presents a Deep Web complex schema matching algorithm. It transforms the attributes in the query interface schemas into a Boolean matrix, mines group attributes by positively calculating for matrix and mines synonymous attributes by negatively calculating for matrix. Experimental results show that the algorithm has higher efficiency.
Key words:
Boolean matrix,
schema matching,
query interface,
Deep Web
摘要: 在正负关联规则中引入布尔矩阵的概念,在双重相关性挖掘算法的基础上提出一种Deep Web复杂模式匹配算法。将查询接口模式中的属性项转化成布尔矩阵,通过对矩阵进行正关联规则运算挖掘组属性,对矩阵进行负关联规则运算挖掘同义属性。实验结果表明该算法的执行效率较高。
关键词:
布尔矩阵,
模式匹配,
查询接口,
深网
CLC Number:
GONG Gui-Fen, FU Yu-Chen, CHENG Yuan-Hu. Deep Web Complex Schema Matching Based on Boolean Matrix[J]. Computer Engineering, 2011, 37(12): 47-50.
龚桂芬, 伏玉琛, 程远虎. 基于布尔矩阵的Deep Web复杂模式匹配[J]. 计算机工程, 2011, 37(12): 47-50.