Name
Abstract | ||
|---|---|---|
Record linkage (RL) refers to the task of finding records in a data set that refer to the same entity across different data sources (e.g., data files, books, websites, databases), which is a long-standing challenge in database management. Algorithmic approaches have been proposed to improve RL quality, but remain far from perfect. Crowdsourcing offers a more accurate but expensive (and slow) way to bring human insight into the process. In this paper, we propose a new probabilistic model, namely CrowdLink, to tackle the above limitations. In particular, our model gracefully handles the crowd error and the correlation among different pairs, as well as enables us to decompose the records into small pieces (i.e. attributes) so that crowdsourcing workers can easily verify. Further, we develop efficient and effective algorithms to select the most valuable questions, in order to reduce the monetary cost of crowdsourcing. We conducted extensive experiments on both synthetic and real-world datasets. The experimental results verified the effectiveness and the applicability of our model. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2795218.2795222 | ExploreDB@SIGMOD/PODS |
Field | DocType | Citations |
Record linkage,Data mining,Data exploration,Computer science,Crowdsourcing,Statistical model,Data file,Database | Conference | 1 |
PageRank | References | Authors |
0.35 | 9 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chen Jason Zhang | 1 | 161 | 8.28 |
| Rui Meng | 2 | 48 | 3.35 |
| Lei Chen | 3 | 6239 | 395.84 |
| Feida Zhu | 4 | 1212 | 67.23 |