Qi Yu, Y. Miché, A. Sorjamaa, A. Guillén, A. Lendasse, E. Séverin
{"title":"OP-KNN: Method and Applications","authors":"Qi Yu, Y. Miché, A. Sorjamaa, A. Guillén, A. Lendasse, E. Séverin","doi":"10.1155/2010/597373","DOIUrl":null,"url":null,"abstract":"This paper presents a methodology named Optimally Pruned K-Nearest Neighbors (OP-KNNs) which has the advantage of competing with state-of-the-art methods while remaining fast. It builds a one hidden-layer feedforward neural network using K-Nearest Neighbors as kernels to perform regression. Multiresponse Sparse Regression (MRSR) is used in order to rank each kth nearest neighbor and finally Leave-One-Out estimation is used to select the optimal number of neighbors and to estimate the generalization performances. Since computational time of this method is small, this paper presents a strategy using OP-KNN to perform Variable Selection which is tested successfully on eight real-life data sets from different application fields. In summary, the most significant characteristic of this method is that it provides good performance and a comparatively simple model at extremely high-learning speed.","PeriodicalId":7288,"journal":{"name":"Adv. Artif. Neural Syst.","volume":"51 1","pages":"597373:1-597373:6"},"PeriodicalIF":0.0000,"publicationDate":"2010-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"6","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Adv. Artif. Neural Syst.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1155/2010/597373","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 6
Abstract
This paper presents a methodology named Optimally Pruned K-Nearest Neighbors (OP-KNNs) which has the advantage of competing with state-of-the-art methods while remaining fast. It builds a one hidden-layer feedforward neural network using K-Nearest Neighbors as kernels to perform regression. Multiresponse Sparse Regression (MRSR) is used in order to rank each kth nearest neighbor and finally Leave-One-Out estimation is used to select the optimal number of neighbors and to estimate the generalization performances. Since computational time of this method is small, this paper presents a strategy using OP-KNN to perform Variable Selection which is tested successfully on eight real-life data sets from different application fields. In summary, the most significant characteristic of this method is that it provides good performance and a comparatively simple model at extremely high-learning speed.
本文提出了一种称为最优修剪k近邻(OP-KNNs)的方法,该方法具有与最先进的方法竞争的优势,同时保持快速。以k近邻为核构建了一个单隐层前馈神经网络进行回归。使用多响应稀疏回归(MRSR)对每个最近邻进行排序,最后使用留一估计(left - one - out)选择最优近邻数量并估计泛化性能。由于该方法的计算时间小,本文提出了一种利用OP-KNN进行变量选择的策略,并在不同应用领域的8个实际数据集上进行了成功的测试。综上所述,该方法最大的特点是在极高的学习速度下提供了良好的性能和相对简单的模型。