EXTRACTING ACCURATE DATA FROM MUL A FROM MULTIPLE CONFLIC TIPLE CONFLICTING INFORMATION ON WEB SOURCES

Q3 Computer Science

International Journal of Communication Networks and Information Security Pub Date : 2014-01-01 DOI:10.47893/ijcns.2014.1096

Akshata B. Angadi, Karuna C. Gull, Padmashri Desai

{"title":"EXTRACTING ACCURATE DATA FROM MUL A FROM MULTIPLE CONFLIC TIPLE CONFLICTING\nINFORMATION ON WEB SOURCES","authors":"Akshata B. Angadi, Karuna C. Gull, Padmashri Desai","doi":"10.47893/ijcns.2014.1096","DOIUrl":null,"url":null,"abstract":"For The World-Wide Web has become the most important information source for most of us. As different websites often provide conflicting information there is no guarantee for the correctness of the data. Among multiple conflict results, can we automatically identify which one is likely the true fact?, In this paper our experiments show that Fact finder, a supporter for user to resolve the problem, successfully finds true facts among conflicting information, and identifies Trust worthy websites better than the popular search engines. In our paper we give ratings based on two things- popularity or the hits & number of occurrences of same data. As we can’t give preference only to popularity, we have considered another rating i.e. about number of occurrences of same data in several other websites, which are less popular. This paper helps user to get resolved by conflicting facts from multiple websites on two basis. Further by considering few more relations we can develop a search engine that truly helps the user to resolve the Veracity problem.","PeriodicalId":38851,"journal":{"name":"International Journal of Communication Networks and Information Security","volume":"4 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2014-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Communication Networks and Information Security","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.47893/ijcns.2014.1096","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Computer Science","Score":null,"Total":0}

引用次数: 0

Abstract

For The World-Wide Web has become the most important information source for most of us. As different websites often provide conflicting information there is no guarantee for the correctness of the data. Among multiple conflict results, can we automatically identify which one is likely the true fact?, In this paper our experiments show that Fact finder, a supporter for user to resolve the problem, successfully finds true facts among conflicting information, and identifies Trust worthy websites better than the popular search engines. In our paper we give ratings based on two things- popularity or the hits & number of occurrences of same data. As we can’t give preference only to popularity, we have considered another rating i.e. about number of occurrences of same data in several other websites, which are less popular. This paper helps user to get resolved by conflicting facts from multiple websites on two basis. Further by considering few more relations we can develop a search engine that truly helps the user to resolve the Veracity problem.

查看原文本刊更多论文

从web资源上的多个冲突信息中提取准确的数据

因为万维网已经成为我们大多数人最重要的信息来源。由于不同的网站经常提供相互矛盾的信息，因此无法保证数据的正确性。在多个冲突结果中，我们能否自动识别出哪一个可能是真实的事实?在本文中，我们的实验表明，事实查找器作为用户解决问题的支持者，能够成功地在冲突的信息中找到真实的事实，并且比流行的搜索引擎更好地识别值得信赖的网站。在我们的论文中，我们基于两件事给出评级——受欢迎程度或相同数据的点击率和出现次数。由于我们不能只考虑受欢迎程度，我们考虑了另一种评级，即相同数据在其他几个不太受欢迎的网站上出现的次数。本文从两个方面帮助用户解决来自多个网站的相互矛盾的事实。此外，通过考虑更多的关系，我们可以开发一个真正帮助用户解决准确性问题的搜索引擎。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

International Journal of Communication Networks and Information Security Computer Science-Computer Networks and Communications

CiteScore

3.30

自引率

0.00%

发文量

171

期刊介绍： International Journal of Communication Networks and Information Security (IJCNIS) is a scholarly peer reviewed international scientific journal published three times (April, August, December) in a year, focusing on theories, methods, and applications in networks and information security. It provides a challenging forum for researchers, industrial professionals, engineers, managers, and policy makers working in the field to contribute and disseminate innovative new work on networks and information security.