使用自动种子选择的主题和基于信任的页面排名

L. Smitha, S. Fatima
{"title":"使用自动种子选择的主题和基于信任的页面排名","authors":"L. Smitha, S. Fatima","doi":"10.1109/IACC.2017.0165","DOIUrl":null,"url":null,"abstract":"Vast growth and the broad accessibility of data on the web have driven the surge of exploration movement in the zone of data retrieval on the Web. Topic and Trust are the important factors for data retrieval framework. As the extent of the web is huge, it is difficult to fulfill the user's need. To this end, the Web offers a rich site of data, which communicates through the hyperlinks. This paper explains the idea of improving PageRank, \"Upgraded Page Rank with Topic utilizing Trust Component\" which has the vast limit as compared with Conventional Page Rank Algorithm. In Page Rank algorithm, Page Rank score of a page ignores whether a page is relevant to a query or not, this becomes drawback and in the paper, a solution is presented by taking trust into consideration along with topical aspects.","PeriodicalId":248433,"journal":{"name":"2017 IEEE 7th International Advance Computing Conference (IACC)","volume":"64 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Topical and Trust Based Page Ranking Using Automatic Seed Selection\",\"authors\":\"L. Smitha, S. Fatima\",\"doi\":\"10.1109/IACC.2017.0165\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Vast growth and the broad accessibility of data on the web have driven the surge of exploration movement in the zone of data retrieval on the Web. Topic and Trust are the important factors for data retrieval framework. As the extent of the web is huge, it is difficult to fulfill the user's need. To this end, the Web offers a rich site of data, which communicates through the hyperlinks. This paper explains the idea of improving PageRank, \\\"Upgraded Page Rank with Topic utilizing Trust Component\\\" which has the vast limit as compared with Conventional Page Rank Algorithm. In Page Rank algorithm, Page Rank score of a page ignores whether a page is relevant to a query or not, this becomes drawback and in the paper, a solution is presented by taking trust into consideration along with topical aspects.\",\"PeriodicalId\":248433,\"journal\":{\"name\":\"2017 IEEE 7th International Advance Computing Conference (IACC)\",\"volume\":\"64 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 7th International Advance Computing Conference (IACC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IACC.2017.0165\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 7th International Advance Computing Conference (IACC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IACC.2017.0165","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

网络上数据的巨大增长和广泛的可访问性推动了网络上数据检索领域探索运动的激增。主题和信任是构建数据检索框架的重要因素。由于网络的规模巨大,很难满足用户的需求。为此,Web提供了一个丰富的数据站点,这些站点通过超链接进行通信。本文阐述了一种改进PageRank的思想,即“利用信任组件与主题一起升级页面排名”,与传统的页面排名算法相比,它有很大的局限性。在Page Rank算法中,页面的Page Rank分数忽略了页面是否与查询相关,这是一个缺点,本文提出了一种考虑信任和主题方面的解决方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Topical and Trust Based Page Ranking Using Automatic Seed Selection
Vast growth and the broad accessibility of data on the web have driven the surge of exploration movement in the zone of data retrieval on the Web. Topic and Trust are the important factors for data retrieval framework. As the extent of the web is huge, it is difficult to fulfill the user's need. To this end, the Web offers a rich site of data, which communicates through the hyperlinks. This paper explains the idea of improving PageRank, "Upgraded Page Rank with Topic utilizing Trust Component" which has the vast limit as compared with Conventional Page Rank Algorithm. In Page Rank algorithm, Page Rank score of a page ignores whether a page is relevant to a query or not, this becomes drawback and in the paper, a solution is presented by taking trust into consideration along with topical aspects.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信