基于区域距离的k-NN分类

Swe Swe Aung, I. Nagayama, S. Tamaki
{"title":"基于区域距离的k-NN分类","authors":"Swe Swe Aung, I. Nagayama, S. Tamaki","doi":"10.1109/ICIIBMS.2017.8279719","DOIUrl":null,"url":null,"abstract":"k-Nearest Neighbor (k-NN) is very simple and powerful approach to conceptually approximate real-valued or discrete-valued target function. Many researchers have recently approved that k-NN is a high prediction accuracy for variety of real world systems using many different types of datasets. However, as we know, k-NN is a type of lazy learning algorithms as it has to compare to each of stored training examples for each observed instance. Besides, the prediction accuracy of k-NN is under the influence of K values. Mostly, the higher K values make the algorithm yield lower prediction accuracy according to our experiments. For these issues, this paper focuses on two properties that are to upgrade the classification accuracy by introducing Regional Distance-based k-NN (RD-kNN) and to speed up the processing time performance of k-NN by applying multi-threading approach. For the experiments, we used the real data sets, wine, iris, heart stalog, breast cancer, and breast tissue, from UCI machine learning repository. According to our test cases and simulations carried out, it was also experimentally confirmed that the new approach, RD-kNN, has a better performance than classical k-NN.","PeriodicalId":122969,"journal":{"name":"2017 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Regional distance-based k-NN classification\",\"authors\":\"Swe Swe Aung, I. Nagayama, S. Tamaki\",\"doi\":\"10.1109/ICIIBMS.2017.8279719\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"k-Nearest Neighbor (k-NN) is very simple and powerful approach to conceptually approximate real-valued or discrete-valued target function. Many researchers have recently approved that k-NN is a high prediction accuracy for variety of real world systems using many different types of datasets. However, as we know, k-NN is a type of lazy learning algorithms as it has to compare to each of stored training examples for each observed instance. Besides, the prediction accuracy of k-NN is under the influence of K values. Mostly, the higher K values make the algorithm yield lower prediction accuracy according to our experiments. For these issues, this paper focuses on two properties that are to upgrade the classification accuracy by introducing Regional Distance-based k-NN (RD-kNN) and to speed up the processing time performance of k-NN by applying multi-threading approach. For the experiments, we used the real data sets, wine, iris, heart stalog, breast cancer, and breast tissue, from UCI machine learning repository. According to our test cases and simulations carried out, it was also experimentally confirmed that the new approach, RD-kNN, has a better performance than classical k-NN.\",\"PeriodicalId\":122969,\"journal\":{\"name\":\"2017 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)\",\"volume\":\"123 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIIBMS.2017.8279719\",\"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 International Conference on Intelligent Informatics and Biomedical Sciences (ICIIBMS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIIBMS.2017.8279719","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

k-最近邻(k-NN)是一种简单而强大的概念逼近实值或离散值目标函数的方法。许多研究人员最近已经认可k-NN对于使用许多不同类型数据集的各种现实世界系统具有很高的预测精度。然而,正如我们所知,k-NN是一种惰性学习算法,因为它必须比较每个观察到的实例的每个存储的训练样本。此外,K - nn的预测精度受到K值的影响。大多数情况下,根据我们的实验,K值越高,算法的预测精度越低。针对这些问题,本文重点研究了引入基于区域距离的k-NN (RD-kNN)来提高分类精度和采用多线程方法加快k-NN的处理时间性能两个特性。在实验中,我们使用了来自UCI机器学习存储库的真实数据集,葡萄酒、虹膜、心肌、乳腺癌和乳腺组织。根据我们的测试用例和仿真,实验也证实了新方法RD-kNN比经典k-NN具有更好的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Regional distance-based k-NN classification
k-Nearest Neighbor (k-NN) is very simple and powerful approach to conceptually approximate real-valued or discrete-valued target function. Many researchers have recently approved that k-NN is a high prediction accuracy for variety of real world systems using many different types of datasets. However, as we know, k-NN is a type of lazy learning algorithms as it has to compare to each of stored training examples for each observed instance. Besides, the prediction accuracy of k-NN is under the influence of K values. Mostly, the higher K values make the algorithm yield lower prediction accuracy according to our experiments. For these issues, this paper focuses on two properties that are to upgrade the classification accuracy by introducing Regional Distance-based k-NN (RD-kNN) and to speed up the processing time performance of k-NN by applying multi-threading approach. For the experiments, we used the real data sets, wine, iris, heart stalog, breast cancer, and breast tissue, from UCI machine learning repository. According to our test cases and simulations carried out, it was also experimentally confirmed that the new approach, RD-kNN, has a better performance than classical k-NN.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信