社区主体识别算法:实验与测试结果

Deepak Subramoniam, J. John
{"title":"社区主体识别算法:实验与测试结果","authors":"Deepak Subramoniam, J. John","doi":"10.1109/EEE.2004.1287309","DOIUrl":null,"url":null,"abstract":"We deal with the problem of finding the subject that a given set of pages deals with. The algorithms presented have been designed with a view to provide good results when pages that belong to community (or handle some common topic) are presented to them. When a set of pages are presented, the algorithms return a set of words ordered in the decreasing order of relevance. The words among the first few can be used to identify the topic that the set deals with. The algorithms have been tested by providing them with pages returned from a search engine for a given search query and their performance is assessed based on how high the words used in the search query are placed in the list returned by the algorithm.","PeriodicalId":360167,"journal":{"name":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-03-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Algorithms for community subject-identification: experiments and test results\",\"authors\":\"Deepak Subramoniam, J. John\",\"doi\":\"10.1109/EEE.2004.1287309\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We deal with the problem of finding the subject that a given set of pages deals with. The algorithms presented have been designed with a view to provide good results when pages that belong to community (or handle some common topic) are presented to them. When a set of pages are presented, the algorithms return a set of words ordered in the decreasing order of relevance. The words among the first few can be used to identify the topic that the set deals with. The algorithms have been tested by providing them with pages returned from a search engine for a given search query and their performance is assessed based on how high the words used in the search query are placed in the list returned by the algorithm.\",\"PeriodicalId\":360167,\"journal\":{\"name\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-03-28\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/EEE.2004.1287309\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE International Conference on e-Technology, e-Commerce and e-Service, 2004. EEE '04. 2004","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/EEE.2004.1287309","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

我们处理的问题是找到一组给定页面所涉及的主题。所提出的算法的设计目的是在向属于社区(或处理某些共同主题)的页面展示时提供良好的结果。当呈现一组页面时,算法返回一组按相关性降序排列的单词。前几个单词可以用来识别该集合所涉及的主题。通过向这些算法提供搜索引擎为给定搜索查询返回的页面,对它们进行了测试,并根据搜索查询中使用的单词在算法返回的列表中的位置来评估它们的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Algorithms for community subject-identification: experiments and test results
We deal with the problem of finding the subject that a given set of pages deals with. The algorithms presented have been designed with a view to provide good results when pages that belong to community (or handle some common topic) are presented to them. When a set of pages are presented, the algorithms return a set of words ordered in the decreasing order of relevance. The words among the first few can be used to identify the topic that the set deals with. The algorithms have been tested by providing them with pages returned from a search engine for a given search query and their performance is assessed based on how high the words used in the search query are placed in the list returned by the algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
On the distributed management of SCORM-compliant course contents A new fair micropayment system based on hash chain An enhanced EDCG replica allocation method in ad hoc networks Using element and document profile for information clustering A scheme for MAC isolation to realize effective management in public wireless LAN
×
引用
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