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

IF 2.4 4区 计算机科学 Q2 COMPUTER SCIENCE, SOFTWARE ENGINEERING
Atiq W. Siddiqui , Manish Verma , Arshad Raza Syed
{"title":"DAUD: A data driven algorithm to find discrete approximations of unknown continuous distributions","authors":"Atiq W. Siddiqui ,&nbsp;Manish Verma ,&nbsp;Arshad Raza Syed","doi":"10.1016/j.softx.2025.102281","DOIUrl":null,"url":null,"abstract":"<div><div>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.</div></div>","PeriodicalId":21905,"journal":{"name":"SoftwareX","volume":"31 ","pages":"Article 102281"},"PeriodicalIF":2.4000,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"SoftwareX","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2352711025002481","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, SOFTWARE ENGINEERING","Score":null,"Total":0}
引用次数: 0

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.
DAUD:一种数据驱动算法,用于寻找未知连续分布的离散近似
连续概率分布的离散逼近在求解工程、商业和经济中的大规模难解随机模型中得到了广泛的应用。现有的方法依赖于已知的连续分布;据我们所知,没有一种实用的技术可以近似于未知的连续过程。由于现代系统产生的数据量越来越大,而它们的基本过程还不完全清楚,因此对这种技术的需求也就增加了。重要的是要知道,这些近似的质量可以通过细化离散来提高,然而,这是以增加计算负担为代价的。因此,我们提出了一种基于统计矩的收敛性,以最小离散性找到良好近似的算法。该算法在包含500至1,000,000个数据点的数据集上进行了测试。结果表明,该算法具有较好的鲁棒性,尤其适用于10000个数据点以上的数据集和各种分布形状的数据集。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
SoftwareX
SoftwareX COMPUTER SCIENCE, SOFTWARE ENGINEERING-
CiteScore
5.50
自引率
2.90%
发文量
184
审稿时长
9 weeks
期刊介绍: SoftwareX aims to acknowledge the impact of software on today''s research practice, and on new scientific discoveries in almost all research domains. SoftwareX also aims to stress the importance of the software developers who are, in part, responsible for this impact. To this end, SoftwareX aims to support publication of research software in such a way that: The software is given a stamp of scientific relevance, and provided with a peer-reviewed recognition of scientific impact; The software developers are given the credits they deserve; The software is citable, allowing traditional metrics of scientific excellence to apply; The academic career paths of software developers are supported rather than hindered; The software is publicly available for inspection, validation, and re-use. Above all, SoftwareX aims to inform researchers about software applications, tools and libraries with a (proven) potential to impact the process of scientific discovery in various domains. The journal is multidisciplinary and accepts submissions from within and across subject domains such as those represented within the broad thematic areas below: Mathematical and Physical Sciences; Environmental Sciences; Medical and Biological Sciences; Humanities, Arts and Social Sciences. Originating from these broad thematic areas, the journal also welcomes submissions of software that works in cross cutting thematic areas, such as citizen science, cybersecurity, digital economy, energy, global resource stewardship, health and wellbeing, etcetera. SoftwareX specifically aims to accept submissions representing domain-independent software that may impact more than one research domain.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信