Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection
Preprint
Abstract
The Minimal Learning Machine (MLM) is a nonlinear supervised approach based on learning a linear mapping between distance matrices computed in the input and output data spaces, where distances are calculated concerning a subset of points called reference points. Its simple formulation has attracted several recent works on extensions and applications. In this paper, we aim to address some open questions related to the MLM. First, we detail theoretical aspects that assure the interpolation and universal approximation capabilities of the MLM, which were previously only empirically verified. Second, we identify the task of selecting reference points as having major importance for the MLM's generalization capability; furthermore, we assess several clustering-based methods in regression scenarios. Based on an extensive empirical evaluation, we conclude that the evaluated methods are both scalable and useful. Specifically, for a small number of reference points, the clustering-based methods outperformed the standard random selection of the original MLM formulation.Keywords
All Related Versions
This publication has 18 references indexed in Scilit:
- A novel mobile robot localization approach based on classification with rejection option using computer visionComputers and Electrical Engineering, 2018
- Incremental on-line learning: A review and comparison of state of the art algorithmsNeurocomputing, 2018
- Fast Co-MLM: An Efficient Semi-supervised Co-training Method Based on the Minimal Learning MachineNew Generation Computing, 2017
- A novel mobile robot localization approach based on topological maps using classification with reject option in omnidirectional imagesExpert Systems with Applications, 2017
- Ensemble of Efficient Minimal Learning Machines for Classification and RegressionNeural Processing Letters, 2017
- Using clustering analysis to improve semi-supervised classificationNeurocomputing, 2013
- A comparative study of efficient initialization methods for the k-means clustering algorithmExpert Systems with Applications, 2013
- Optimal implementations of UPGMA and other common clustering algorithmsInformation Processing Letters, 2007
- Interpolation of scattered data: Distance matrices and conditionally positive definite functionsConstructive Approximation, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985