{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:41:43Z","timestamp":1740109303969,"version":"3.37.3"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T00:00:00Z","timestamp":1553472000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1422324","IIS-1422591"],"award-info":[{"award-number":["CCF-1422324","IIS-1422591"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1547167","CCF-1656905"],"award-info":[{"award-number":["CNS-1547167","CCF-1656905"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007709","name":"Michigan State University","doi-asserted-by":"publisher","award":["start-up fund"],"award-info":[{"award-number":["start-up fund"]}],"id":[{"id":"10.13039\/100007709","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s00453-019-00562-z","type":"journal-article","created":{"date-parts":[[2019,3,25]],"date-time":"2019-03-25T12:02:46Z","timestamp":1553515366000},"page":"4118-4133","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Faster Algorithm for Truth Discovery via Range Cover"],"prefix":"10.1007","volume":"81","author":[{"given":"Ziyun","family":"Huang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hu","family":"Ding","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhui","family":"Xu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,3,25]]},"reference":[{"key":"562_CR1","first-page":"1","volume":"52","author":"PK Agarwal","year":"2005","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, S.R.: Geometric approximation via coresets. Comb. Comput. Geom. 52, 1\u201330 (2005)","journal-title":"Comb. Comput. Geom."},{"issue":"3","key":"562_CR2","doi-asserted-by":"publisher","first-page":"923","DOI":"10.1137\/070699007","volume":"39","author":"K Chen","year":"2009","unstructured":"Chen, K.: On coresets for k-median and k-means clustering in metric and euclidean spaces and their applications. SIAM J. Comput. 39(3), 923\u2013947 (2009)","journal-title":"SIAM J. Comput."},{"key":"562_CR3","unstructured":"Dan, F., Langberg, M.: A unified framework for approximating and clustering data. In: Proceedings of 43rd Annual ACM Symposium on Theory of Computing, pp. 569\u2013578 (2011)"},{"key":"562_CR4","unstructured":"Ding, H., Gao, J., Xu, J.: Finding global optimum for truth discovery: entropy based geometric variance. Leibniz International Proceedings in Informatics (LIPIcs). In: 32nd International Symposium on Computational Geometry (SoCG 2016), vol. 51, pp. 34:1\u201334:16 (2016)"},{"issue":"1","key":"562_CR5","first-page":"550","volume":"2","author":"XL Dong","year":"2009","unstructured":"Dong, X.L., Berti-Equille, L., Srivastava, D.: Integrating conflicting data: the role of source dependence. PVLDB 2(1), 550\u2013561 (2009)","journal-title":"PVLDB"},{"key":"562_CR6","volume-title":"Geometric Approximation Algorithms","author":"S Har-Peled","year":"2011","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms, vol. 173. American Mathematical Society, Boston (2011)"},{"key":"562_CR7","unstructured":"Li, Y., Gao, J., Meng, C., Li, Q., Su, L., Zhao, B., Fan, W., Han, J.: A survey on truth discovery, CoRR abs\/1505.02463(2015)"},{"key":"562_CR8","doi-asserted-by":"crossref","unstructured":"Li, H., Zhao, B., Fuxman, A.: The wisdom of minority: discovering and targeting the right group of workers for crowdsourcing. In: Proceedings of the International Conference on World Wide Web (WWW\u201914), pp. 165\u2013176 (2014)","DOI":"10.1145\/2566486.2568033"},{"issue":"4","key":"562_CR9","first-page":"425","volume":"8","author":"Q Li","year":"2014","unstructured":"Li, Q., Li, Y., Gao, J., Su, L., Zhao, B., Demirbas, M., Fan, W., Han, J.: A confidence-aware approach for truth discovery on long-tail data. PVLDB 8(4), 425\u2013436 (2014)","journal-title":"PVLDB"},{"key":"562_CR10","doi-asserted-by":"crossref","unstructured":"Li, Q., Li, Y., Gao, J., Zhao, B., Fan, W., Han, J.: Resolving conflicts in heterogeneous data by truth discovery and source reliability estimation. In: Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD\u201914), pp. 1187\u20131198 (2014)","DOI":"10.1145\/2588555.2610509"},{"key":"562_CR11","unstructured":"Pasternack, J., Roth, D.: Knowing what to believe (when you already know something). In: Proceedings of the International Conference on Computational Linguistics (COLING\u201910), pp. 877\u2013885 (2010)"},{"key":"562_CR12","unstructured":"Whitehill, J., Ruvolo, P., Wu, T., Bergsma, J., Movellan, J.: Whose vote should count more: optimal integration of labelers of unknown expertise. In: Advances in Neural Information Processing Systems (NIPS\u201909), pp. 2035\u20132043 (2009)"},{"key":"562_CR13","doi-asserted-by":"crossref","unstructured":"Yin, X., Han, J., Yu, P.S.: Truth discovery with multiple conflicting information providers on the web. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD\u201907), pp. 1048\u20131052 (2007)","DOI":"10.1145\/1281192.1281309"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00562-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00562-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T06:35:38Z","timestamp":1589697338000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00562-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,3,25]]},"references-count":13,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["562"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00562-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,3,25]]},"assertion":[{"value":"14 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 February 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"25 March 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}