Grouping instances in kNN for classification based on computer mouse features
D Chudá, P Krátky - Proceedings of the 16th International Conference on …, 2015 - dl.acm.org
D Chudá, P Krátky
Proceedings of the 16th International Conference on Computer Systems and …, 2015•dl.acm.orgComputer 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 …
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 …
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.
ACM Digital Library