Parameter-free surrounding neighborhood based regression methods

İNKAYA T.

Expert Systems with Applications, cilt.199, 2022 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 199
  • Basım Tarihi: 2022
  • Doi Numarası: 10.1016/j.eswa.2022.116881
  • Dergi Adı: Expert Systems with Applications
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus, Academic Search Premier, PASCAL, Aerospace Database, Applied Science & Technology Source, Communication Abstracts, Computer & Applied Sciences, INSPEC, Metadex, Public Affairs Index, Civil Engineering Abstracts
  • Anahtar Kelimeler: Prediction, k-nearest regression, Minimum spanning tree, Relative neighborhood graph, Gabriel graph, NEAREST, GRAPH, CLASSIFIER, PREDICTION, VOLUME
  • Bursa Uludağ Üniversitesi Adresli: Evet

Özet

© 2022 Elsevier LtdIn machine learning, nearest neighbor (NN) regression is one of the most prominent methods for numeric prediction. It estimates the output variable of a new data point by averaging the output variables of the neighboring points. The selection of the neighborhood and its parameter(s) is crucial for the performance of NN regression, however this is still an open issue. This study contributes to the literature by adopting the parameter-free surrounding neighborhood (PSN) concept for NN regression. PSNs are based on proximity graphs, i.e. minimum spanning tree, relative neighborhood graph, and Gabriel graph. They yield a unique neighborhood for each point by combining proximity, connectivity and spatial distribution. The performances of the PSN regression methods are compared with k-nearest neighbors, k-nearest centroid neighbors, and support vector regression using real-world data sets. The statistical tests show that the PSN regression methods perform significantly better than most of the competing approaches. Also, the proposed approaches do not have any parameters to be set.