Papers › Opposite neighborhood: a new method to select reference points of minimal learning machines
Opposite neighborhood: a new method to select reference points of minimal learning machines
Madson Luiz Dantas Dias, Lucas Silva De Sousa, Ajalmar Rêgo da Rocha Neto, Amauri H. de Souza Júnior
This paper introduces a new approach to select reference points in minimal learning machines (MLMs) for classification tasks. The MLM training procedure comprises the selection of a subset of the data, named reference points (RPs), that is used to build a linear regression model between distances taken in the input and output spaces. In this matter, we propose a strategy, named opposite neighborhood (ON), to tackle the problem of selecting RPs by locating RPs out of class-overlapping regions. Experiments were carried out using UCI data sets. As a result, the proposal is able to both produce sparser models and achieve competitive performance when compared to the regular MLM.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Tasks
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Methods
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections