A Query Interface Matching Approach Based on Extended Evidence Theory for Deep Web

被引:1
作者
Dong, Yong-Quan [1 ,2 ]
Li, Qing-Zhong [1 ]
Ding, Yan-Hui [1 ]
Peng, Zhao-Hui [1 ]
机构
[1] Shandong Univ, Sch Comp Sci & Technol, Jinan 250014, Peoples R China
[2] Xuzhou Normal Univ, Sch Comp Sci & Technol, Xuzhou 221000, Peoples R China
基金
中国国家自然科学基金;
关键词
query interface matching; schema matching; Deep Web; Web data integration;
D O I
10.1007/s11390-010-9343-z
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Matching query interfaces is a crucial step in data integration across multiple Web databases. Different types of information about query interface schemas have been used to match attributes between schemas. Relying on a single aspect of information is not sufficient and the matching results of individual matchers are often inaccurate and uncertain. The evidence theory is the state-of-the-art approach for combining multiple sources of uncertain information. However, traditional evidence theory has the limitations of treating individual matchers in different matching tasks equally for query interface matching, which reduces matching performance. This paper proposes a novel query interface matching approach based on extended evidence theory for Deep Web. Our approach firstly introduces the dynamic prediction procedure of different matchers' credibilities. Then, it extends traditional evidence theory with the credibilities and uses exponentially weighted evidence theory to combine the results of multiple matchers. Finally, it performs matching decision in terms of some heuristics to obtain the final matches. Our approach overcomes the shortage of traditional method and can adapt to different matching tasks. Experimental results demonstrate the feasibility and effectiveness of our proposed approach.
引用
收藏
页码:537 / 547
页数:11
相关论文
共 20 条
[1]  
[Anonymous], 2004, PRACT, DOI [DOI 10.1145/1007568.1007582, DOI 10.1159/000075637]
[2]  
[Anonymous], P INT WORKSH NEW TRE
[3]  
[Anonymous], 2003, IIWeb
[4]   UPPER AND LOWER PROBABILITIES INDUCED BY A MULTIVALUED MAPPING [J].
DEMPSTER, AP .
ANNALS OF MATHEMATICAL STATISTICS, 1967, 38 (02) :325-&
[5]  
Do HongHai., 2002, P INT C VERY LARGE D, P610
[6]  
Doan AnHai., 2001, ACM Sigmod Record, V30, P509, DOI DOI 10.1145/375663.375731
[7]  
DRAGUT E., 2006, P 22 INT C DAT ENG I, P679
[8]   APPROXIMATE STRING MATCHING [J].
HALL, PAV ;
DOWLING, GR .
COMPUTING SURVEYS, 1980, 12 (04) :381-402
[9]  
He, 2004, KDD 04, P148
[10]  
HE B., 2003, Proceedings of ACM SIGMOD, P217, DOI DOI 10.1145/872757.872784