以用户为中心的网络数据噪声学习方法

Julius Onyancha, V. Plekhanova
{"title":"以用户为中心的网络数据噪声学习方法","authors":"Julius Onyancha, V. Plekhanova","doi":"10.1109/ISKE.2017.8258833","DOIUrl":null,"url":null,"abstract":"The rate at which web data is collected, stored and accessed by web users has led to high levels of noisiness. As the amount of noise in web data increases, it becomes difficult to find useful information based on a specific user interest. Current research works consider noise as any data that does not form part of the main web page, they propose machine learning algorithms aimed at protecting the main web page content from irrelevant data such as advertisements, banners, external links etc. Depending on what a user is interested on the web, noise web data can be useful data but on the other hand, useful data can be noisy. To learn noise data in a web user profile, a new machine learning algorithm/tool is proposed in this paper. An experimental design setup is presented to validate the performance of the proposed algorithms. The results obtained are compared with the currently available noise web data reduction tools. The experimental results show that the proposed algorithms not only eliminate noise from a web user profile but learn prior to elimination. Learning of noise data prior to elimination contributes to the quality of user profile which is not addressed by the currently available tools.","PeriodicalId":208009,"journal":{"name":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A user-centric approach towards learning noise in web data\",\"authors\":\"Julius Onyancha, V. Plekhanova\",\"doi\":\"10.1109/ISKE.2017.8258833\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The rate at which web data is collected, stored and accessed by web users has led to high levels of noisiness. As the amount of noise in web data increases, it becomes difficult to find useful information based on a specific user interest. Current research works consider noise as any data that does not form part of the main web page, they propose machine learning algorithms aimed at protecting the main web page content from irrelevant data such as advertisements, banners, external links etc. Depending on what a user is interested on the web, noise web data can be useful data but on the other hand, useful data can be noisy. To learn noise data in a web user profile, a new machine learning algorithm/tool is proposed in this paper. An experimental design setup is presented to validate the performance of the proposed algorithms. The results obtained are compared with the currently available noise web data reduction tools. The experimental results show that the proposed algorithms not only eliminate noise from a web user profile but learn prior to elimination. Learning of noise data prior to elimination contributes to the quality of user profile which is not addressed by the currently available tools.\",\"PeriodicalId\":208009,\"journal\":{\"name\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"volume\":\"19 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISKE.2017.8258833\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 12th International Conference on Intelligent Systems and Knowledge Engineering (ISKE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISKE.2017.8258833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

网络用户收集、存储和访问网络数据的速度导致了高度的噪音。随着网络数据中噪音量的增加,基于特定用户兴趣找到有用信息变得越来越困难。目前的研究工作认为噪音是任何不构成主网页一部分的数据,他们提出了机器学习算法,旨在保护主网页内容免受不相关数据(如广告、横幅、外部链接等)的影响。根据用户对网络的兴趣,噪声网络数据可能是有用的数据,但另一方面,有用的数据可能是噪声的。为了学习web用户档案中的噪声数据,本文提出了一种新的机器学习算法/工具。提出了一个实验设计装置来验证所提出算法的性能。所得结果与目前可用的噪声网数据减少工具进行了比较。实验结果表明,所提出的算法不仅能够消除网络用户档案中的噪声,而且能够在消除之前进行学习。在消除噪声之前学习噪声数据有助于提高用户档案的质量,这是目前可用工具无法解决的。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A user-centric approach towards learning noise in web data
The rate at which web data is collected, stored and accessed by web users has led to high levels of noisiness. As the amount of noise in web data increases, it becomes difficult to find useful information based on a specific user interest. Current research works consider noise as any data that does not form part of the main web page, they propose machine learning algorithms aimed at protecting the main web page content from irrelevant data such as advertisements, banners, external links etc. Depending on what a user is interested on the web, noise web data can be useful data but on the other hand, useful data can be noisy. To learn noise data in a web user profile, a new machine learning algorithm/tool is proposed in this paper. An experimental design setup is presented to validate the performance of the proposed algorithms. The results obtained are compared with the currently available noise web data reduction tools. The experimental results show that the proposed algorithms not only eliminate noise from a web user profile but learn prior to elimination. Learning of noise data prior to elimination contributes to the quality of user profile which is not addressed by the currently available tools.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信