no code implementations • 19 Dec 2019 • Anton Akusok, Emil Eirola, Kaj-Mikael Björk, Amaury Lendasse
The paper proposes a new variant of a decision tree, called an Extreme Learning Tree.
no code implementations • 19 Dec 2019 • Anton Akusok, Mirka Saarela, Tommi Kärkkäinen, Kaj-Mikael Björk, Amaury Lendasse
The paper proposes to analyze a data set of Finnish ranks of academic publication channels with Extreme Learning Machine (ELM).
no code implementations • 19 Dec 2019 • Anton Akusok, Yoan Miche, Kaj-Mikael Björk, Amaury Lendasse
Prediction intervals in supervised Machine Learning bound the region where the true outputs of new samples may fall.
no code implementations • 19 Dec 2019 • Anton Akusok, Kaj-Mikael Björk, Leonardo Espinosa Leal, Yoan Miche, Renjie Hu, Amaury Lendasse
This concept paper highlights a recently opened opportunity for large scale analytical algorithms to be trained directly on edge devices.
no code implementations • 18 Dec 2019 • Anton Akusok, Emil Eirola, Yoan Miche, Ian Oliver, Kaj-Mikael Björk, Andrey Gritsenko, Stephen Baek, Amaury Lendasse
An incremental version of the ELMVIS+ method is proposed in this paper.
no code implementations • 18 Dec 2019 • Leonardo Espinosa Leal, Kaj-Mikael Björk, Amaury Lendasse, Anton Akusok
The results show that the best method of classifying a webpage into the studies classes is to assign the class according to the maximum probability of any image belonging to this (weapon) class being above the threshold, across all the retrieved images.
no code implementations • 17 Oct 2017 • Zhiyu Sun, Yusen He, Andrey Gritsenko, Amaury Lendasse, Stephen Baek
In this paper, it is proposed a method to improve the similarity metric of spectral descriptors for correspondence matching problems.
no code implementations • 23 Sep 2014 • Bo Han, Bo He, Tingting Sun, Mengmeng Ma, Amaury Lendasse
By employing hierarchical feature selection, we can compress the scale and dimension of global dictionary, which directly contributes to the decrease of computational cost in sparse representation that our approach is strongly rooted in.
no code implementations • 9 Aug 2014 • Bo Han, Bo He, Mengmeng Ma, Tingting Sun, Tianhong Yan, Amaury Lendasse
It becomes a potential framework to solve robustness issue of ELM for high-dimensional blended data in the future.
no code implementations • 9 Aug 2014 • Bo Han, Bo He, Rui Nian, Mengmeng Ma, Shujing Zhang, Minghui Li, Amaury Lendasse
Extreme learning machine (ELM) as a neural network algorithm has shown its good performance, such as fast speed, simple structure etc, but also, weak robustness is an unavoidable defect in original ELM for blended data.