DAUD: A data driven algorithm to find discrete approximations of unknown continuous distributions

Discrete approximation of continuous probability distributions is applied in solving large-scale intractable stochastic models in engineering, business and economics. While the existing approaches rely on the known continuous distribution; to our knowledge, no practical technique exists that approximates the unknown continuous processes. The need for such a technique is heightened with the rise of increasingly larger volumes of data generated by modern systems, while their underlying processes are not fully known. It is important to know that the quality of these approximations can be improved by refining the discretization, however, this comes at the cost of increased computational burden. We thus propose an algorithm that finds a good approximation with minimal discretization based on the convergence behavior of statistical moments. The algorithm was tested with data sets comprising 500 to 1,000,000 data points. The results show robust behavior of the algorithm, especially for the datasets with more than 10,000 data points and for various distribution shapes.

Authors

Institutions

Publication Details

Journal
SoftwareX
Published
2025-07-24
DOI
https://doi.org/10.1016/j.softx.2025.102281
Primary Topic
Control Systems and Identification
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DAUD: A data driven algorithm to find discrete approximations of unknown continuous distributions

Syed Arshad Raza, Atiq W. Siddiqui, Manish Verma
SoftwareX
Control Systems and Identification
article

DAUD: A data driven algorithm to find discrete approximations of unknown continuous distributions

Syed Arshad Raza, Atiq W. Siddiqui, Manish Verma
article en

Abstract

Discrete approximation of continuous probability distributions is applied in solving large-scale intractable stochastic models in engineering, business and economics. While the existing approaches rely on the known continuous distribution; to our knowledge, no practical technique exists that approximates the unknown continuous processes. The need for such a technique is heightened with the rise of increasingly larger volumes of data generated by modern systems, while their underlying processes are not fully known. It is important to know that the quality of these approximations can be improved by refining the discretization, however, this comes at the cost of increased computational burden. We thus propose an algorithm that finds a good approximation with minimal discretization based on the convergence behavior of statistical moments. The algorithm was tested with data sets comprising 500 to 1,000,000 data points. The results show robust behavior of the algorithm, especially for the datasets with more than 10,000 data points and for various distribution shapes.

SoftwareXVol. 31
Al Yamamah University (SA), McMaster University (CA)
Openalex Percentile: Top 79%
Control Systems and Identification
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

DAUD: A data driven algorithm to find discrete approximations of unknown continuous distributions — Syed Arshad Raza, Atiq W. Siddiqui, et al. · SoftwareX (2025) | TGRS Research Map | TGRS