{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T14:10:17Z","timestamp":1766067017949,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61371196"],"award-info":[{"award-number":["61371196"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002858","name":"China Postdoctoral Science Foundation","doi-asserted-by":"publisher","award":["2009046425","201003797"],"award-info":[{"award-number":["2009046425","201003797"]}],"id":[{"id":"10.13039\/501100002858","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2934469","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T15:28:28Z","timestamp":1565623708000},"page":"143479-143489","source":"Crossref","is-referenced-by-count":3,"title":["An Unsupervised Approach of Truth Discovery From Multi-Sourced Text Data"],"prefix":"10.1109","volume":"7","author":[{"given":"Chen","family":"Chang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jianjun","family":"Cao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3989-377X","authenticated-orcid":false,"given":"Qibin","family":"Zheng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Guojun","family":"Lv","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nianfeng","family":"Weng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoxiong","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0699-9455","authenticated-orcid":false,"given":"Hongmei","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1242","article-title":"RAND-WALK: A latent variable model approach to word embeddings","author":"arora","year":"2015","journal-title":"Comput Sci"},{"key":"ref38","first-page":"1","article-title":"A simple but tough-to-beat baseline for sentence embeddings","author":"arora","year":"2017","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref33","first-page":"99","article-title":"CQARank: Jointly model topics and expertise in community question answering","author":"liu","year":"2013","journal-title":"Proc 22nd ACM Int Conf Inf Knowl Manage (CIKM)"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/1571941.1571973"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401994"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219977"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ASRU.2015.7404872"},{"key":"ref36","first-page":"858","article-title":"Answer Extraction as Sequence Tagging with Tree Edit Distance","author":"yao","year":"2013","journal-title":"Proc NAACL-HLT"},{"key":"ref35","article-title":"Sentence similarity learning by lexical decomposition and composition","author":"wang","year":"2017","journal-title":"arXiv 1602 07019"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2396761.2398493"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2559481"},{"key":"ref40","first-page":"1","article-title":"Semi-supervised classification with graph convolutional networks","author":"kipf","year":"2016","journal-title":"Proc Int Conf Learn Represent (ICLR)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783277"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488476"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168656"},{"key":"ref14","first-page":"1","article-title":"A probabilistic model for estimating real-valued truth from conflicting sources","author":"zhao","year":"2012","journal-title":"Proc Int'l Workshop on Quality in Databases"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.23919\/TST.2017.8195344"},{"key":"ref16","article-title":"Restricted Boltzmann machines for robust and fast latent truth discovery","author":"broelemann","year":"0","journal-title":"Proc VLDB Endowment"},{"article-title":"Neural network architecture for credibility assessment of textual claims","year":"2018","author":"singh","key":"ref17"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/MASS.2017.26"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/2897350.2897352"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098129"},{"key":"ref4","first-page":"2324","article-title":"Making better informed trust decisions with generalized fact-finding","author":"pasternack","year":"2011","journal-title":"Proc IJCAI"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783314"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113275"},{"key":"ref6","first-page":"877","article-title":"Knowing what to believe (when you already know something)","author":"pasternack","year":"2010","journal-title":"Proc 23rd Int Conf Comput Linguistics (COLING)"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018688"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/1718487.1718504"},{"key":"ref8","first-page":"2946","article-title":"Crowdsourcing for multiple-choice question answering","author":"aydin","year":"2014","journal-title":"Proc IAAI"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687690"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.14778\/2535568.2448943"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.14778\/2735496.2735505"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2346806"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/2983323.2983661"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.14778\/2777598.2777603"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2017.60"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.3115\/1609067.1609130"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/2185677.2185737"},{"key":"ref41","first-page":"2858","article-title":"MTruths: An approach of multiple truths finding from Web information","volume":"53","author":"ruxia","year":"2016","journal-title":"J Comput Res Develop"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IPSN.2014.6846739"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767859"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.5220\/0005781800870097"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08794511.pdf?arnumber=8794511","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:33:08Z","timestamp":1641987188000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8794511\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":42,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2934469","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}