New Trends in Machine Learning: Theory and Practice

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Mathematics and Computer Science".

Deadline for manuscript submissions: closed (30 June 2020) | Viewed by 10294

Special Issue Editor


E-Mail Website
Guest Editor
Department of Computer Science, Femto-ST Institute, UMR 6174 CNRS, Université de Bourgogne-Franche-Comté, Dijon, France
Interests: bioinformatics; artificial intelligence; complex systems; chaos theory
Special Issues, Collections and Topics in MDPI journals

Special Issue Information

Dear Colleagues,

For almost ten years, artificial intelligence has been in full swing and has accumulated new successive breakthroughs at both theoretical and practical levels. Deep neural networks such as convolutional neural networks (CNN), long short-term memory (LSTM), and Google's BERT have multiplied the success of deep learning approaches, enabling new ways of arranging decision trees (e.g., extreme gradient boosting) and leading to the progression of "white box" models. Many new paradigms have also been introduced, such as echo state networks or wavelet scattering regressions, making it easier to analyze the theory and quality measures of such automatic learning tools.

However, much work remains to be done at the theoretical level, for example, to have a better understanding of the success of deep learning approaches or to ensure that new paradigms reflect the state of the art in terms of prediction quality. Similarly, very recent approaches to automatic learning are currently being poorly applied to real data, whereas such applications would provide a better understanding of these new paradigms, seeking to know, for example, why, in a given dataset, the computing reservoir produces excellent results while in other situations predictions are disappointing.

The objective of this Special Issue is to bring together new theoretical advances and their applications to real data, in order to confront theory with reality and to raise new avenues for automatic learning, whether supervised or not.

Prof. Christophe Guyeux
Guest Editor

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Keywords

  • Artificial intelligence
  • Deep learning
  • Theory and practice

