首页 > 最新文献

Machine learning with applications最新文献

英文 中文
Erratum to “A BCI system for imagined Bengali speech recognition” [Machine Learning with Applications 13 (2023) 100486] 对 "用于孟加拉语想象语音识别的 BCI 系统 "的勘误 [Machine Learning with Applications 13 (2023) 100486]
Pub Date : 2024-02-07 DOI: 10.1016/j.mlwa.2024.100532
Arman Hossain, Kathak Das, Protima Khan, Md. Fazlul Kader
{"title":"Erratum to “A BCI system for imagined Bengali speech recognition” [Machine Learning with Applications 13 (2023) 100486]","authors":"Arman Hossain, Kathak Das, Protima Khan, Md. Fazlul Kader","doi":"10.1016/j.mlwa.2024.100532","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100532","url":null,"abstract":"","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100532"},"PeriodicalIF":0.0,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000082/pdfft?md5=21190c55023c6d4e83c475888cfe79cd&pid=1-s2.0-S2666827024000082-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139700154","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}
引用次数: 0
Erratum to “Automated recognition of individual performers from de-identified video sequences” [Machine Learning with Applications 11 (2023) 100450] 对 "从去标识化视频序列中自动识别个体表演者 "的勘误 [Machine Learning with Applications 11 (2023) 100450]
Pub Date : 2024-02-07 DOI: 10.1016/j.mlwa.2024.100533
Zizui Chen , Stephen Czarnuch , Erica Dove , Arlene Astell
{"title":"Erratum to “Automated recognition of individual performers from de-identified video sequences” [Machine Learning with Applications 11 (2023) 100450]","authors":"Zizui Chen , Stephen Czarnuch , Erica Dove , Arlene Astell","doi":"10.1016/j.mlwa.2024.100533","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100533","url":null,"abstract":"","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100533"},"PeriodicalIF":0.0,"publicationDate":"2024-02-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000094/pdfft?md5=18cb5d7b54b02f994ec6f40198f8347a&pid=1-s2.0-S2666827024000094-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139700155","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}
引用次数: 0
Enhancing data efficiency for autonomous vehicles: Using data sketches for detecting driving anomalies 提高自动驾驶车辆的数据效率:利用数据草图检测驾驶异常情况
Pub Date : 2024-02-06 DOI: 10.1016/j.mlwa.2024.100530
Debbie Aisiana Indah , Judith Mwakalonge , Gurcan Comert , Saidi Siuhi

Machine learning models for near collision detection in autonomous vehicles promise enhanced predictive power. However, training on these large datasets presents storage and computational challenges, particularly when operated on conventional computing systems. This paper addresses the problem of training anomaly detection models from large-scale vehicle trajectory datasets and adopts a reservoir sampling-based data sketching technique. Predetermined subset sizes ranging from 0.4% to 100% of the original data are utilized, A single-pass reservoir sampling algorithm is then applied to construct these data subsets efficiently. Subsequently, a Support Vector Machine (SVM) model is trained on these subsets, and its performance is assessed by various metrics, including accuracy, precision, recall, and F1-score. Experimental outcomes on the HighD dataset, a comprehensive real-world collection of vehicle trajectories, confirm that our approach can achieve robust near-collision detection. With a full dataset, our model achieved an F1-score of 0.9998 for class 0 and 0.9984 for class 1. When the data was reduced to as low as 0.4% of the original size, the F1-score for class 0 remained at 0.9998 and 0.7143 for class 1. This demonstrates a capability to maintain a relatively high performance even with a 99.6% reduction in data size. Moreover, precision and recall values ranged from 71.3% to 0.999 across varying sketch sizes.

