Classical and fast parameters tuning in nearest neighbors with stop condition

Samya Tajmouati (), Bouazza El Wahbi and Mohamed Dakkon
Additional contact information
Samya Tajmouati: Mohammed V University in Rabat
Bouazza El Wahbi: Ibn Tofail University
Mohamed Dakkon: Abdelmalek Essaâdi University, FSJES

OPSEARCH, 2023, vol. 60, issue 3, No 1, 1063-1081

Abstract: Abstract In this paper, we study the convergence of the algorithms employed by Classical Parameters Tuning in Nearest Neighbors (CPTO-WNN) and Fast Parameters Tuning in Nearest Neighbors (FPTO-WNN). CPTO-WNN and FPTO-WNN are two methodologies that perform the selection of weighted nearest neighbors parameters in time series setting. To do so, each methodology employs an algorithm named WNNoptimization. The WNNoptimization algorithm employs a method inspired by time series cross validation to pick automatically the weighted nearest neighbors parameters. Practically, it computes the global accuracy measure over the test sets, for different values of weighted nearest neighbors parameters and returns the ones for which the accuracy measure is minimal. Compared to CPTO-WNN, FPTO-WNN presents the advantage of reducing time complexity. However, when we are faced with many iterations, both methods raise concerns about computational time. One solution is to introduce a stop condition if the algorithms are convergent. Real data examples on retail and food services sales in the USA and milk production in the UK are analyzed to demonstrate the convergence of the algorithms. As a result, we propose a stop condition allowing the reduction of time complexity while maintaining a good precision. We compare the forecasting performance and time complexity of CPTO-WNN and FPTO-WNN after implementing the proposed stop condition. Experiments show that the introduction of the proposed stop condition provides good accuracy along with lower computational time.

Keywords: Convergence; Nearest neighbors; Time series; Cross validation; Time complexity; Stop condition (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-023-00650-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:60:y:2023:i:3:d:10.1007_s12597-023-00650-3

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-023-00650-3

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().