paper-with-me

홈 › Papers

Physically interpretable machine learning algorithm on multidimensional non-linear fields

2020-05-28 · Rem-Sophia Mouradi, Cédric Goeury, Olivier Thual, Fabrice Zaoui, Pablo Tassi

In an ever-increasing interest for Machine Learning (ML) and a favorable data development context, we here propose an original methodology for data-based prediction of two-dimensional physical fields. Polynomial Chaos Expansion (PCE), widely used in the Uncertainty Quantification community (UQ), has long been employed as a robust representation for probabilistic input-to-output mapping. It has been recently tested in a pure ML context, and shown to be as powerful as classical ML techniques for point-wise prediction. Some advantages are inherent to the method, such as its explicitness and adaptability to small training sets, in addition to the associated probabilistic framework. Simultaneously, Dimensionality Reduction (DR) techniques are increasingly used for pattern recognition and data compression and have gained interest due to improved data quality. In this study, the interest of Proper Orthogonal Decomposition (POD) for the construction of a statistical predictive model is demonstrated. Both POD and PCE have amply proved their worth in their respective frameworks. The goal of the present paper was to combine them for a field-measurement-based forecasting. The described steps are also useful to analyze the data. Some challenging issues encountered when using multidimensional field measurements are addressed, for example when dealing with few data. The POD-PCE coupling methodology is presented, with particular focus on input data characteristics and training-set choice. A simple methodology for evaluating the importance of each physical parameter is proposed for the PCE model and extended to the POD-PCE coupling.

📄 PDF Abstract BibTeX arXiv:2005.13912

Code (0)

등록된 구현이 없습니다.

Tasks

BIG-bench Machine LearningData CompressionDimensionality ReductionInterpretable Machine LearningUncertainty Quantification

Similar Papers 제목 키워드 기반

Greedy Algorithms for Approximating the Diameter of Machine Learning Datasets in Multidimensional Euclidean Space

2018-08-10 · Ahmad B. Hassanat

Finding the diameter of a dataset in multidimensional Euclidean space is a well-established problem, with well-known algorithms. However, most of the algorithms found in the literature do not scale well with large values…

BIG-bench Machine Learning

Explainable Mixed Data Representation and Lossless Visualization Toolkit for Knowledge Discovery

2022-06-13 · Boris Kovalerchuk, Elijah McCoy

Developing Machine Learning (ML) algorithms for heterogeneous/mixed data is a longstanding problem. Many ML algorithms are not applicable to mixed data, which include numeric and non-numeric data, text, graphs and so on …

Data Visualization

Visual Knowledge Discovery with General Line Coordinates

2023-05-28 · Lincoln Huber, Boris Kovalerchuk, Charles Recaido

Understanding black-box Machine Learning methods on multidimensional data is a key challenge in Machine Learning. While many powerful Machine Learning methods already exist, these methods are often unexplainable or perfo…

wav2shape: Hearing the Shape of a Drum Machine

2020-07-20 · Han Han, Vincent Lostanlen

Disentangling and recovering physical attributes, such as shape and material, from a few waveform examples is a challenging inverse problem in audio signal processing, with numerous applications in musical acoustics as w…

Audio Signal Processing

Self-service Data Classification Using Interactive Visualization and Interpretable Machine Learning

2021-07-11 · Sridevi Narayana Wagle, Boris Kovalerchuk

Machine learning algorithms often produce models considered as complex black-box models by both end users and developers. They fail to explain the model in terms of the domain they are designed for. The proposed Iterativ…

BIG-bench Machine LearningClassificationData VisualizationInterpretable Machine Learning