Name
Abstract | ||
|---|---|---|
Many real-world applications rely on multiple data sources to provide information on their interested items. Due to the noises and uncertainty in data, given a specific item, the information from different sources may conflict. To make reliable decisions based on these data, it is important to identify the trustworthy information by resolving these conflicts, i.e., the truth discovery problem. Current solutions to this problem detect the veracity of each value jointly with the reliability of each source for each data item. In this way, the efficiency of truth discovery is strictly confined by the problem scale, which in turn limits truth discovery algorithms from being applicable on a large scale. To address this issue, we propose an approximate truth discovery approach, which divides sources and values into groups according to a user-specified approximation criterion. The groups are then used for efficient inter-value influence computation to improve the accuracy. Our approach is applicable to most existing truth discovery algorithms. Experiments on real-world datasets show that our approach improves the efficiency compared to existing algorithms while achieving similar or even better accuracy. The scalability is further demonstrated by experiments on large synthetic datasets. |
Year | DOI | Venue |
|---|---|---|
2015 | 10.1145/2806416.2806444 | ACM International Conference on Information and Knowledge Management |
Field | DocType | Citations |
Data mining,Multiple data,Information retrieval,Trustworthiness,Computer science,Artificial intelligence,Machine learning,Computation,Scalability | Conference | 4 |
PageRank | References | Authors |
0.43 | 17 | 6 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Xianzhi Wang | 1 | 276 | 40.32 |
| Quan Z. Sheng | 2 | 3520 | 301.77 |
| Xiu Susie Fang | 3 | 45 | 5.56 |
| Xue Li | 4 | 2196 | 186.96 |
| Xiaofei Xu | 5 | 408 | 70.26 |
| Lina Yao | 6 | 981 | 93.63 |