用于自动驾驶汽车近距离碰撞检测的机器学习模型有望增强预测能力。然而,在这些大型数据集上进行训练会带来存储和计算方面的挑战,尤其是在传统计算系统上运行时。本文针对从大规模车辆轨迹数据集训练异常检测模型的问题,采用了基于水库采样的数据草图技术。利用原始数据的 0.4% 到 100% 之间的预定子集大小,然后应用单通道水库采样算法高效地构建这些数据子集。随后,在这些子集上训练支持向量机(SVM)模型,并通过各种指标(包括准确率、精确度、召回率和 F1 分数)评估其性能。HighD 数据集是一个全面的真实世界车辆轨迹集合,在该数据集上的实验结果证实,我们的方法可以实现稳健的近碰撞检测。在完整数据集上,我们的模型在 0 类和 1 类的 F1 分数分别达到了 0.9998 和 0.9984。当数据减少到原始数据的 0.4% 时,0 类的 F1 分数仍为 0.9998,1 类为 0.7143。这表明,即使数据量减少 99.6%,也能保持相对较高的性能。此外,在不同的草图大小中,精确度和召回值从 71.3% 到 0.999 不等。
{"title":"Enhancing data efficiency for autonomous vehicles: Using data sketches for detecting driving anomalies","authors":"Debbie Aisiana Indah ,&nbsp;Judith Mwakalonge ,&nbsp;Gurcan Comert ,&nbsp;Saidi Siuhi","doi":"10.1016/j.mlwa.2024.100530","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100530","url":null,"abstract":"<div><p>Machine learning models for near collision detection in autonomous vehicles promise enhanced predictive power. However, training on these large datasets presents storage and computational challenges, particularly when operated on conventional computing systems. This paper addresses the problem of training anomaly detection models from large-scale vehicle trajectory datasets and adopts a reservoir sampling-based data sketching technique. Predetermined subset sizes ranging from 0.4% to 100% of the original data are utilized, A single-pass reservoir sampling algorithm is then applied to construct these data subsets efficiently. Subsequently, a Support Vector Machine (SVM) model is trained on these subsets, and its performance is assessed by various metrics, including accuracy, precision, recall, and F1-score. Experimental outcomes on the HighD dataset, a comprehensive real-world collection of vehicle trajectories, confirm that our approach can achieve robust near-collision detection. With a full dataset, our model achieved an F1-score of 0.9998 for class 0 and 0.9984 for class 1. When the data was reduced to as low as 0.4% of the original size, the F1-score for class 0 remained at 0.9998 and 0.7143 for class 1. This demonstrates a capability to maintain a relatively high performance even with a 99.6% reduction in data size. Moreover, precision and recall values ranged from 71.3% to 0.999 across varying sketch sizes.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100530"},"PeriodicalIF":0.0,"publicationDate":"2024-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000069/pdfft?md5=9be9b5b35b0fb83d6e0d7837356cf364&pid=1-s2.0-S2666827024000069-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139709116","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}
引用次数: 0
Neural network prediction of the effect of thermomechanical controlled processing on mechanical properties 神经网络预测热机械控制加工对机械性能的影响
Pub Date : 2024-02-05 DOI: 10.1016/j.mlwa.2024.100531
Sushant Sinha , Denzel Guye , Xiaoping Ma , Kashif Rehman , Stephen Yue , Narges Armanfard

The as-rolled mechanical properties of microalloyed steels result from their chemical composition and thermomechanical processing history. Accurate predictions of the mechanical properties would reduce the need for expensive and time-consuming testing. At the same time, understanding the interplay between process variables and alloy composition will help reduce product variability and facilitate future alloy design. This paper provides an artificial neural network methodology to predict lower yield strength (LYS) and ultimate tensile strength (UTS). The proposed method uses feature engineering to transform raw data into features typically used in physical metallurgy to better utilize the artificial neural network model in understanding the process. SHAP values are used to reveal the effect of thermomechanical controlled processing, which can be rationalized by physical metallurgy theory.

