Faster algorithm for truth discovery via range cover

Ziyun Huang, Hu Ding, Jinhui Xu

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

1 Citation (Scopus)

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

Fingerprint

Fast Algorithm
Cover
Range of data
Data structures
Data Structures
Resolve
High-dimensional
Truth
Polynomials
Heuristics
Optimization Problem
Polynomial
Approximation

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

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
Huang, Ziyun ; Ding, Hu ; Xu, Jinhui. / Faster algorithm for truth discovery via range cover. Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. editor / Faith Ellen ; Antonina Kolokolova ; Jorg-Rudiger Sack. Springer Verlag, 2017. pp. 461-472 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{81b8ee214b724109960c717d3fad5d4f,
title = "Faster algorithm for truth discovery via range cover",
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.",
author = "Ziyun Huang and Hu Ding and Jinhui Xu",
year = "2017",
month = "1",
day = "1",
doi = "10.1007/978-3-319-62127-2_39",
language = "English (US)",
isbn = "9783319621265",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "461--472",
editor = "Faith Ellen and Antonina Kolokolova and Jorg-Rudiger Sack",
booktitle = "Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings",
address = "Germany",

}

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. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 10389 LNCS, Springer Verlag, pp. 461-472, 15th International Symposium on Algorithms and Data Structures, WADS 2017, St. John’s, Canada, 7/31/17. https://doi.org/10.1007/978-3-319-62127-2_39

Faster algorithm for truth discovery via range cover. / Huang, Ziyun; Ding, Hu; Xu, Jinhui.

Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings. ed. / Faith Ellen; Antonina Kolokolova; Jorg-Rudiger Sack. Springer Verlag, 2017. p. 461-472 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 10389 LNCS).

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

TY - GEN

T1 - Faster algorithm for truth discovery via range cover

AU - Huang, Ziyun

AU - Ding, Hu

AU - Xu, Jinhui

PY - 2017/1/1

Y1 - 2017/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=85025157359&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85025157359&partnerID=8YFLogxK

U2 - 10.1007/978-3-319-62127-2_39

DO - 10.1007/978-3-319-62127-2_39

M3 - Conference contribution

AN - SCOPUS:85025157359

SN - 9783319621265

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 461

EP - 472

BT - Algorithms and Data Structures - 15th International Symposium, WADS 2017, Proceedings

A2 - Ellen, Faith

A2 - Kolokolova, Antonina

A2 - Sack, Jorg-Rudiger

PB - Springer Verlag

ER -

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