DeepAI AI Chat
Log In Sign Up

Minimal Learning Machine: Theoretical Results and Clustering-Based Reference Point Selection

by   Joonas Hämäläinen, et al.
UFC informa
Jyväskylän yliopisto
Instituto Federal de Educação

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.


page 1

page 2

page 3

page 4


Clustering-Based Subset Selection in Evolutionary Multiobjective Optimization

Subset selection is an important component in evolutionary multiobjectiv...

Minimal Learning Machine for Multi-Label Learning

Distance-based supervised method, the minimal learning machine, construc...

Locally linear representation for image clustering

It is a key to construct a similarity graph in graph-oriented subspace l...

Semantic Structural Evaluation for Text Simplification

Current measures for evaluating text simplification systems focus on eva...

Concentration of Random Feature Matrices in High-Dimensions

The spectra of random feature matrices provide essential information on ...

Extending Binary Qualitative Direction Calculi with a Granular Distance Concept: Hidden Feature Attachment

In this paper we introduce a method for extending binary qualitative dir...