微合金钢的轧制机械性能源于其化学成分和热机械加工历史。对机械性能的准确预测将减少对昂贵且耗时的测试的需求。同时,了解工艺变量和合金成分之间的相互作用将有助于减少产品变异性,促进未来的合金设计。本文提供了一种预测低屈服强度(LYS)和极限抗拉强度(UTS)的人工神经网络方法。所提出的方法利用特征工程将原始数据转换为物理冶金学中常用的特征,以便更好地利用人工神经网络模型理解工艺过程。SHAP 值用于揭示热机械受控加工的效果,而物理冶金理论可以合理地解释这种效果。
{"title":"Neural network prediction of the effect of thermomechanical controlled processing on mechanical properties","authors":"Sushant Sinha ,&nbsp;Denzel Guye ,&nbsp;Xiaoping Ma ,&nbsp;Kashif Rehman ,&nbsp;Stephen Yue ,&nbsp;Narges Armanfard","doi":"10.1016/j.mlwa.2024.100531","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100531","url":null,"abstract":"<div><p>The as-rolled mechanical properties of microalloyed steels result from their chemical composition and thermomechanical processing history. Accurate predictions of the mechanical properties would reduce the need for expensive and time-consuming testing. At the same time, understanding the interplay between process variables and alloy composition will help reduce product variability and facilitate future alloy design. This paper provides an artificial neural network methodology to predict lower yield strength (LYS) and ultimate tensile strength (UTS). The proposed method uses feature engineering to transform raw data into features typically used in physical metallurgy to better utilize the artificial neural network model in understanding the process. SHAP values are used to reveal the effect of thermomechanical controlled processing, which can be rationalized by physical metallurgy theory.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100531"},"PeriodicalIF":0.0,"publicationDate":"2024-02-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000070/pdfft?md5=f6b3bdad6bf167fd8a2aa91012ecb379&pid=1-s2.0-S2666827024000070-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139725800","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}
引用次数: 0
Wearables to detect independent variables, objective task performance, and metacognitive states 检测自变量、客观任务绩效和元认知状态的可穿戴设备
Pub Date : 2024-01-28 DOI: 10.1016/j.mlwa.2024.100529
Matthew S. Daley , Jeffrey B. Bolkhovsky , Rachel Markwald , Timothy Dunn

Wearable biometric tracking devices are becoming increasingly common, providing users with physiological metrics such as heart rate variability (HRV) and skin conductance. We hypothesize that these metrics can be used as inputs for machine learning models to detect independent variables, such as target prevalence or hours awake, objective task performance, and metacognitive states. Over the course of 1–25 h awake, 40 participants completed four sessions of a simulated mine hunting task while non-invasive wearables collected physiological and behavioral data. The collected data were used to generate multiple machine learning models to detect the independent variables of the experiment (e.g., time awake and target prevalence), objective task performance, or metacognitive states. The strongest generated model was the time awake detection model (area under the curve = 0.92). All other models performed much closer to chance (area under the curve = 0.57–0.66), suggesting the model architecture used in this paper can detect time awake but falls short in other domains.

