...
首页> 外文期刊>Cognitive Systems Research >Trustworthy media news content retrieval from web using truth content discovery algorithm
【24h】

Trustworthy media news content retrieval from web using truth content discovery algorithm

机译:值得信赖的媒体新闻内容从Web使用真相内容发现算法检索

获取原文
获取原文并翻译 | 示例
           

摘要

Nowadays, the internet plays a major role in online information retrieval. As, we are well aware the web provides information related all the fields like national, lifestyle, movies, shopping, spirituality, sports, entertainment and much more. One cannot assume that the web retrieved information is believable or trustworthy due to multiple answers to the same query. The paper aims to study many research articles which are related to truth information discovery. However, the paper found that there is no proper research to find trustworthiness of news content which is extracted from multiple information sources with minimum misclassification error and retrieval time. To alleviate these issues, the truth content discovery algorithm is proposed to produce trustworthy information with minimal time along with multiple domain news information. The system provides reliable information from a various source of news provider with minimum classification error. The proposed method ranked the news content index based on query matches from extracted information. It minimizes the query retrieval time and classification error. Based on the experimental evaluation, proposed TCD + J48 algorithm produced the best result compared to existing approaches. It minimizes reduces 7.54 ms the query retrieval time (QRT), 5% Error rate (ER) and 0.98 and Mean Normalized Absolute Distance (MNAD). (C) 2019 Elsevier B.V. All rights reserved.
机译:如今,互联网在在线信息检索中发挥着重要作用。因为,我们很清楚网络提供信息相关的所有领域,如国家,生活方式,电影,购物,灵性,体育,娱乐等等。由于同一查询的多个答案,人们不能假设Web检索信息是可信的或值得信赖的。本文旨在研究许多与真理信息发现相关的研究文章。然而,本文发现,没有适当的研究以找到从多个信息源中提取的新闻内容的可信度,最小错误分类误差和检索时间。为了减轻这些问题,提出了真实内容发现算法,以产生具有最小时间的值得信赖的信息以及多个域新闻信息。该系统提供来自新闻提供商的各种消息来源的可靠信息,具有最小分类错误。所提出的方法基于来自提取信息的查询匹配排列新闻内容索引。它最大限度地减少查询检索时间和分类错误。基于实验评估,与现有方法相比,提出的TCD + J48算法产生了最佳结果。它最大限度地减少了7.54 ms查询检索时间(QRT),5%错误率(ER)和0.98并表示归一化绝对距离(Mnad)。 (c)2019 Elsevier B.v.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号