Grouping instances in kNN for classification based on computer mouse features

D. Chudá, Peter Krátky
{"title":"Grouping instances in kNN for classification based on computer mouse features","authors":"D. Chudá, Peter Krátky","doi":"10.1145/2812428.2812454","DOIUrl":null,"url":null,"abstract":"Computer mouse usage features could be used to distinguish web page visitors. Particular data instances representing user's navigation actions are insufficient when used separately to perform classification with basic k-nearest neighbors (kNN) classifier. We propose a modification of kNN method in which instances of the same class form groups. Finding the nearest neighbors is based on measuring distance between histograms representing distributions of values for the corresponding groups. The paper provides a series of experiments on dataset from 100 web visitors. It describes comparison of several distance metrics as well as different levels of grouping. Combination of non-parametric tests statistics for measuring distance and suitable size of groups improves classification success rate significantly.","PeriodicalId":316788,"journal":{"name":"International Conference on Computer Systems and Technologies","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Computer Systems and Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2812428.2812454","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5

Abstract

Computer mouse usage features could be used to distinguish web page visitors. Particular data instances representing user's navigation actions are insufficient when used separately to perform classification with basic k-nearest neighbors (kNN) classifier. We propose a modification of kNN method in which instances of the same class form groups. Finding the nearest neighbors is based on measuring distance between histograms representing distributions of values for the corresponding groups. The paper provides a series of experiments on dataset from 100 web visitors. It describes comparison of several distance metrics as well as different levels of grouping. Combination of non-parametric tests statistics for measuring distance and suitable size of groups improves classification success rate significantly.
基于鼠标特征的kNN分类实例分组
电脑鼠标的使用特点可以用来区分网页访问者。当单独使用基本k近邻(kNN)分类器执行分类时,表示用户导航操作的特定数据实例是不够的。我们提出了一种改进的kNN方法,其中相同类的实例组成组。找到最近的邻居是基于测量直方图之间的距离,直方图表示对应组的值的分布。本文对100个网络访问者的数据集进行了一系列实验。它描述了几种距离度量的比较以及不同级别的分组。测量距离的非参数检验统计量与合适的分组大小相结合,显著提高了分类成功率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信