可穿戴生物识别跟踪设备越来越常见,可为用户提供心率变异性(HRV)和皮肤电导率等生理指标。我们假设这些指标可用作机器学习模型的输入,以检测自变量,如目标发生率或清醒时数、客观任务表现和元认知状态。在 1-25 小时的清醒过程中,40 名参与者完成了四次模拟猎雷任务,同时无创可穿戴设备收集了生理和行为数据。收集到的数据被用于生成多个机器学习模型,以检测实验的自变量(如清醒时间和目标发生率)、客观任务表现或元认知状态。生成的最强模型是清醒时间检测模型(曲线下面积 = 0.92)。所有其他模型的表现都更接近于偶然性(曲线下面积 = 0.57-0.66),这表明本文中使用的模型架构可以检测出时间清醒,但在其他领域却有不足。
{"title":"Wearables to detect independent variables, objective task performance, and metacognitive states","authors":"Matthew S. Daley ,&nbsp;Jeffrey B. Bolkhovsky ,&nbsp;Rachel Markwald ,&nbsp;Timothy Dunn","doi":"10.1016/j.mlwa.2024.100529","DOIUrl":"10.1016/j.mlwa.2024.100529","url":null,"abstract":"<div><p>Wearable biometric tracking devices are becoming increasingly common, providing users with physiological metrics such as heart rate variability (HRV) and skin conductance. We hypothesize that these metrics can be used as inputs for machine learning models to detect independent variables, such as target prevalence or hours awake, objective task performance, and metacognitive states. Over the course of 1–25 h awake, 40 participants completed four sessions of a simulated mine hunting task while non-invasive wearables collected physiological and behavioral data. The collected data were used to generate multiple machine learning models to detect the independent variables of the experiment (e.g., time awake and target prevalence), objective task performance, or metacognitive states. The strongest generated model was the time awake detection model (area under the curve = 0.92). All other models performed much closer to chance (area under the curve = 0.57–0.66), suggesting the model architecture used in this paper can detect time awake but falls short in other domains.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100529"},"PeriodicalIF":0.0,"publicationDate":"2024-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000057/pdfft?md5=7e522f76b29e81f313c4aa542e5bf20b&pid=1-s2.0-S2666827024000057-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139637961","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}
引用次数: 0
Parsimonious Bayesian model-based clustering with dissimilarities 基于贝叶斯模型的相似性聚类法
Pub Date : 2024-01-23 DOI: 10.1016/j.mlwa.2024.100528
Samuel Morrissette, Saman Muthukumarana, Maxime Turgeon

Clustering techniques are used to group observations and discover interesting patterns within data. Model-based clustering is one such method that is often an attractive choice due to the specification of a generative model for the given data and the ability to calculate model-selection criteria, which is in turn used to select the number of clusters. However, when only distances between observations are available, model-based clustering can no longer be used, and heuristic algorithms without the aforementioned advantages are usually used instead. As a solution, Oh and Raftery (2007) suggest a Bayesian model-based clustering method (named BMCD) that only requires a dissimilarity matrix as input, while also accounting for the measurement error that may be present within the observed data. In this paper, we extend the BMCD framework by proposing several additional models, alternative model selection criteria, and strategies for reducing computing time of the algorithm. These extensions ensure that the algorithm is effective even in high-dimensional spaces and provides a wide range of choices to the practitioner that can be used with a variety of data. Additionally, a publicly available software implementation of the algorithm is provided as a package in the R programming language.

聚类技术用于对观测数据进行分组,并发现数据中有趣的模式。基于模型的聚类就是这样一种方法,它通常是一种有吸引力的选择,因为它可以为给定数据指定一个生成模型,并能计算模型选择标准,进而用于选择聚类的数量。然而,当只有观测值之间的距离时,就不能再使用基于模型的聚类方法了,而通常会使用不具备上述优点的启发式算法。作为一种解决方案,Oh 和 Raftery(2007 年)提出了一种基于贝叶斯模型的聚类方法(命名为 BMCD),该方法只需要将异质性矩阵作为输入,同时还考虑了观测数据中可能存在的测量误差。在本文中,我们对 BMCD 框架进行了扩展,提出了几个额外的模型、可供选择的模型选择标准以及减少算法计算时间的策略。这些扩展确保了该算法即使在高维空间中也能有效,并为实践者提供了可用于各种数据的广泛选择。此外,该算法的公开软件实现以 R 编程语言包的形式提供。
{"title":"Parsimonious Bayesian model-based clustering with dissimilarities","authors":"Samuel Morrissette,&nbsp;Saman Muthukumarana,&nbsp;Maxime Turgeon","doi":"10.1016/j.mlwa.2024.100528","DOIUrl":"10.1016/j.mlwa.2024.100528","url":null,"abstract":"<div><p>Clustering techniques are used to group observations and discover interesting patterns within data. Model-based clustering is one such method that is often an attractive choice due to the specification of a generative model for the given data and the ability to calculate model-selection criteria, which is in turn used to select the number of clusters. However, when only distances between observations are available, model-based clustering can no longer be used, and heuristic algorithms without the aforementioned advantages are usually used instead. As a solution, Oh and Raftery (2007) suggest a Bayesian model-based clustering method (named BMCD) that only requires a dissimilarity matrix as input, while also accounting for the measurement error that may be present within the observed data. In this paper, we extend the BMCD framework by proposing several additional models, alternative model selection criteria, and strategies for reducing computing time of the algorithm. These extensions ensure that the algorithm is effective even in high-dimensional spaces and provides a wide range of choices to the practitioner that can be used with a variety of data. Additionally, a publicly available software implementation of the algorithm is provided as a package in the <span>R</span> programming language.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100528"},"PeriodicalIF":0.0,"publicationDate":"2024-01-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000045/pdfft?md5=629a7eab0214e09b4c647bb01508f6ac&pid=1-s2.0-S2666827024000045-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139636437","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}
引用次数: 0
The Butterfly Effect in artificial intelligence systems: Implications for AI bias and fairness 人工智能系统中的蝴蝶效应:人工智能偏见与公平的影响
Pub Date : 2024-01-19 DOI: 10.1016/j.mlwa.2024.100525
Emilio Ferrara