Published Papers (4 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 4847 KiB  
Article
Predicting Fire Brigades Operational Breakdowns: A Real Case Study
by Selene Cerna, Christophe Guyeux, Guillaume Royer, Céline Chevallier and Guillaume Plumerel
Mathematics 2020, 8(8), 1383; https://0-doi-org.brum.beds.ac.uk/10.3390/math8081383 - 18 Aug 2020
Cited by 13 | Viewed by 3059
Abstract
Over the years, fire departments have been searching for methods to identify their operational disruptions and establish strategies that allow them to efficiently organize their resources. The present work develops a methodology for breakage calculation and another for predicting disruptions based on machine [...] Read more.
Over the years, fire departments have been searching for methods to identify their operational disruptions and establish strategies that allow them to efficiently organize their resources. The present work develops a methodology for breakage calculation and another for predicting disruptions based on machine learning techniques. The main objective is to establish indicators to identify the failures due to the temporal state of the organization in the human and vehicular material. Likewise, by forecasting disruptions, to determine strategies for the deployment or acquisition of the necessary armament. This would allow improving operational resilience and increasing the efficiency of the firemen over time. The methodology was applied to the Departmental Fire and Rescue Doubs (SDIS25) in France. However, it is generic enough to be extended and adapted to other fire departments. Considering a historic of breakdowns of 2017 and 2018, the best predictions of public service breakdowns for the year 2019, presented a root mean squared error of 2.5602 and a mean absolute error of 2.0240 on average with the XGBoost technique. Full article
(This article belongs to the Special Issue New Trends in Machine Learning: Theory and Practice)
Show Figures

Figure 1

19 pages, 498 KiB  
Article
Projection Methods for Uniformly Convex Expandable Sets
by Stéphane Chrétien and Pascal Bondon
Mathematics 2020, 8(7), 1108; https://0-doi-org.brum.beds.ac.uk/10.3390/math8071108 - 06 Jul 2020
Viewed by 1781
Abstract
Many problems in medical image reconstruction and machine learning can be formulated as nonconvex set theoretic feasibility problems. Among efficient methods that can be put to work in practice, successive projection algorithms have received a lot of attention in the case of convex [...] Read more.
Many problems in medical image reconstruction and machine learning can be formulated as nonconvex set theoretic feasibility problems. Among efficient methods that can be put to work in practice, successive projection algorithms have received a lot of attention in the case of convex constraint sets. In the present work, we provide a theoretical study of a general projection method in the case where the constraint sets are nonconvex and satisfy some other structural properties. We apply our algorithm to image recovery in magnetic resonance imaging (MRI) and to a signal denoising in the spirit of Cadzow’s method. Full article
(This article belongs to the Special Issue New Trends in Machine Learning: Theory and Practice)
Show Figures

Figure 1

31 pages, 4841 KiB  
Article
Spectrally Sparse Tensor Reconstruction in Optical Coherence Tomography Using Nuclear Norm Penalisation
by Mohamed Ibrahim Assoweh, Stéphane Chrétien and Brahim Tamadazte
Mathematics 2020, 8(4), 628; https://doi.org/10.3390/math8040628 - 18 Apr 2020
Viewed by 2546
Abstract
Reconstruction of 3D objects in various tomographic measurements is an important problem which can be naturally addressed within the mathematical framework of 3D tensors. In Optical Coherence Tomography, the reconstruction problem can be recast as a tensor completion problem. Following the seminal work [...] Read more.
Reconstruction of 3D objects in various tomographic measurements is an important problem which can be naturally addressed within the mathematical framework of 3D tensors. In Optical Coherence Tomography, the reconstruction problem can be recast as a tensor completion problem. Following the seminal work of Candès et al., the approach followed in the present work is based on the assumption that the rank of the object to be reconstructed is naturally small, and we leverage this property by using a nuclear norm-type penalisation. In this paper, a detailed study of nuclear norm penalised reconstruction using the tubal Singular Value Decomposition of Kilmer et al. is proposed. In particular, we introduce a new, efficiently computable definition of the nuclear norm in the Kilmer et al. framework. We then present a theoretical analysis, which extends previous results by Koltchinskii Lounici and Tsybakov. Finally, this nuclear norm penalised reconstruction method is applied to real data reconstruction experiments in Optical Coherence Tomography (OCT). In particular, our numerical experiments illustrate the importance of penalisation for OCT reconstruction. Full article
(This article belongs to the Special Issue New Trends in Machine Learning: Theory and Practice)
Show Figures

Figure 1

21 pages, 1307 KiB  
Article
Efficient Hyper-Parameter Selection in Total Variation-Penalised XCT Reconstruction Using Freund and Shapire’s Hedge Approach
by Stéphane Chrétien, Manasavee Lohvithee, Wenjuan Sun and Manuchehr Soleimani
Mathematics 2020, 8(4), 493; https://0-doi-org.brum.beds.ac.uk/10.3390/math8040493 - 01 Apr 2020
Cited by 5 | Viewed by 2413
Abstract
This paper studies the problem of efficiently tuning the hyper-parameters in penalised least-squares reconstruction for XCT. Discovered through the lens of the Compressed Sensing paradigm, penalisation functionals such as Total Variation types of norms, form an essential tool for enforcing structure in inverse [...] Read more.
This paper studies the problem of efficiently tuning the hyper-parameters in penalised least-squares reconstruction for XCT. Discovered through the lens of the Compressed Sensing paradigm, penalisation functionals such as Total Variation types of norms, form an essential tool for enforcing structure in inverse problems, a key feature in the case where the number of projections is small as compared to the size of the object to recover. In this paper, we propose a novel hyper-parameter selection approach for total variation (TV)-based reconstruction algorithms, based on a boosting type machine learning procedure initially proposed by Freund and Shapire and called Hedge. The proposed approach is able to select a set of hyper-parameters producing better reconstruction than the traditional Cross-Validation approach, with reduced computational effort. Traditional reconstruction methods based on penalisation can be made more efficient using boosting type methods from machine learning. Full article
(This article belongs to the Special Issue New Trends in Machine Learning: Theory and Practice)
Show Figures

Figure 1

Back to TopTop