增强从web中自动提取top-k列表

D. Patil, N. Dhawas
{"title":"增强从web中自动提取top-k列表","authors":"D. Patil, N. Dhawas","doi":"10.1109/I2CT.2014.7092331","DOIUrl":null,"url":null,"abstract":"Now a day's World Wide Web is considered as biggest resource of information. This large database which contains information in all area but finding particular information or extracting accurate data from web is difficult. The strong reason behind this sentence is that the data available on this huge database is not in same format. When data is in particular format you can extract information without any difficulty when extract data from HTML pages, we select data easily with the help of tags. This paper is extracting top-k list from all available web database which contain data either in structured or unstructured format. An algorithm is implemented for this reason which provides an accurate and faster generation of top-k list.","PeriodicalId":384966,"journal":{"name":"International Conference for Convergence for Technology-2014","volume":"55 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-04-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Enhancing automatic extraction of top-k list from web\",\"authors\":\"D. Patil, N. Dhawas\",\"doi\":\"10.1109/I2CT.2014.7092331\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Now a day's World Wide Web is considered as biggest resource of information. This large database which contains information in all area but finding particular information or extracting accurate data from web is difficult. The strong reason behind this sentence is that the data available on this huge database is not in same format. When data is in particular format you can extract information without any difficulty when extract data from HTML pages, we select data easily with the help of tags. This paper is extracting top-k list from all available web database which contain data either in structured or unstructured format. An algorithm is implemented for this reason which provides an accurate and faster generation of top-k list.\",\"PeriodicalId\":384966,\"journal\":{\"name\":\"International Conference for Convergence for Technology-2014\",\"volume\":\"55 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2014-04-06\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference for Convergence for Technology-2014\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/I2CT.2014.7092331\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference for Convergence for Technology-2014","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/I2CT.2014.7092331","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

现在每天的万维网被认为是最大的信息资源。这个庞大的数据库包含了所有领域的信息,但从网络中找到特定的信息或提取准确的数据是困难的。这句话背后的有力理由是,这个庞大的数据库中可用的数据格式不同。当数据是特定格式时,您可以毫不费力地提取信息;当从HTML页面提取数据时,我们可以借助标记轻松地选择数据。本文从所有可用的web数据库中提取top-k列表,其中包含结构化和非结构化格式的数据。为此实现了一种算法,该算法提供了准确且快速的top-k列表生成。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Enhancing automatic extraction of top-k list from web
Now a day's World Wide Web is considered as biggest resource of information. This large database which contains information in all area but finding particular information or extracting accurate data from web is difficult. The strong reason behind this sentence is that the data available on this huge database is not in same format. When data is in particular format you can extract information without any difficulty when extract data from HTML pages, we select data easily with the help of tags. This paper is extracting top-k list from all available web database which contain data either in structured or unstructured format. An algorithm is implemented for this reason which provides an accurate and faster generation of top-k list.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信