The concept of the Butterfly Effect, derived from chaos theory, highlights how seemingly minor changes can lead to significant, unpredictable outcomes in complex systems. This phenomenon is particularly pertinent in the realm of AI fairness and bias. Factors such as subtle biases in initial data, deviations during algorithm training, or shifts in data distribution from training to testing can inadvertently lead to pronounced unfair results. These results often disproportionately impact marginalized groups, reinforcing existing societal inequities. Furthermore, the Butterfly Effect can magnify biases in data or algorithms, intensify feedback loops, and heighten susceptibility to adversarial attacks. Recognizing the complex interplay within AI systems and their societal ramifications, it is imperative to rigorously scrutinize any modifications in algorithms or data inputs for possible unintended effects. This paper proposes a combination of algorithmic and empirical methods to identify, measure, and counteract the Butterfly Effect in AI systems. Our approach underscores the necessity of confronting these challenges to foster equitable outcomes and ensure responsible AI evolution.

蝴蝶效应的概念源自混沌理论,它强调了看似微小的变化如何在复杂的系统中导致重大的、不可预测的结果。这一现象在人工智能的公平性和偏差领域尤为重要。初始数据中的微妙偏差、算法训练过程中的偏差或从训练到测试过程中数据分布的变化等因素,都可能在不经意间导致明显的不公平结果。这些结果往往会对边缘化群体造成不成比例的影响,加剧现有的社会不平等。此外,蝴蝶效应会放大数据或算法中的偏差,强化反馈循环,并增加遭受对抗性攻击的可能性。认识到人工智能系统内部复杂的相互作用及其社会影响,当务之急是严格审查对算法或数据输入的任何修改,以防产生意外影响。本文提出了一种算法与经验相结合的方法,用于识别、测量和抵消人工智能系统中的蝴蝶效应。我们的方法强调了应对这些挑战的必要性,以促进公平结果,确保负责任的人工智能进化。
{"title":"The Butterfly Effect in artificial intelligence systems: Implications for AI bias and fairness","authors":"Emilio Ferrara","doi":"10.1016/j.mlwa.2024.100525","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100525","url":null,"abstract":"<div><p>The concept of the Butterfly Effect, derived from chaos theory, highlights how seemingly minor changes can lead to significant, unpredictable outcomes in complex systems. This phenomenon is particularly pertinent in the realm of AI fairness and bias. Factors such as subtle biases in initial data, deviations during algorithm training, or shifts in data distribution from training to testing can inadvertently lead to pronounced unfair results. These results often disproportionately impact marginalized groups, reinforcing existing societal inequities. Furthermore, the Butterfly Effect can magnify biases in data or algorithms, intensify feedback loops, and heighten susceptibility to adversarial attacks. Recognizing the complex interplay within AI systems and their societal ramifications, it is imperative to rigorously scrutinize any modifications in algorithms or data inputs for possible unintended effects. This paper proposes a combination of algorithmic and empirical methods to identify, measure, and counteract the Butterfly Effect in AI systems. Our approach underscores the necessity of confronting these challenges to foster equitable outcomes and ensure responsible AI evolution.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100525"},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S266682702400001X/pdfft?md5=aa9ef67df9deb7cf98a17c19648d4456&pid=1-s2.0-S266682702400001X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139503572","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}
引用次数: 0
Survey, classification and critical analysis of the literature on corporate bankruptcy and financial distress prediction 企业破产和财务困境预测文献的调查、分类和批判性分析
Pub Date : 2024-01-11 DOI: 10.1016/j.mlwa.2024.100527
Jinxian Zhao , Jamal Ouenniche , Johannes De Smedt

