2026-07-24T11:17:17Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:5926 2024-03-06T10:37:18Z ddc:004 open_access

Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance Ding, Hu Gao, Jing Xu, Jinhui geometric optimization data mining high dimension entropy Truth Discovery is an important problem arising in data analytics related fields such as data mining, database, and big data. It concerns about finding the most trustworthy information from a dataset acquired from a number of unreliable sources. Due to its importance, the problem has been extensively studied in recent years and a number techniques have already been proposed. However, all of them are of heuristic nature and do not have any quality guarantee. In this paper, we formulate the problem as a high dimensional geometric optimization problem, called Entropy based Geometric Variance. Relying on a number of novel geometric techniques (such as Log-Partition and Modified Simplex Lemma), we further discover new insights to this problem. We show, for the first time, that the truth discovery problem can be solved with guaranteed quality of solution. Particularly, we show that it is possible to achieve a (1+eps)-approximation within nearly linear time under some reasonable assumptions. We expect that our algorithm will be useful for other data related applications. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hu Ding and Jing Gao and Jinhui Xu 2016 Is Part Of LIPIcs, Volume 51, 32nd International Symposium on Computational Geometry (SoCG 2016) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.SoCG.2016.34 urn:nbn:de:0030-drops-59264 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.34 eng https://creativecommons.org/licenses/by/3.0/legalcode