Truth Discovery from Multi-Sourced Text Data Based on Ant Colony Optimization

Chen Chang, Jianjun Cao, Guojun Lv, Nianfeng Weng
{"title":"Truth Discovery from Multi-Sourced Text Data Based on Ant Colony Optimization","authors":"Chen Chang, Jianjun Cao, Guojun Lv, Nianfeng Weng","doi":"10.1109/DSAA.2019.00031","DOIUrl":null,"url":null,"abstract":"In the era of information explosion, plenty of data has been generated through a variety of channels, such as social networks, crowdsourcing platforms and blogs. Conflicts and errors are constantly emerging. Truth discovery aims to find trustworthy information from conflicting data by considering source reliability. However, most traditional truth discovery approaches are designed only for structured data, and fail to meet the strong requirements to extract trustworthy information from unstructured raw text data. The major challenges of inferring reliable information on text data stem from the multifactorial property (i.e., an answer may contain multiple different key factors, which may be complex) and the diversity of word usages (i.e., different words may share similar semantic information, but the spelling of which are completely different). To solve these challenges, an ant colony optimization based text data truth discovery model is proposed. Firstly, keywords extracted from the whole answers of the specific question are grouped into a set. Then, we translate the truth discovery problem to a subset optimization problem, and the parallel ant colony optimization is utilized to find correct keywords for each question based on the hypothesis of truth discovery from the whole keywords. After that, the answers to each question can be ranked based on the similarities between keywords of user answers and identified correct keywords found by colony. The experiment results on real dataset show that even the semantic information of text data is complex, our proposed model can still find trustworthy information from complex answers compared with retrieval-based and state-of-the-art approaches.","PeriodicalId":416037,"journal":{"name":"2019 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","volume":"99 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Data Science and Advanced Analytics (DSAA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DSAA.2019.00031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In the era of information explosion, plenty of data has been generated through a variety of channels, such as social networks, crowdsourcing platforms and blogs. Conflicts and errors are constantly emerging. Truth discovery aims to find trustworthy information from conflicting data by considering source reliability. However, most traditional truth discovery approaches are designed only for structured data, and fail to meet the strong requirements to extract trustworthy information from unstructured raw text data. The major challenges of inferring reliable information on text data stem from the multifactorial property (i.e., an answer may contain multiple different key factors, which may be complex) and the diversity of word usages (i.e., different words may share similar semantic information, but the spelling of which are completely different). To solve these challenges, an ant colony optimization based text data truth discovery model is proposed. Firstly, keywords extracted from the whole answers of the specific question are grouped into a set. Then, we translate the truth discovery problem to a subset optimization problem, and the parallel ant colony optimization is utilized to find correct keywords for each question based on the hypothesis of truth discovery from the whole keywords. After that, the answers to each question can be ranked based on the similarities between keywords of user answers and identified correct keywords found by colony. The experiment results on real dataset show that even the semantic information of text data is complex, our proposed model can still find trustworthy information from complex answers compared with retrieval-based and state-of-the-art approaches.
基于蚁群优化的多源文本数据真相发现
在信息爆炸的时代,大量的数据通过社交网络、众包平台、博客等多种渠道产生。冲突和错误不断出现。真相发现的目的是在考虑数据源可靠性的基础上,从相互冲突的数据中发现可信的信息。然而,大多数传统的真值发现方法仅针对结构化数据设计,无法满足从非结构化原始文本数据中提取可信信息的强烈需求。在文本数据上推断可靠信息的主要挑战来自多因素属性(即,一个答案可能包含多个不同的关键因素,这些因素可能很复杂)和单词用法的多样性(即,不同的单词可能共享相似的语义信息,但其拼写完全不同)。为了解决这些问题,提出了一种基于蚁群优化的文本数据真相发现模型。首先,从特定问题的全部答案中提取关键字,将其分组成一组。然后,我们将真值发现问题转化为子集优化问题,利用并行蚁群优化算法,基于真值发现假设,从整个关键字中找到每个问题的正确关键字。然后,根据用户答案的关键词与群体找到的识别正确的关键词之间的相似度,对每个问题的答案进行排序。在真实数据集上的实验结果表明,即使文本数据的语义信息很复杂,与基于检索和最先进的方法相比,我们提出的模型仍然可以从复杂的答案中找到可信的信息。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信