Efficient ranking based on web page importance and personalized search

Mercy Paul Selvan, A. Shekar, D. R. Babu, A. Teja
{"title":"Efficient ranking based on web page importance and personalized search","authors":"Mercy Paul Selvan, A. Shekar, D. R. Babu, A. Teja","doi":"10.1109/ICCSP.2015.7322671","DOIUrl":null,"url":null,"abstract":"This paper is focused on computing importance of a web page in an efficient way. Web page ranking is an essential factor in web search. Many modules and algorithms have been proposed using different resources with different assumptions. The algorithms proposed include Page Rank, Browse Rank, Browse Rank Plus, HITS and many more. Page Rank focuses on ranking a page based on the number of inlinks and outlinks to a page. Whereas Browse Rank focuses on ranking the page based on the value it provides to the user. Several other algorithms have been proposed since, that focuses only on one or two particular factors. This paper proposes ranking a page based on multiple factors that includes reachability, value and user feedback. The major aim is to rank a web page based on these three crucial factors rather than considering one or two factors taken into account by existing methodologies. Every user has a different and unique background and a particular aim when searching for information on the Web. Web search personalization is mainly aimed at tailoring search results to a specific user based on that user's interests and preferences. Major challenges that effective personalized search is affected with includes accurately identifying the user context and organizing the information in such a way that it matches the particular context. An effective mechanism is employed to personalize the search and also to rank the page based on multiple factors.","PeriodicalId":174192,"journal":{"name":"2015 International Conference on Communications and Signal Processing (ICCSP)","volume":"92 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 International Conference on Communications and Signal Processing (ICCSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSP.2015.7322671","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6

Abstract

This paper is focused on computing importance of a web page in an efficient way. Web page ranking is an essential factor in web search. Many modules and algorithms have been proposed using different resources with different assumptions. The algorithms proposed include Page Rank, Browse Rank, Browse Rank Plus, HITS and many more. Page Rank focuses on ranking a page based on the number of inlinks and outlinks to a page. Whereas Browse Rank focuses on ranking the page based on the value it provides to the user. Several other algorithms have been proposed since, that focuses only on one or two particular factors. This paper proposes ranking a page based on multiple factors that includes reachability, value and user feedback. The major aim is to rank a web page based on these three crucial factors rather than considering one or two factors taken into account by existing methodologies. Every user has a different and unique background and a particular aim when searching for information on the Web. Web search personalization is mainly aimed at tailoring search results to a specific user based on that user's interests and preferences. Major challenges that effective personalized search is affected with includes accurately identifying the user context and organizing the information in such a way that it matches the particular context. An effective mechanism is employed to personalize the search and also to rank the page based on multiple factors.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于网页重要性和个性化搜索的高效排名
本文主要研究网页重要性的有效计算方法。网页排名是网页搜索的一个重要因素。许多模块和算法被提出使用不同的资源和不同的假设。提出的算法包括页面排名,浏览排名,浏览排名加上,HITS等等。页面排名侧重于根据页面的链接和外链数量对页面进行排名。而浏览排名则侧重于根据页面提供给用户的价值对页面进行排名。自那以后,人们又提出了其他几种算法,它们只关注一两个特定的因素。本文提出基于可达性、价值和用户反馈等多种因素对页面进行排名。主要目的是基于这三个关键因素对网页进行排名,而不是考虑现有方法中考虑的一两个因素。每个用户在网络上搜索信息时都有不同的、独特的背景和特定的目的。Web搜索个性化的主要目的是根据用户的兴趣和偏好为特定用户定制搜索结果。有效的个性化搜索所面临的主要挑战包括准确地识别用户上下文,并以与特定上下文相匹配的方式组织信息。采用了一种有效的机制来个性化搜索,并根据多个因素对页面进行排名。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Improved scheduling algorithm using dynamic tree construction for wireless sensor networks Design of polyphase FIR filter using bypass feed direct multiplier Implementation of floating point fused basic arithmetic module using Verilog Comparison of conventional flip flops with pulse triggered generation using signal feed through technique A novel 2GHz highly efficiency improved class-E Power Amplifier for Base stations
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1