首页> 外文会议>International conference on very large data bases >Reducing Uncertainty of Schema Matching via Crowdsourcing
【24h】

Reducing Uncertainty of Schema Matching via Crowdsourcing

机译:通过众包减少模式匹配的不确定性

获取原文

摘要

Schema matching is a central challenge for data integration systems. Automated tools are often uncertain about schema matchings they suggest, and this uncertainty is inherent since it arises from the inability of the schema to fully capture the semantics of the represented data. Human common sense can often help. Inspired by the popularity and the success of easily accessible crowdsourcing platforms, we explore the use of crowdsourcing to reduce the uncertainty of schema matching. Since it is typical to ask simple questions on crowdsourcing platforms, we assume that each question, namely Correspondence Correctness Question (CCQ), is to ask the crowd to decide whether a given correspondence should exist in the correct matching. We propose frameworks and efficient algorithms to dynamically manage the CCQs, in order to maximize the uncertainty reduction within a limited budget of questions. We develop two novel approaches, namely "Single CCQ" and "Multiple CCQ", which adoptively select, publish and manage the questions. We verified the value of our solutions with simulation and real implementation.
机译:模式匹配是数据集成系统面临的主要挑战。自动化工具通常无法确定它们建议的模式匹配,并且这种不确定性是固有的,因为它是由于模式无法完全捕获所表示数据的语义而引起的。人的常识通常可以提供帮助。受易于访问的众包平台的流行和成功的启发,我们探索了众包的使用,以减少模式匹配的不确定性。由于通常在众包平台上问一些简单的问题,因此我们假设每个问题,即对应正确性问题(CCQ),都是要让人们决定在正确的匹配中是否应该存在给定的对应关系。我们提出了用于动态管理CCQ的框架和有效算法,以便在有限的问题预算范围内最大程度地减少不确定性。我们开发了两种新颖的方法,即“单CCQ”和“多CCQ”,它们分别选择,发布和管理问题。我们通过仿真和实际实施验证了我们解决方案的价值。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号