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 using 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. Several clustering-based methods for reference point selection in regression scenarios are then proposed and analyzed. 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 31 references indexed in Scilit:
- A review on distance based time series classificationData Mining and Knowledge Discovery, 2018
- A novel mobile robot localization approach based on classification with rejection option using computer visionComputers and Electrical Engineering, 2018
- Fast Co-MLM: An Efficient Semi-supervised Co-training Method Based on the Minimal Learning MachineNew Generation Computing, 2017
- Ensemble of Efficient Minimal Learning Machines for Classification and RegressionNeural Processing Letters, 2017
- A comparative study of efficient initialization methods for the k-means clustering algorithmExpert Systems with Applications, 2013
- Dissimilarity partial least squares applied to non-linear modeling problemsChemometrics and Intelligent Laboratory Systems, 2012
- A theory of learning with similarity functionsMachine Learning, 2008
- Model-based classification with dissimilarities: a maximum likelihood approachPattern Analysis and Applications, 2008
- Interpolation of scattered data: Distance matrices and conditionally positive definite functionsConstructive Approximation, 1986
- Clustering to minimize the maximum intercluster distanceTheoretical Computer Science, 1985