提出了一种基于文档频率的网络爬虫数据集最小化技术

A. Sarhan, Ghada M. Hamissa, Heba E. Elbehiry
{"title":"提出了一种基于文档频率的网络爬虫数据集最小化技术","authors":"A. Sarhan, Ghada M. Hamissa, Heba E. Elbehiry","doi":"10.1109/ICCES.2015.7393008","DOIUrl":null,"url":null,"abstract":"The explosive growth of webpage number on the Web has brought up some problems in the search process. One of these problems is that the general purpose search engines often return too many irrelevant results when users are searching for specific information on a given topic. Another problem is the massive increase in the number of pages to be indexed by Web search systems. In this research, two steps for Web Crawling are used to decrease these difficulties. First step is the feature selection for the datasets used. A proposed algorithm of feature selection, which uses the Document Frequency technique for the term in the category, is presented. Second step is Web page classification. Two famous techniques of Web page classification are used: (i) Support Vector Machine and (ii) Naïve Bayes Classifier. It is concluded that the proposed algorithm, using Document Frequency technique, reduces the redundancy during feature selection and increases accuracy during Web page classification. Complete evaluation is performed, in JAVA, to indicate the effectiveness of our proposed algorithm.","PeriodicalId":227813,"journal":{"name":"2015 Tenth International Conference on Computer Engineering & Systems (ICCES)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Proposed Document Frequency technique for minimizing dataset in Web crawler\",\"authors\":\"A. Sarhan, Ghada M. Hamissa, Heba E. Elbehiry\",\"doi\":\"10.1109/ICCES.2015.7393008\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The explosive growth of webpage number on the Web has brought up some problems in the search process. One of these problems is that the general purpose search engines often return too many irrelevant results when users are searching for specific information on a given topic. Another problem is the massive increase in the number of pages to be indexed by Web search systems. In this research, two steps for Web Crawling are used to decrease these difficulties. First step is the feature selection for the datasets used. A proposed algorithm of feature selection, which uses the Document Frequency technique for the term in the category, is presented. Second step is Web page classification. Two famous techniques of Web page classification are used: (i) Support Vector Machine and (ii) Naïve Bayes Classifier. It is concluded that the proposed algorithm, using Document Frequency technique, reduces the redundancy during feature selection and increases accuracy during Web page classification. Complete evaluation is performed, in JAVA, to indicate the effectiveness of our proposed algorithm.\",\"PeriodicalId\":227813,\"journal\":{\"name\":\"2015 Tenth International Conference on Computer Engineering & Systems (ICCES)\",\"volume\":\"15 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 Tenth International Conference on Computer Engineering & Systems (ICCES)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCES.2015.7393008\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 Tenth International Conference on Computer Engineering & Systems (ICCES)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCES.2015.7393008","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

网页数量的爆炸式增长给搜索过程带来了一些问题。其中一个问题是,当用户搜索给定主题的特定信息时,通用搜索引擎经常返回太多不相关的结果。另一个问题是Web搜索系统需要索引的页面数量的大量增加。在本研究中,我们采用了两个步骤来减少这些困难。第一步是对所使用的数据集进行特征选择。提出了一种利用文档频率技术对分类词进行特征选择的算法。第二步是网页分类。使用了两种著名的网页分类技术:(i)支持向量机和(ii) Naïve贝叶斯分类器。结果表明,该算法利用文档频率技术,减少了特征选择过程中的冗余,提高了网页分类的准确率。在JAVA中执行了完整的评估,以表明我们提出的算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Proposed Document Frequency technique for minimizing dataset in Web crawler
The explosive growth of webpage number on the Web has brought up some problems in the search process. One of these problems is that the general purpose search engines often return too many irrelevant results when users are searching for specific information on a given topic. Another problem is the massive increase in the number of pages to be indexed by Web search systems. In this research, two steps for Web Crawling are used to decrease these difficulties. First step is the feature selection for the datasets used. A proposed algorithm of feature selection, which uses the Document Frequency technique for the term in the category, is presented. Second step is Web page classification. Two famous techniques of Web page classification are used: (i) Support Vector Machine and (ii) Naïve Bayes Classifier. It is concluded that the proposed algorithm, using Document Frequency technique, reduces the redundancy during feature selection and increases accuracy during Web page classification. Complete evaluation is performed, in JAVA, to indicate the effectiveness of our proposed algorithm.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信