Reconciling Schema Matching Networks Through Crowdsourcing
Journal Title: EAI Endorsed Transactions on Collaborative Computing - Year 2015, Vol 1, Issue 2
Abstract
for data integration purposes. Although several automatic schema matching tools have been developed, their results are often incomplete or erroneous. To obtain a correct set of correspondences, usually human effort is required to validate the generated correspondences. This validation process is often costly, as it is performed by highly skilled experts. Our paper analyzes how to leverage crowdsourcing techniques to validate the generated correspondences by a large group of non-experts. In our work we assume that one needs to establish attribute correspondences not only between two schemas but in a network. We also assume that the matching is realized in a pairwise fashion, in the presence of consistency expectations about the network of attribute correspondences. We demonstrate that formulating these expectations in the form of integrity constraints can improve the process of reconciliation. As in the case of crowdsourcing the user’s input is unreliable, we need specific aggregation techniques to obtain good quality. We demonstrate that consistency constraints can not only improve the quality of aggregated answers, but they also enable us to more reliably estimate the quality answers of individual workers and detect spammers. Moreover, these constraints also enable to minimize the necessary human effort needed, for the same expected quality of results.
Authors and Affiliations
Nguyen Quoc Viet Hung, Nguyen Thanh Tam, Zoltán Miklós, Karl Aberer
Keywords
Related Articles
- EP ID EP45684
- DOI http://dx.doi.org/10.4108/cc.1.2.e2
- Views 452
- Downloads 0
A Highly Concurrent Replicated Data Structure EAI Endorsed Transactions
Well defined concurrent replicated data structure is very important to design collaborative editing system, particularly, certain properties like out-of-order execution of concurrent operations and data convergence. In t...
Automated Dimension Determination for NMF-based Incremental Collaborative Filtering
The nonnegative matrix factorization (NMF) based collaborative filtering t e chniques h a ve a c hieved great success in product recommendations. It is well known that in NMF, the dimensions of the factor matrices have t...
Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings
Aggregation is a crucial task in swarm robotics to ensure cooperation. We investigate the task of aggregation on an area specified indirectly by certain environmental features, here it is a light distribution. We extend...
Critically loaded k-limited polling systems
We consider a two-queue polling model with switch-over times and k-limited service (serve at most ki customers during one visit period to queue i) in each queue. The major benefit of the k-limited service discipline is t...
Optimistic Scheduling: facilitating the collaboration by prioritizing the individual needs
The collaboration among people is one of the key factors for the optimization of many processes and activities. The efficiency and the effectiveness of the collaboration has an intrinsic value which significantly affects...