基于属性贡献的k近邻分类器

Qianqian Qiu, Min Li, Sijie Shen, Shaobo Deng, Sujie Guan
{"title":"基于属性贡献的k近邻分类器","authors":"Qianqian Qiu, Min Li, Sijie Shen, Shaobo Deng, Sujie Guan","doi":"10.1109/ACAIT56212.2022.10137909","DOIUrl":null,"url":null,"abstract":"K-nearest neighbor algorithm (KNN) is one of the most representative methods in data mining classification techniques. However, the KNN algorithm has a problem that when the traditional Euclidean distance formula is used to calculate the nearest neighbor distance, we ignore the relationship between attributes in the feature space. To tackle this issue, a covariance matrix is used to calculate the attribute contribution of the samples in order to solve the above problem. So an attribute contribution-based k-nearest neighbor classifier (ACWKNN) is proposed in this paper. The proposed algorithm is compared and experimented on the UCI standard dataset, and the results show that the method outperforms other KNN algorithms.","PeriodicalId":398228,"journal":{"name":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","volume":"145 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An Attribute Contribution-Based K-Nearest Neighbor Classifier\",\"authors\":\"Qianqian Qiu, Min Li, Sijie Shen, Shaobo Deng, Sujie Guan\",\"doi\":\"10.1109/ACAIT56212.2022.10137909\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"K-nearest neighbor algorithm (KNN) is one of the most representative methods in data mining classification techniques. However, the KNN algorithm has a problem that when the traditional Euclidean distance formula is used to calculate the nearest neighbor distance, we ignore the relationship between attributes in the feature space. To tackle this issue, a covariance matrix is used to calculate the attribute contribution of the samples in order to solve the above problem. So an attribute contribution-based k-nearest neighbor classifier (ACWKNN) is proposed in this paper. The proposed algorithm is compared and experimented on the UCI standard dataset, and the results show that the method outperforms other KNN algorithms.\",\"PeriodicalId\":398228,\"journal\":{\"name\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"volume\":\"145 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2022-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACAIT56212.2022.10137909\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 6th Asian Conference on Artificial Intelligence Technology (ACAIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACAIT56212.2022.10137909","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

k近邻算法(KNN)是数据挖掘分类技术中最具代表性的方法之一。然而,KNN算法存在一个问题,即在使用传统的欧几里得距离公式计算最近邻距离时,忽略了特征空间中属性之间的关系。为了解决这个问题,我们使用协方差矩阵来计算样本的属性贡献,从而解决上述问题。为此,本文提出了一种基于属性贡献的k近邻分类器(ACWKNN)。在UCI标准数据集上进行了比较和实验,结果表明该算法优于其他KNN算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
An Attribute Contribution-Based K-Nearest Neighbor Classifier
K-nearest neighbor algorithm (KNN) is one of the most representative methods in data mining classification techniques. However, the KNN algorithm has a problem that when the traditional Euclidean distance formula is used to calculate the nearest neighbor distance, we ignore the relationship between attributes in the feature space. To tackle this issue, a covariance matrix is used to calculate the attribute contribution of the samples in order to solve the above problem. So an attribute contribution-based k-nearest neighbor classifier (ACWKNN) is proposed in this paper. The proposed algorithm is compared and experimented on the UCI standard dataset, and the results show that the method outperforms other KNN algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Transformer with Global and Local Interaction for Pedestrian Trajectory Prediction The Use of Explainable Artificial Intelligence in Music—Take Professor Nick Bryan-Kinns’ “XAI+Music” Research as a Perspective Playing Fight the Landlord with Tree Search and Hidden Information Evaluation Evaluation Method of Innovative Economic Benefits of Enterprise Human Capital Based on Deep Learning An Attribute Contribution-Based K-Nearest Neighbor Classifier
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1