一种基于数据挖掘的Deep Web模式匹配方法  

A METHOD OF DEEP WEB SCHEMA MATCHING BASED ON DATA MINING

作　　者：钟昕[1] 伏玉琛[1] 

机构地区：[1]苏州大学计算机科学与技术学院,江苏苏州215006

出　　处：《计算机应用与软件》2009年第5期46-49,共4页Computer Applications and Software

基　　金：国家自然科学基金项目(60673092);江苏省高校自然科学基金项目(07KJD520187)

摘　　要：模式匹配是DeepWeb异构信息集成中的关键问题.介绍了一种整体性匹配方法,即同时发现大量模式,并一次性进行匹配。主要通过分析和比较两种已经存在的大规模模式匹配原型系统:MGS和DCM,结合它们核心算法的优点,提出一种新的基于数据挖掘技术的算法(Correlated-clustering)。该算法先利用积极相关发现组匹配,再通过概念相似度的计算聚类同义属性,最后进行匹配选择。实验结果表明,本算法全面、效率高,充分体现了整体性方法的思想。Schema matching is a critical problem in Deep Web heterogeneous information integration. In this paper it introduces a holistic matching approach, which finds many schemas simultaneously and one-off matches them. We mainly analyzed and compared two existing large scale schema matching archetypal system：MGS and DCM, and proposed a new algorithm based on data mining, named as Correlated-clustering,which combines the advantages of the two existing systems. This algorithm first mines group attributes by positively correlated attributes, and then clusters the synonymous attributes by calculating the similarity of each two concepts, finally makes matching selection from above results. The experiment result shows the effectiveness and completeness of our algorithm, which demonstrates the conception of holistic schema matching.

关 键 词：DEEP WEB 模式匹配 整体性方法 数据挖掘 

分 类 号：TP311.13[自动化与计算机技术—计算机软件与理论] TN919.81[自动化与计算机技术—计算机科学与技术]