Faster algorithm for truth discovery via range cover

Ziyun Huang, Hu Ding, Jinhui Xu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Scopus citations

Abstract

Truth discovery is a key problem in data analytics which has received a great deal of attention in recent years. In this problem, we seek to obtain trustworthy information from data aggregated from multiple (possibly) unreliable sources. Most of the existing approaches for this problem are of heuristic nature and do not provide any quality guarantee. Very recently, the first quality-guaranteed algorithm has been discovered. However, the running time of the algorithm depends on the spread ratio of the input points and is fully polynomial only when the spread ratio is relatively small. This could severely restrict the applicability of the algorithm. To resolve this issue, we propose in this paper a new algorithm which yields a (1 + ε)-approximation in near quadratic time for any dataset with constant probability. Our algorithm relies on a data structure called range cover, which is interesting in its own right. The data structure provides a general approach for solving some high dimensional optimization problems by breaking them down into a small number of parametrized cases.

Original languageEnglish (US)
Title of host publicationAlgorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings
EditorsFaith Ellen, Antonina Kolokolova, Jorg-Rudiger Sack
PublisherSpringer Verlag
Pages461-472
Number of pages12
ISBN (Print)9783319621265
DOIs
StatePublished - Jan 1 2017
Event15th International Symposium on Algorithms and Data Structures, WADS 2017 - St. John’s, Canada
Duration: Jul 31 2017Aug 2 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10389 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference15th International Symposium on Algorithms and Data Structures, WADS 2017
CountryCanada
CitySt. John’s
Period7/31/178/2/17

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Faster algorithm for truth discovery via range cover'. Together they form a unique fingerprint.

  • Cite this

    Huang, Z., Ding, H., & Xu, J. (2017). Faster algorithm for truth discovery via range cover. In F. Ellen, A. Kolokolova, & J-R. Sack (Eds.), Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings (pp. 461-472). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-319-62127-2_39