Corporate bankruptcy and financial distress prediction is a topic of interest for a variety of stakeholders, including businesses, financial institutions, investors, regulatory bodies, auditors, and academics. Various statistical and artificial intelligence methodologies have been devised to produce more accurate predictions. As more researchers are now focusing on this growing field of interest, this paper provides an up-to-date comprehensive survey, classification, and critical analysis of the literature on corporate bankruptcy and financial distress predictions, including definitions of bankruptcy and financial distress, prediction methodologies and models, data pre-processing, feature selection, model implementation, performance criteria and their measures for assessing the performance of classifiers or prediction models, and methodologies for the performance evaluation of prediction models. Finally, a critical analysis of the surveyed literature is provided to inspire possible future research directions.

企业破产和财务困境预测是企业、金融机构、投资者、监管机构、审计师和学术界等各利益相关方都感兴趣的话题。为了做出更准确的预测,人们设计了各种统计和人工智能方法。随着越来越多的研究人员开始关注这一日益增长的领域,本文对有关企业破产和财务困境预测的文献进行了最新的全面调查、分类和批判性分析,包括破产和财务困境的定义、预测方法和模型、数据预处理、特征选择、模型实现、评估分类器或预测模型性能的性能标准及其测量方法,以及预测模型性能评估的方法。最后,对所调查的文献进行了批判性分析,以启发未来可能的研究方向。
{"title":"Survey, classification and critical analysis of the literature on corporate bankruptcy and financial distress prediction","authors":"Jinxian Zhao ,&nbsp;Jamal Ouenniche ,&nbsp;Johannes De Smedt","doi":"10.1016/j.mlwa.2024.100527","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100527","url":null,"abstract":"<div><p>Corporate bankruptcy and financial distress prediction is a topic of interest for a variety of stakeholders, including businesses, financial institutions, investors, regulatory bodies, auditors, and academics. Various statistical and artificial intelligence methodologies have been devised to produce more accurate predictions. As more researchers are now focusing on this growing field of interest, this paper provides an up-to-date comprehensive survey, classification, and critical analysis of the literature on corporate bankruptcy and financial distress predictions, including definitions of bankruptcy and financial distress, prediction methodologies and models, data pre-processing, feature selection, model implementation, performance criteria and their measures for assessing the performance of classifiers or prediction models, and methodologies for the performance evaluation of prediction models. Finally, a critical analysis of the surveyed literature is provided to inspire possible future research directions.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100527"},"PeriodicalIF":0.0,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000033/pdfft?md5=92a0a4f22c8d9ab4a70836323e00be27&pid=1-s2.0-S2666827024000033-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139487722","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}
引用次数: 0
Programming with ChatGPT: How far can we go? 使用 ChatGPT 编程:我们能走多远?
Pub Date : 2024-01-08 DOI: 10.1016/j.mlwa.2024.100526
Alessio Bucaioni , Hampus Ekedahl , Vilma Helander , Phuong T. Nguyen

