{"title":"Efficiency of the multisection method","authors":"J.S.C. Prentice","doi":"10.1016/j.jcmds.2024.100106","DOIUrl":"10.1016/j.jcmds.2024.100106","url":null,"abstract":"<div><div>We study the efficiency of the multisection method for univariate nonlinear equations, relative to that for the well-known bisection method. We show that there is a minimal effort algorithm that uses more sections than the bisection method, although this optimal algorithm is problem dependent. The number of sections required for optimality is determined by means of a Lambert <em>W</em> function.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100106"},"PeriodicalIF":0.0,"publicationDate":"2024-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142577799","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Temidayo Oluwatosin Omotehinwa , Morolake Oladayo Lawrence , David Opeoluwa Oyewola , Emmanuel Gbenga Dada
{"title":"Bayesian optimization of one-dimensional convolutional neural networks (1D CNN) for early diagnosis of Autistic Spectrum Disorder","authors":"Temidayo Oluwatosin Omotehinwa , Morolake Oladayo Lawrence , David Opeoluwa Oyewola , Emmanuel Gbenga Dada","doi":"10.1016/j.jcmds.2024.100105","DOIUrl":"10.1016/j.jcmds.2024.100105","url":null,"abstract":"<div><div>Autistic Spectrum Disorder (ASD) is a challenging neurological development disorder, which involves poor social interaction, communication, and repetitive behaviours. If autism is identified early enough it can be treated with better outcomes but present diagnostic tests are dependent on subjective opinion, consume a lot of time, and are vague. This study is aimed at optimizing one-dimensional convolutional neural networks (1D CNN) to improve the precision and speed of early ASD diagnosis. Four ASD datasets representing different age groups — toddlers, children, adolescents, and adults were modelled using one-dimensional convolutional neural networks (1D CNN). These datasets are accessible to the public on the UCI Machine Learning Repository and Kaggle, they consist of behavioural features relevant to ASD diagnosis. Each dataset underwent feature selection, categorical encoding, and missing value handling. Then, baseline 1D CNN with predefined hyperparameters was modelled on each of the datasets. Subsequently, the baseline models were optimized using the Tree-structured Parzen Estimator (TPE). An interactive web-based ASD diagnostic tool was developed, where user inputs are processed through age-specific pre-trained optimized models to determine ASD probability. The optimized 1D CNN models significantly outperformed the baseline models across all age groups and achieved scores of 100% in accuracy, precision, recall, F1-score, MCC, and AUC ROC. This implies that the optimized models can reliably identify people in various age groups who have and do not have ASD. The development of an interactive web-based diagnostic tool extends the practical utility of the models, making them accessible for clinical and at-home use.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100105"},"PeriodicalIF":0.0,"publicationDate":"2024-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529566","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Ciro Castiello , Nicoletta Del Buono , Flavia Esposito
{"title":"Novel color space representation extracted by NMF to segment a color image","authors":"Ciro Castiello , Nicoletta Del Buono , Flavia Esposito","doi":"10.1016/j.jcmds.2024.100104","DOIUrl":"10.1016/j.jcmds.2024.100104","url":null,"abstract":"<div><div>This paper considers the task of separating pixels in color image into background and foreground classes. Using the machine learning technique known as Nonnegative Matrix Factorization, data pertaining to different color channels – selected by color spaces – are combined, and a novel space representation is extracted.</div><div>The novel representation of the image includes additional information, namely “metacolor”, which could be related to foreground and background and adopted to improve binary segmentation of the investigated image. In both qualitative and quantitative experiments, the use of novel color space representation produces some improvements in the binary segmentation results when it compared to those obtained applying common simpler thresholding algorithms directly to the original image.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100104"},"PeriodicalIF":0.0,"publicationDate":"2024-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142529565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Serena Grazia De Benedictis , Grazia Gargano , Gaetano Settembre
{"title":"Enhanced MRI brain tumor detection and classification via topological data analysis and low-rank tensor decomposition","authors":"Serena Grazia De Benedictis , Grazia Gargano , Gaetano Settembre","doi":"10.1016/j.jcmds.2024.100103","DOIUrl":"10.1016/j.jcmds.2024.100103","url":null,"abstract":"<div><div>The advent of artificial intelligence in medical imaging has paved the way for significant advancements in the diagnosis of brain tumors. This study presents a novel ensemble approach that uses magnetic resonance imaging (MRI) to identify and categorize common brain cancers, such as pituitary, meningioma, and glioma. The proposed workflow is composed of a two-fold approach: firstly, it employs non-trivial image enhancement techniques in data preprocessing, low-rank Tucker decomposition for dimensionality reduction, and machine learning (ML) classifiers to detect and predict the type of brain tumor. Secondly, persistent homology (PH), a topological data analysis (TDA) technique, is exploited to extract potential critical areas in MRI scans. When paired with the ML classifier output, this additional information can help domain experts to identify areas of interest that might contain tumor signatures, improving the interpretability of ML predictions. When compared to automated diagnoses, this transparency adds another level of confidence and is essential for clinical acceptance. The performance of the system was quantitatively evaluated on a well-known MRI dataset, with an overall classification accuracy of 97.28% using an extremely randomized trees model. The promising results show that the integration of TDA, ML, and low-rank approximation methods is a successful approach for brain tumor identification and categorization, providing a solid foundation for further study and clinical application.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100103"},"PeriodicalIF":0.0,"publicationDate":"2024-10-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
K. Gunasekaran , V.D. Ambeth Kumar , Mary Judith A.
{"title":"Artifact removal from ECG signals using online recursive independent component analysis","authors":"K. Gunasekaran , V.D. Ambeth Kumar , Mary Judith A.","doi":"10.1016/j.jcmds.2024.100102","DOIUrl":"10.1016/j.jcmds.2024.100102","url":null,"abstract":"<div><div>The diagnosis of cardiac abnormalities and monitoring of heart health heavily rely on Electrocardiogram (ECG) signals. Unfortunately, these signals frequently encounter interference from diverse artifacts, impeding precise interpretation and analysis. To overcome this challenge, we suggest a novel method for real-time artifact removal from ECG signals through the utilization of Online Recursive Independent Component Analysis (ORICA). Our study outlines a systematic preprocessing pipeline, adaptively estimating the mixing matrix and demixing matrix of the ICA model while streaming data is processed. Additionally, we explore the selection of appropriate ICA components and the use of relevant feature extraction techniques to enhance the quality of extracted cardiac signals. This research presents a promising solution for removing artifacts from ECG signals in real-time, paving the way for improved cardiac diagnostics and monitoring systems. Comparative analyses demonstrate significant improvements in the accuracy of subsequent ECG analysis and interpretation following the application of our ORICA-based preprocessing.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100102"},"PeriodicalIF":0.0,"publicationDate":"2024-09-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142421855","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Sabastine Emmanuel , Saratha Sathasivam , Muideen O. Ogunniran
{"title":"Leveraging feed-forward neural networks to enhance the hybrid block derivative methods for system of second-order ordinary differential equations","authors":"Sabastine Emmanuel , Saratha Sathasivam , Muideen O. Ogunniran","doi":"10.1016/j.jcmds.2024.100101","DOIUrl":"10.1016/j.jcmds.2024.100101","url":null,"abstract":"<div><div>This study introduces an innovative method combining discrete hybrid block techniques and artificial intelligence to enhance the solution of second-order Ordinary Differential Equations (ODEs). By integrating feed-forward neural networks (FFNN) into the hybrid block derivative method (HBDM), the modified approach shows improved accuracy and efficiency compared to traditional methods. Through comprehensive comparisons with exact and existing solutions, the study demonstrates the effectiveness of the proposed approach. The evaluation, utilizing root mean square error (RMSE), confirms its superior performance, robustness, and applicability in diverse scenarios. This research sets a new standard for solving complex ODE systems, offering promising avenues for future research and practical implementations.</div></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"13 ","pages":"Article 100101"},"PeriodicalIF":0.0,"publicationDate":"2024-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142323259","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"On resolution coresets for constrained clustering","authors":"Maximilian Fiedler, Peter Gritzmann, Fabian Klemm","doi":"10.1016/j.jcmds.2024.100100","DOIUrl":"10.1016/j.jcmds.2024.100100","url":null,"abstract":"<div><p>Specific data compression techniques, formalized by the concept of coresets, proved to be powerful for many optimization problems. In fact, while tightly controlling the approximation error, coresets may lead to significant speed up of the computations and hence allow to extend algorithms to much larger problem sizes. The present paper deals with a weight-balanced clustering problem, and is specifically motivated by an application in materials science where a voxel-based image is to be processed into a diagram representation. Here, the class of desired coresets is naturally confined to those which can be viewed as lowering the resolution of the input data. While one might expect that such resolution coresets are inferior to unrestricted coreset we prove bounds for resolution coresets which improve known bounds in the relevant dimensions and also lead to significantly faster algorithms in practice.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"12 ","pages":"Article 100100"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415824000117/pdfft?md5=119df73da5369d09083c391d94764956&pid=1-s2.0-S2772415824000117-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150297","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Fast empirical scenarios","authors":"Michael Multerer , Paul Schneider , Rohan Sen","doi":"10.1016/j.jcmds.2024.100099","DOIUrl":"10.1016/j.jcmds.2024.100099","url":null,"abstract":"<div><p>We seek to extract a small number of representative scenarios from large panel data that are consistent with sample moments. Among two novel algorithms, the first identifies scenarios that have not been observed before, and comes with a scenario-based representation of covariance matrices. The second proposal selects important data points from states of the world that have already realized, and are consistent with higher-order sample moment information. Both algorithms are efficient to compute and lend themselves to consistent scenario-based modeling and multi-dimensional numerical integration that can be used for interpretable decision-making under uncertainty. Extensive numerical benchmarking studies and an application in portfolio optimization favor the proposed algorithms.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"12 ","pages":"Article 100099"},"PeriodicalIF":0.0,"publicationDate":"2024-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415824000105/pdfft?md5=701519346db6f93b6f348d8512c143fa&pid=1-s2.0-S2772415824000105-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142150298","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Estimating data complexity and drift through a multiscale generalized impurity approach","authors":"Diogo Costa , Eugénio M. Rocha , Nelson Ferreira","doi":"10.1016/j.jcmds.2024.100098","DOIUrl":"10.1016/j.jcmds.2024.100098","url":null,"abstract":"<div><p>The quality of machine learning solutions, and of classifier models in general, depend largely on the performance of the chosen algorithm, and on the intrinsic characteristics of the input data. Although work has been extensive on the former of these aspects, the latter has received comparably less attention. In this paper, we introduce the Multiscale Impurity Complexity Analysis (MICA) algorithm for the quantification of class separability and decision-boundary complexity of datasets. MICA is both model and dimensionality-independent and can provide a measure of separability based on regional impurity values. This makes it so that MICA is sensible to both global and local data conditions. We show MICA to be capable of properly describing class separability in a comprehensive set of both synthetic and real datasets and comparing it against other state-of-the-art methods. After establishing the robustness of the proposed method, alternative applications are discussed, including a streaming-data variant of MICA (MICA-S), that can be repurposed into a model-independent method for concept drift detection.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"12 ","pages":"Article 100098"},"PeriodicalIF":0.0,"publicationDate":"2024-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415824000099/pdfft?md5=54b719dae828872e98af24740cf27e23&pid=1-s2.0-S2772415824000099-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142076295","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Structured stochastic curve fitting without gradient calculation","authors":"Jixin Chen","doi":"10.1016/j.jcmds.2024.100097","DOIUrl":"10.1016/j.jcmds.2024.100097","url":null,"abstract":"<div><p>Optimization of parameters and hyperparameters is a general process for any data analysis. Because not all models are mathematically well-behaved, stochastic optimization can be useful in many analyses by randomly choosing parameters in each optimization iteration. Many such algorithms have been reported and applied in chemistry data analysis, but the one reported here is interesting to check out, where a naïve algorithm searches each parameter sequentially and randomly in its bounds. Then it picks the best for the next iteration. Thus, one can ignore irrational solution of the model itself or its gradient in parameter space and continue the optimization.</p></div>","PeriodicalId":100768,"journal":{"name":"Journal of Computational Mathematics and Data Science","volume":"12 ","pages":"Article 100097"},"PeriodicalIF":0.0,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772415824000087/pdfft?md5=d29b0c976e4cd3877c7a001f5d45fd9a&pid=1-s2.0-S2772415824000087-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141841097","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}