Statistical Data Modeling and Machine Learning with Applications II

Gocheva-Ilieva, Snezhana ; Ivanov, Atanas ; et al.

Basel: MDPI - Multidisciplinary Digital Publishing Institute, 2023

Online E-Book - 344

Zugriff:

View record at Directory of Open Access Books (Volltext)

The present reprint contains all of the articles in the second edition of the Special Issue titled “Statistical Data Modeling and Machine Learning with Applications II”. This Special Issue belongs to the “Mathematics and Computer Science” Section and aims to publish research on the theory and application of statistical data modeling and machine learning. New mathematical methods and approaches, new algorithms and research frameworks, and their applications aimed at solving diverse and nontrivial practical problems are proposed and developed in this SI. We believe that the chosen papers are attractive and useful to the international scientific community and will contribute to further research in the field of statistical data modeling and machine learning.

Titel:	Statistical Data Modeling and Machine Learning with Applications II
Autor/in / Beteiligte Person:	Gocheva-Ilieva, Snezhana ; Ivanov, Atanas ; Kulina, Hristina
Link:	View record at Directory of Open Access Books (Volltext)
Veröffentlichung:	Basel: MDPI - Multidisciplinary Digital Publishing Institute, 2023
Medientyp:	E-Book
Umfang:	344
ISBN:	978-3-0365-8200-9 (print) ; 978-3-0365-8201-6 (print)
DOI:	10.3390/books978-3-0365-8201-6
Schlagwort:	forecasting model electricity energy consumption grey model artificial neural network machine learning rotation CART ensemble bagging boosting arcing simplified selective ensemble linear stacked model IoV xNN K-MEANS anomaly detection single-index models composite quantile regression SCAD Laplace error penalty (LEP) causality Bayesian networks scalability group lasso penalty data integration network estimation stability selection time series model wavelet transform neural network NARX ionospheric parameters gambling jackpot multidimensional integrals Monte Carlo methods lattice sequences digital sequences surface approximation surface segmentation surface denoising gaussian process latent variable model line geometry line elements regression classification prediction meteorological parameters traffic incidents multi-agent architecture air pollution random forest ARIMA errors MIMO averaging strategy multi-step ahead prediction unmeasured forecast Explainableartificial intelligence credit card frauds deep learning long short-term memory fraud classification lung cancer tumor CT image one-stage detector YOLO multi-scale receptive field data analysis decision trees LightGBM SHAP leisure time influencing factors time allocation neural networks cosmic rays space weather thema EDItEUR:K Economics, Finance, Business and Management:KN Industry and industrial studies:KNT Media, entertainment, information and communication industries:KNTX Information technology industries thema EDItEUR:U Computing and Information Technology:UY Computer science
Sonstiges:	Nachgewiesen in: Directory of Open Access Books Sprachen: English Document Type: eBook File Description: image/jpeg Language: English Rights: Attribution 4.0 International ; URL: https://creativecommons.org/licenses/by/4.0/ Notes: ONIX_20230808_9783036582009_11

Klicken Sie ein Format an und speichern Sie dann die Daten oder geben Sie eine Empfänger-Adresse ein und lassen Sie sich per Email zusenden.

BibTeX Citavi, JabRef, u.a.
(Literaturverwaltung)

PDF kein Volltext!
(Merkzettel, Notizen)

RIS Endnote, Citavi u.a.
(Literaturverwaltung)

MODS
(XML zur Weiterverarbeitung)

oder

Wählen Sie das für Sie passende Zitationsformat und kopieren Sie es dann in die Zwischenablage, lassen es sich per Mail zusenden oder speichern es als PDF-Datei.

Gewünschter Zitations-Stil:

oder

Bitte prüfen Sie, ob die Zitation formal korrekt ist, bevor Sie sie in einer Arbeit verwenden. Benutzen Sie gegebenenfalls den "Exportieren"-Dialog, wenn Sie ein Literaturverwaltungsprogramm verwenden und die Zitat-Angaben selbst formatieren wollen.