Name
Abstract | ||
|---|---|---|
Considerable effort has been made to increase the scale of Linked Data. However, because of the openness of the Semantic Web and the ease of extracting Linked Data from semi-structured sources (e.g., Wikipedia) and unstructured sources, many Linked Data sources often provide conflicting objects for a certain predicate of a real-world entity. Existing methods cannot be trivially extended to resolve conflicts in Linked Data because Linked Data has a scale-free property. In this demonstration, we present a novel system called TruthDiscover, to identify the truth in Linked Data with a scale-free property. First, TruthDiscover leverages the topological properties of the Source Belief Graph to estimate the priori beliefs of sources, which are utilized to smooth the trustworthiness of sources. Second, the Hidden Markov Random Field is utilized to model interdependencies among objects for estimating the trust values of objects accurately. TruthDiscover can visualize the process of resolving conflicts in Linked Data. Experiments results on four datasets show that TruthDiscover exhibits satisfactory accuracy when confronted with data having a scale-free property. |
Year | Venue | Field |
|---|---|---|
2016 | arXiv: Databases | Interdependence,Graph,Data mining,Hidden Markov random field,Trustworthiness,Computer science,Semantic Web,Linked data,Openness to experience,Predicate (grammar),Database |
DocType | Volume | Citations |
Journal | abs/1603.02056 | 1 |
PageRank | References | Authors |
0.36 | 5 | 5 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Wenqiang Liu | 1 | 8 | 3.17 |
| Jun Liu | 2 | 178 | 25.96 |
| Jian Zhang | 3 | 2 | 4.09 |
| Haimeng Duan | 4 | 6 | 2.12 |
| Bifan Wei | 5 | 38 | 6.39 |