Entropy a new measure to gauge search engine optimisation

Q3 Business, Management and Accounting
S. Lakshmi, B. Sathiyabhama, K. Batri
{"title":"Entropy a new measure to gauge search engine optimisation","authors":"S. Lakshmi, B. Sathiyabhama, K. Batri","doi":"10.1504/IJENM.2018.10015770","DOIUrl":null,"url":null,"abstract":"This article tries to analyse, and measure the uncertainty associated with the relevant document selection in web-search engines. The number of index terms, and their occurrence frequency influences the relevance calculation. The variation in term frequency either in processed web documents or in users' query influences the relevance calculation. This leads to an uncertainty associated with the document selection, and it is relevance calculation. In this article, we proposed a new measure called entropy. The entropy can be measured by varying the documents' term frequency or user's query term frequency. As the web documents can't be changed, we used variation in user's query term frequency to measure the uncertainty associated with the document selection in web-search engines. The query's term frequency is varied and given to the search engines. namely 'Google', and 'Bing' The high uncertainty gives scope for search engine optimisation. From the high uncertainty search engines, we can extract more relevant documents.","PeriodicalId":39284,"journal":{"name":"International Journal of Enterprise Network Management","volume":"9 1","pages":"189"},"PeriodicalIF":0.0000,"publicationDate":"2018-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Enterprise Network Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1504/IJENM.2018.10015770","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"Business, Management and Accounting","Score":null,"Total":0}
引用次数: 4

Abstract

This article tries to analyse, and measure the uncertainty associated with the relevant document selection in web-search engines. The number of index terms, and their occurrence frequency influences the relevance calculation. The variation in term frequency either in processed web documents or in users' query influences the relevance calculation. This leads to an uncertainty associated with the document selection, and it is relevance calculation. In this article, we proposed a new measure called entropy. The entropy can be measured by varying the documents' term frequency or user's query term frequency. As the web documents can't be changed, we used variation in user's query term frequency to measure the uncertainty associated with the document selection in web-search engines. The query's term frequency is varied and given to the search engines. namely 'Google', and 'Bing' The high uncertainty gives scope for search engine optimisation. From the high uncertainty search engines, we can extract more relevant documents.
熵——衡量搜索引擎优化的一种新方法
本文试图分析和衡量网络搜索引擎中相关文档选择的不确定性。索引项的数量及其出现频率影响相关性计算。处理后的网络文档或用户查询中术语频率的变化会影响相关性计算。这导致了与文档选择相关的不确定性,这就是相关性计算。在这篇文章中,我们提出了一种新的度量,称为熵。熵可以通过改变文档的术语频率或用户的查询术语频率来测量。由于网络文档是不可更改的,我们使用用户查询词频率的变化来衡量网络搜索引擎中与文档选择相关的不确定性。查询的术语频率是可变的,并提供给搜索引擎。即“谷歌”和“必应”。高不确定性为搜索引擎优化提供了空间。从高不确定性的搜索引擎中,我们可以提取更多相关的文档。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Enterprise Network Management
International Journal of Enterprise Network Management Business, Management and Accounting-Management of Technology and Innovation
CiteScore
0.90
自引率
0.00%
发文量
28
×
引用
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学术官方微信