Artificial intelligence (AI) has made remarkable strides, giving rise to the development of large language models such as ChatGPT. The chatbot has garnered significant attention from academia, industry, and the general public, marking the beginning of a new era in AI applications. This work explores how well ChatGPT can write source code. To this end, we performed a series of experiments to assess the extent to which ChatGPT is capable of solving general programming problems. Our objective is to assess ChatGPT’s capabilities in two different programming languages, namely C++ and Java, by providing it with a set of programming problem, encompassing various types and difficulty levels. We focus on evaluating ChatGPT’s performance in terms of code correctness, run-time efficiency, and memory usage. The experimental results show that, while ChatGPT is good at solving easy and medium programming problems written in C++ and Java, it encounters some difficulties with more complicated tasks in the two languages. Compared to code written by humans, the one generated by ChatGPT is of lower quality, with respect to runtime and memory usage.

人工智能(AI)取得了长足的进步,催生了大型语言模型的开发,如 ChatGPT。该聊天机器人引起了学术界、工业界和公众的极大关注,标志着人工智能应用新时代的开始。这项工作探索了 ChatGPT 编写源代码的能力。为此,我们进行了一系列实验,以评估 ChatGPT 解决一般编程问题的能力。我们的目标是评估 ChatGPT 在两种不同编程语言(即 C++ 和 Java)中的能力,为其提供一组包含各种类型和难度的编程问题。我们重点评估了 ChatGPT 在代码正确性、运行效率和内存使用方面的性能。实验结果表明,虽然 ChatGPT 擅长解决用 C++ 和 Java 编写的简单和中等难度的编程问题,但在处理这两种语言中较为复杂的任务时却遇到了一些困难。与人类编写的代码相比,ChatGPT 生成的代码在运行时间和内存使用方面质量较低。
{"title":"Programming with ChatGPT: How far can we go?","authors":"Alessio Bucaioni ,&nbsp;Hampus Ekedahl ,&nbsp;Vilma Helander ,&nbsp;Phuong T. Nguyen","doi":"10.1016/j.mlwa.2024.100526","DOIUrl":"https://doi.org/10.1016/j.mlwa.2024.100526","url":null,"abstract":"<div><p>Artificial intelligence (AI) has made remarkable strides, giving rise to the development of large language models such as ChatGPT. The chatbot has garnered significant attention from academia, industry, and the general public, marking the beginning of a new era in AI applications. This work explores how well ChatGPT can write source code. To this end, we performed a series of experiments to assess the extent to which ChatGPT is capable of solving general programming problems. Our objective is to assess ChatGPT’s capabilities in two different programming languages, namely C++ and Java, by providing it with a set of programming problem, encompassing various types and difficulty levels. We focus on evaluating ChatGPT’s performance in terms of code correctness, run-time efficiency, and memory usage. The experimental results show that, while ChatGPT is good at solving easy and medium programming problems written in C++ and Java, it encounters some difficulties with more complicated tasks in the two languages. Compared to code written by humans, the one generated by ChatGPT is of lower quality, with respect to runtime and memory usage.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100526"},"PeriodicalIF":0.0,"publicationDate":"2024-01-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827024000021/pdfft?md5=5e985b2a30a1b2c3a0dffb6f7415b779&pid=1-s2.0-S2666827024000021-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139436314","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}
引用次数: 0
SODRet: Instance retrieval using salient object detection for self-service shopping SODRet:利用突出对象检测进行实例检索,用于自助购物
Pub Date : 2023-12-29 DOI: 10.1016/j.mlwa.2023.100523
Muhammad Umair Hassan , Xiuyang Zhao , Raheem Sarwar , Naif R. Aljohani , Ibrahim A. Hameed

