FEMa: a finite element machine for fast learning

• Autor(a) principal: Pereira, Danilo R.
• Data de Publicação: 2019
• Outros Autores: Piteri, Marco Antonio [UNESP], Souza, André N. [UNESP], Papa, João Paulo [UNESP], Adeli, Hojjat
• Tipo de documento: Artigo
• Idioma: eng
• Título da fonte: Repositório Institucional da UNESP
• DOI: 10.1007/s00521-019-04146-4
• Texto Completo: http://dx.doi.org/10.1007/s00521-019-04146-4; http://hdl.handle.net/11449/190199
• topic: Finite element method; Pattern classification; Pattern recognition

Machine learning has played an essential role in the past decades and has been in lockstep with the main advances in computer technology. Given the massive amount of data generated daily, there is a need for even faster and more effective machine learning algorithms that can provide updated models for real-time applications and on-demand tools. This paper presents FEMa—a finite element machine classifier—for supervised learning problems, where each training sample is the center of a basis function, and the whole training set is modeled as a probabilistic manifold for classification purposes. FEMa has its theoretical basis in the finite element method, which is widely used for numeral analysis in engineering problems. It is shown FEMa is parameterless and has a quadratic complexity for both training and classification phases when basis functions are used that satisfy certain properties. The proposed classifier yields very competitive results when compared to some state-of-the-art supervised pattern recognition techniques.