Self-service shopping technologies have become commonplace in modern society. Although various innovative solutions have been adopted, there is still a gap in providing efficient services to consumers. Recent developments in mobile application technologies and internet-of-things devices promote information and knowledge dissemination by integrating innovative services to meet users’ needs. We argue that object retrieval applications can be used to provide effective online or self-service shopping. Therefore, to fill this technological void, this study aims to propose an object retrieval system using a fusion-based salient object detection (SOD) method. The SOD has attracted significant attention, and recently many heuristic computational models have been developed for object detection. It has been widely used in object detection and retrieval applications. This work proposes an instance retrieval system based on the SOD to find the objects from the commodity datasets. A prediction about the object’s position is made using the saliency detection system through a saliency model, and the proposed SOD-based retrieval (SODRet) framework uses saliency maps for retrieving the searched items. The method proposed in this work is evaluated on INSTRE and Flickr32 datasets. Our proposed work outperforms state-of-the-art object retrieval methods and can further be employed for large-scale self-service shopping-based points of sales.

自助购物技术在现代社会已变得司空见惯。虽然各种创新解决方案已被采用,但在为消费者提供高效服务方面仍存在差距。移动应用技术和物联网设备的最新发展通过整合创新服务来满足用户需求,从而促进了信息和知识的传播。我们认为,对象检索应用可用于提供有效的在线或自助购物服务。因此,为了填补这一技术空白,本研究旨在提出一种使用基于融合的突出对象检测(SOD)方法的对象检索系统。SOD 已经引起了广泛的关注,最近已经开发出了许多用于物体检测的启发式计算模型。它已被广泛应用于物体检测和检索领域。本作品提出了一种基于 SOD 的实例检索系统,用于从商品数据集中查找物体。通过一个突出度模型,使用突出度检测系统对物体的位置进行预测,而所提出的基于 SOD 的检索(SODRet)框架则使用突出度地图来检索所搜索的项目。本文提出的方法在 INSTRE 和 Flickr32 数据集上进行了评估。我们提出的方法优于最先进的物品检索方法,可进一步用于大规模自助购物销售点。
{"title":"SODRet: Instance retrieval using salient object detection for self-service shopping","authors":"Muhammad Umair Hassan ,&nbsp;Xiuyang Zhao ,&nbsp;Raheem Sarwar ,&nbsp;Naif R. Aljohani ,&nbsp;Ibrahim A. Hameed","doi":"10.1016/j.mlwa.2023.100523","DOIUrl":"https://doi.org/10.1016/j.mlwa.2023.100523","url":null,"abstract":"<div><p>Self-service shopping technologies have become commonplace in modern society. Although various innovative solutions have been adopted, there is still a gap in providing efficient services to consumers. Recent developments in mobile application technologies and internet-of-things devices promote information and knowledge dissemination by integrating innovative services to meet users’ needs. We argue that object retrieval applications can be used to provide effective online or self-service shopping. Therefore, to fill this technological void, this study aims to propose an object retrieval system using a fusion-based salient object detection (SOD) method. The SOD has attracted significant attention, and recently many heuristic computational models have been developed for object detection. It has been widely used in object detection and retrieval applications. This work proposes an instance retrieval system based on the SOD to find the objects from the commodity datasets. A prediction about the object’s position is made using the saliency detection system through a saliency model, and the proposed SOD-based retrieval (SODRet) framework uses saliency maps for retrieving the searched items. The method proposed in this work is evaluated on INSTRE and Flickr32 datasets. Our proposed work outperforms state-of-the-art object retrieval methods and can further be employed for large-scale self-service shopping-based points of sales.</p></div>","PeriodicalId":74093,"journal":{"name":"Machine learning with applications","volume":"15 ","pages":"Article 100523"},"PeriodicalIF":0.0,"publicationDate":"2023-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2666827023000762/pdfft?md5=abc56b1fd2afff0bbba8196b583e291f&pid=1-s2.0-S2666827023000762-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139109223","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}
引用次数: 0
期刊
Machine learning with applications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1