首页 > 最新文献
paperpass

Advances in computational intelligence最新文献

英文 中文
DAC: Dual-granularity Adaptive Calibration via per-sample uncertainty for CNN–Transformer medical image classification DAC:基于每个样本不确定度的双粒度自适应校准CNN-Transformer医学图像分类
Pub Date : 2026-09-17 DOI: 10.1007/s43674-026-00093-5
Rohul Amin, Md. Mehedi Rahman Rana, Sumya Aktar

Reliable medical image classification demands two things from deep learning models: high diagnostic accuracy and confidence scores that reflect true uncertainty. Poorly calibrated predictions mislead clinical decision support systems even when accuracy looks acceptable. Hybrid CNN–Transformer architectures capture both local texture and global structural features, but their fusion strategies treat every input identically—a critical limitation, because texture detail and global morphology carry different diagnostic weight across conditions and patients. This work introduces Dual-granularity Adaptive Calibration (DAC), which reframes branch fusion as a per-sample reliability calibration problem. Instead of fixed weights or spatial attention, DAC estimates the reliability of each branch for every input using three complementary signals: predictive entropy, Jensen–Shannon divergence between branch distributions, and exponential moving average feature consistency. A lightweight reliability estimator converts these signals into per-sample fusion weights over branch representations projected to a common feature space. An Adaptive Prototype Classifier (APC) with a dedicated reliability calibration loss then ensures that confidence scores faithfully reflect empirical accuracy. All baselines are reimplemented on identical lesion-disjoint data splits under five independent random seeds to ensure fair comparison; ECE improvements are measured against temperature-scaled post hoc calibration. On HAM10000 (7-class skin lesion, (n = 9015) deduplicated, lesion-disjoint split) and the Kermany Retinal OCT dataset (4-class, (n = 92{,}484)), DAC achieves (93.74 pm 0.29%) and (98.30 pm 0.14%) accuracy whilst reducing Expected Calibration Error (ECE) to (0.031 pm 0.003) and (0.018 pm 0.002)—improvements of 0.031 and 0.030 ECE over the strongest reimplemented baselines (McNemar’s test, (p < 0.001) for both accuracy comparisons, per-seed). A ten-row ablation study confirms each component contributes independently and consistently, and the learned fusion weights show that DAC autonomously prefers local texture on skin data and global structure on retinal data without explicit supervision.

可靠的医学图像分类对深度学习模型有两个要求:高诊断准确性和反映真实不确定性的置信度评分。校准不当的预测会误导临床决策支持系统,即使准确度看起来可以接受。混合CNN-Transformer架构捕捉局部纹理和全局结构特征,但它们的融合策略对每个输入都是相同的,这是一个关键的限制,因为纹理细节和全局形态学在不同的条件和患者中具有不同的诊断权重。本研究引入了双粒度自适应校准(DAC),将分支融合重构为每个样本的可靠性校准问题。DAC不是固定权重或空间注意力,而是使用三个互补信号来估计每个输入的每个分支的可靠性:预测熵、分支分布之间的Jensen-Shannon散度和指数移动平均特征一致性。一个轻量级的可靠性估计器将这些信号转换成每个样本在分支表示上的融合权重,投射到一个公共特征空间。具有专用可靠性校准损失的自适应原型分类器(APC)确保置信度分数忠实地反映经验准确性。在5个独立的随机种子下,在相同的损伤分离数据分割上重新实现所有基线,以确保公平比较;ECE的改进是根据温度尺度的事后校准来衡量的。在HAM10000(7级皮肤病变,(n = 9015)重复数据删除,病变分离)和Kermany视网膜OCT数据集(4级,(n = 92{,}484))上,DAC达到(93.74 pm 0.29%)和(98.30 pm 0.14%)精度,同时将预期校准误差(ECE)降低到(0.031 pm 0.003)和(0.018 pm 0.002) -比最强重新实现的基线提高0.031和0.030 ECE (McNemar的测试,(p < 0.001)用于精度比较,每个种子)。一项十行消融研究证实了每个成分独立且一致地贡献,并且学习到的融合权重表明DAC在没有明确监督的情况下自主地偏爱皮肤数据上的局部纹理和视网膜数据上的全局结构。
{"title":"DAC: Dual-granularity Adaptive Calibration via per-sample uncertainty for CNN–Transformer medical image classification","authors":"Rohul Amin,&nbsp;Md. Mehedi Rahman Rana,&nbsp;Sumya Aktar","doi":"10.1007/s43674-026-00093-5","DOIUrl":"10.1007/s43674-026-00093-5","url":null,"abstract":"<div><p>Reliable medical image classification demands two things from deep learning models: high diagnostic accuracy and confidence scores that reflect true uncertainty. Poorly calibrated predictions mislead clinical decision support systems even when accuracy looks acceptable. Hybrid CNN–Transformer architectures capture both local texture and global structural features, but their fusion strategies treat every input identically—a critical limitation, because texture detail and global morphology carry different diagnostic weight across conditions and patients. This work introduces Dual-granularity Adaptive Calibration (DAC), which reframes branch fusion as a per-sample reliability calibration problem. Instead of fixed weights or spatial attention, DAC estimates the reliability of each branch for every input using three complementary signals: predictive entropy, Jensen–Shannon divergence between branch distributions, and exponential moving average feature consistency. A lightweight reliability estimator converts these signals into per-sample fusion weights over branch representations projected to a common feature space. An Adaptive Prototype Classifier (APC) with a dedicated reliability calibration loss then ensures that confidence scores faithfully reflect empirical accuracy. All baselines are reimplemented on identical lesion-disjoint data splits under five independent random seeds to ensure fair comparison; ECE improvements are measured against temperature-scaled post hoc calibration. On HAM10000 (7-class skin lesion, <span>(n = 9015)</span> deduplicated, lesion-disjoint split) and the Kermany Retinal OCT dataset (4-class, <span>(n = 92{,}484)</span>), DAC achieves <span>(93.74 pm 0.29%)</span> and <span>(98.30 pm 0.14%)</span> accuracy whilst reducing Expected Calibration Error (ECE) to <span>(0.031 pm 0.003)</span> and <span>(0.018 pm 0.002)</span>—improvements of 0.031 and 0.030 ECE over the strongest reimplemented baselines (McNemar’s test, <span>(p &lt; 0.001)</span> for both accuracy comparisons, per-seed). A ten-row ablation study confirms each component contributes independently and consistently, and the learned fusion weights show that DAC autonomously prefers local texture on skin data and global structure on retinal data without explicit supervision.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148986709","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Tabular deep neural networks and causal inference-based feature selection for PCOS diagnosis 表状深度神经网络和基于因果推理的PCOS诊断特征选择
Pub Date : 2026-08-31 DOI: 10.1007/s43674-026-00092-6
Kazi Sakib Hasan

Polycystic Ovary Syndrome (PCOS) is a prevalent endocrine disorder with complex diagnostic challenges due to symptom heterogeneity and limited clinical criteria. This study presents an AI-driven diagnostic framework integrating tabular deep learning, causal inference, and interpretability techniques to enhance PCOS diagnosis. To the best of our knowledge, this is the first study to jointly leverage state-of-the-art tabular models—TabNet, FT-Transformer, and TabPFN—alongside heterogeneous ensemble methods in the context of PCOS diagnosis. Our approach achieves competitive performance, with the Bayesian Neural Network (BNN) attaining 93.83% accuracy on the test set and demonstrating better probability calibration (ECE = 0.02). Key contributions include a Causal-Neural Boosted Ensemble (CNBE) trained on causally significant features via a Causal-Gated Structural Regularization (CGSR) mechanism, and few-shot learning strategies for low-data adaptability. Interpretability is ensured through SHAP analysis and intrinsic attention mechanisms. Causal inference reveals clinically actionable insights, such as the strong causal influence of metabolic and lifestyle factors. The framework contributes to Trustworthy ML principles by providing transparency and uncertainty quantification, offering a foundation for future clinical decision support.

多囊卵巢综合征(PCOS)是一种常见的内分泌疾病,由于症状异质性和有限的临床标准,具有复杂的诊断挑战。本研究提出了一个人工智能驱动的诊断框架,集成了表格深度学习、因果推理和可解释性技术,以增强PCOS的诊断。据我们所知,这是第一个在PCOS诊断中联合利用最先进的表格模型(tabnet、FT-Transformer和tabpfn)以及异构集成方法的研究。我们的方法达到了具有竞争力的性能,贝叶斯神经网络(BNN)在测试集上达到了93.83%的准确率,并展示了更好的概率校准(ECE = 0.02)。主要贡献包括通过因果门控结构正则化(CGSR)机制训练因果显著特征的因果神经增强集成(CNBE),以及用于低数据适应性的少射学习策略。可解释性通过SHAP分析和内在注意机制来保证。因果推理揭示了临床可操作的见解,例如代谢和生活方式因素的强烈因果影响。该框架通过提供透明度和不确定性量化,为未来的临床决策支持奠定了基础,从而为值得信赖的ML原则做出了贡献。
{"title":"Tabular deep neural networks and causal inference-based feature selection for PCOS diagnosis","authors":"Kazi Sakib Hasan","doi":"10.1007/s43674-026-00092-6","DOIUrl":"10.1007/s43674-026-00092-6","url":null,"abstract":"<div><p>Polycystic Ovary Syndrome (PCOS) is a prevalent endocrine disorder with complex diagnostic challenges due to symptom heterogeneity and limited clinical criteria. This study presents an AI-driven diagnostic framework integrating tabular deep learning, causal inference, and interpretability techniques to enhance PCOS diagnosis. To the best of our knowledge, this is the first study to jointly leverage state-of-the-art tabular models—TabNet, FT-Transformer, and TabPFN—alongside heterogeneous ensemble methods in the context of PCOS diagnosis. Our approach achieves competitive performance, with the Bayesian Neural Network (BNN) attaining 93.83% accuracy on the test set and demonstrating better probability calibration (ECE = 0.02). Key contributions include a Causal-Neural Boosted Ensemble (CNBE) trained on causally significant features via a Causal-Gated Structural Regularization (CGSR) mechanism, and few-shot learning strategies for low-data adaptability. Interpretability is ensured through SHAP analysis and intrinsic attention mechanisms. Causal inference reveals clinically actionable insights, such as the strong causal influence of metabolic and lifestyle factors. The framework contributes to Trustworthy ML principles by providing transparency and uncertainty quantification, offering a foundation for future clinical decision support.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148927947","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Explainable GLCM-optimized nested stacking ensemble model for predicting rural household willingness to use photovoltaic solar panels in Jammu and Kashmir 用于预测查谟和克什米尔农村家庭使用光伏太阳能电池板意愿的可解释glcm优化嵌套堆叠集成模型
Pub Date : 2026-07-18 DOI: 10.1007/s43674-026-00091-7
Sourabh Shastri, Sachin Kumar, Saloni Singh, Sunny Sharma, Zahin Ansari, Asif Akhtar, Vibhakar Mansotra

The adoption of photovoltaic solar panels (PVSP) in rural areas remains uneven despite sustained policy support, indicating the need for predictive frameworks that can reliably inform decentralized energy planning in geographically complex regions. This study develops an interpretable and robust machine learning framework for predicting rural household willingness to adopt PVSP. This paper proposes an explainable, gray level co-occurrence matrix (GLCM)-optimized nested stacking ensemble model applied to survey data from rural households in Jammu and Kashmir. Texture-based GLCM descriptors are used to optimize socio-economic variables by capturing latent inter-feature dependencies, while a multi-level nested stacking technique integrates heterogeneous base learners to enhance generalization and prevent information leakage. The concept of model-agnostic explainability was used by employing the aggregation of global local interpretable model-agnostic explanations (LIME) interpretation of adoption factors among multiple households. From the experimental results, it is clear that good generalization has been achieved with an accuracy of 91.38%, F1 score of 91.87%, and ROC-AUC of 97.05%. These results show statistical significance compared with baselines using McNemar’s test (p < 0.05). Factors related to existing installation of PVSP, promotional marketing awareness drives, awareness about government schemes, climatic conditions, and perception were found to be the most important and stable drivers of adoption willingness from the explainability analysis conducted. The proposed framework offers a relevant tool for identifying adoption barriers and designing targeted interventions, contributing to evidence-based planning for decentralized solar energy transitions in rural and geographically constrained regions.

尽管有持续的政策支持,但农村地区光伏太阳能电池板(PVSP)的采用仍然不均衡,这表明需要能够可靠地为地理复杂地区的分散能源规划提供信息的预测框架。本研究开发了一个可解释且稳健的机器学习框架,用于预测农村家庭采用PVSP的意愿。本文提出了一种可解释的灰度共生矩阵(GLCM)优化嵌套叠加集成模型,应用于查谟和克什米尔农村家庭的调查数据。基于纹理的GLCM描述符通过捕获潜在的特征间依赖关系来优化社会经济变量,而多层次嵌套堆叠技术集成了异构基学习器,以增强泛化和防止信息泄漏。采用全局局部可解释模型不可知论解释(LIME)对多个家庭中收养因素的解释,采用模型不可知论解释的概念。从实验结果可以看出,该方法具有良好的泛化效果,准确率为91.38%,F1分数为91.87%,ROC-AUC为97.05%。与McNemar检验的基线相比,这些结果具有统计学意义(p < 0.05)。从可解释性分析中发现,与现有PVSP安装、促销营销意识驱动、对政府计划的认识、气候条件和感知相关的因素是采用意愿最重要和最稳定的驱动因素。提出的框架为确定采用障碍和设计有针对性的干预措施提供了相关工具,有助于在农村和地理受限地区为分散式太阳能过渡进行循证规划。
{"title":"Explainable GLCM-optimized nested stacking ensemble model for predicting rural household willingness to use photovoltaic solar panels in Jammu and Kashmir","authors":"Sourabh Shastri,&nbsp;Sachin Kumar,&nbsp;Saloni Singh,&nbsp;Sunny Sharma,&nbsp;Zahin Ansari,&nbsp;Asif Akhtar,&nbsp;Vibhakar Mansotra","doi":"10.1007/s43674-026-00091-7","DOIUrl":"10.1007/s43674-026-00091-7","url":null,"abstract":"<div><p>The adoption of photovoltaic solar panels (PVSP) in rural areas remains uneven despite sustained policy support, indicating the need for predictive frameworks that can reliably inform decentralized energy planning in geographically complex regions. This study develops an interpretable and robust machine learning framework for predicting rural household willingness to adopt PVSP. This paper proposes an explainable, gray level co-occurrence matrix (GLCM)-optimized nested stacking ensemble model applied to survey data from rural households in Jammu and Kashmir. Texture-based GLCM descriptors are used to optimize socio-economic variables by capturing latent inter-feature dependencies, while a multi-level nested stacking technique integrates heterogeneous base learners to enhance generalization and prevent information leakage. The concept of model-agnostic explainability was used by employing the aggregation of global local interpretable model-agnostic explanations (LIME) interpretation of adoption factors among multiple households. From the experimental results, it is clear that good generalization has been achieved with an accuracy of 91.38%, F1 score of 91.87%, and ROC-AUC of 97.05%. These results show statistical significance compared with baselines using McNemar’s test (<i>p</i> &lt; 0.05). Factors related to existing installation of PVSP, promotional marketing awareness drives, awareness about government schemes, climatic conditions, and perception were found to be the most important and stable drivers of adoption willingness from the explainability analysis conducted. The proposed framework offers a relevant tool for identifying adoption barriers and designing targeted interventions, contributing to evidence-based planning for decentralized solar energy transitions in rural and geographically constrained regions.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148466567","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Graph-enhanced reasoning networks for explainable robustness scoring in structured question evaluation 结构化问题评估中可解释稳健性评分的图增强推理网络
Pub Date : 2026-07-03 DOI: 10.1007/s43674-026-00090-8
Olaniyan Deborah, Wario Ruth

Ensuring that examination questions are pedagogically sound and aligned with the curriculum remains a key challenge in automated assessment. Most existing approaches focus on answer correctness or surface-level textual similarity, overlooking whether questions genuinely reflect syllabus content, require appropriate reasoning, or maintain structural coherence. This study presents SyllabiQA-RSNet, a syllabus-driven framework for automatically evaluating exam question quality. The model combines DeBERTa—large contextual embeddings with graph attention-based syllabus reasoning, capturing dependencies across syllabus sections and multi-step logical connections between questions and course content. Robustness scoring is formulated as a multi-task problem, with the model simultaneously predicting answers, generating reasoning chains, and producing continuous robustness scores. Evaluation on the SyllabusQA benchmark, comprising 5078 question–answer pairs from 63 university syllabi across STEM and non-STEM fields, demonstrates that SyllabiQA-RSNet substantially outperforms baseline models. It achieved a Pearson correlation of 0.79 and Spearman correlation of 0.76 with reference robustness scores, compared to 0.64 for DeBERTa-only and 0.58 for RoBERTa, while reducing RMSE to 0.082. The framework also enhanced answer prediction, particularly for reasoning-intensive questions, improving Exact Match scores by up to 7.2 points and producing higher-quality reasoning chains (+ 8.3 BLEU-4, + 8.8 ROUGE-L). Ablation studies confirmed the necessity of both syllabus graph reasoning and explicit robustness supervision, with their removal causing up to an 11-point drop in robustness correlation. These results indicate that explicitly modeling syllabus structure is critical for reliable, interpretable assessment of question quality, offering insights beyond simple answer correctness and enabling automated evaluation that aligns closely with pedagogical objectives.

确保考试问题在教学上合理,并与课程保持一致,仍然是自动化评估的一个关键挑战。大多数现有的方法都侧重于答案的正确性或表面上的文本相似性,而忽略了问题是否真正反映了教学大纲的内容,是否需要适当的推理,是否保持了结构的连贯性。本研究提出了一个教学大纲驱动的框架,用于自动评估考试问题的质量。该模型将DeBERTa-large上下文嵌入与基于注意力的图形教学大纲推理相结合,捕获教学大纲部分之间的依赖关系以及问题和课程内容之间的多步骤逻辑连接。稳健性评分被表述为一个多任务问题,模型同时预测答案,生成推理链,并产生连续的稳健性评分。对来自STEM和非STEM领域的63所大学教学大纲的5078对问题的评估表明,syllable - rsnet大大优于基线模型。与参考稳健性评分的Pearson相关性为0.79,Spearman相关性为0.76,而仅deberta的相关性为0.64,RoBERTa的相关性为0.58,同时将RMSE降低到0.082。该框架还增强了答案预测,特别是对于推理密集型问题,将精确匹配得分提高了7.2分,并产生了更高质量的推理链(+ 8.3 BLEU-4, + 8.8 ROUGE-L)。消融研究证实了教学大纲图推理和明确的稳健性监督的必要性,它们的移除导致稳健性相关性下降高达11点。这些结果表明,明确建模教学大纲结构对于可靠的、可解释的问题质量评估至关重要,提供了超越简单答案正确性的见解,并使自动化评估与教学目标紧密结合。
{"title":"Graph-enhanced reasoning networks for explainable robustness scoring in structured question evaluation","authors":"Olaniyan Deborah,&nbsp;Wario Ruth","doi":"10.1007/s43674-026-00090-8","DOIUrl":"10.1007/s43674-026-00090-8","url":null,"abstract":"<div><p>Ensuring that examination questions are pedagogically sound and aligned with the curriculum remains a key challenge in automated assessment. Most existing approaches focus on answer correctness or surface-level textual similarity, overlooking whether questions genuinely reflect syllabus content, require appropriate reasoning, or maintain structural coherence. This study presents SyllabiQA-RSNet, a syllabus-driven framework for automatically evaluating exam question quality. The model combines DeBERTa—large contextual embeddings with graph attention-based syllabus reasoning, capturing dependencies across syllabus sections and multi-step logical connections between questions and course content. Robustness scoring is formulated as a multi-task problem, with the model simultaneously predicting answers, generating reasoning chains, and producing continuous robustness scores. Evaluation on the SyllabusQA benchmark, comprising 5078 question–answer pairs from 63 university syllabi across STEM and non-STEM fields, demonstrates that SyllabiQA-RSNet substantially outperforms baseline models. It achieved a Pearson correlation of 0.79 and Spearman correlation of 0.76 with reference robustness scores, compared to 0.64 for DeBERTa-only and 0.58 for RoBERTa, while reducing RMSE to 0.082. The framework also enhanced answer prediction, particularly for reasoning-intensive questions, improving Exact Match scores by up to 7.2 points and producing higher-quality reasoning chains (+ 8.3 BLEU-4, + 8.8 ROUGE-L). Ablation studies confirmed the necessity of both syllabus graph reasoning and explicit robustness supervision, with their removal causing up to an 11-point drop in robustness correlation. These results indicate that explicitly modeling syllabus structure is critical for reliable, interpretable assessment of question quality, offering insights beyond simple answer correctness and enabling automated evaluation that aligns closely with pedagogical objectives.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 2","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43674-026-00090-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148366115","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
Motivators and detractors to integration of the user AI experience 用户AI体验整合的激励因素和损害因素
Pub Date : 2026-03-27 DOI: 10.1007/s43674-026-00088-2
Thomas S. Mueller

Developers and marketers of artificial intelligence (AI) powered innovations have pushed technology to the forefront, well ahead of user experience and ethical implications. This exploratory study used qualitative semi-structured interviews (N = 21) and then quantitative analysis (N = 629) to predict user motivators and detractors to AI adaptation. Fifty-eight percent of respondents in this study did not agree that AI will benefit our society. There was a significant difference those identified as highly feminine and the highly masculine. Those politically conservative were less likely to support AI initiatives than those politically liberal. Independent variables were factored into latent themes “Ethical Outcomes”, Social Media Risk vs. Reward”, and “Governmental Constraint.” Ethical Outcomes was the key significant predictor of “trust AI with my personal and business activities.” The effect of Social Media Risk was marginal but significant. Logistic regression with the dependent variable “overall, artificial intelligence will benefit our society” once again captured Ethical Outcomes. The concern for social media implications was 19% more likely to be considered when pondering beneficence of AI in society. Governmental Constraint was 70% more likely to occur. When AI is considered as a future religious entity, users perceive a decrease in benefit to society. A hierarchical decision tree with the target variable “trust related to AI” illustrates users first consider ethical implications of AI in society, and then face dilemmas of copyright infringement and effect on political elections.

人工智能(AI)驱动创新的开发者和营销人员将技术推向了最前沿,远远超过了用户体验和道德影响。本探索性研究采用定性半结构化访谈(N = 21)和定量分析(N = 629)来预测用户对人工智能适应的激励因素和诋毁因素。在这项研究中,58%的受访者不同意人工智能将造福我们的社会。高度女性化和高度男性化的结果有显著差异。政治上保守的人比政治上自由的人更不可能支持人工智能计划。自变量被考虑到潜在的主题“道德结果”、社交媒体风险与回报”和“政府约束”。道德结果是“将我的个人和商业活动信任人工智能”的关键重要预测因素。社交媒体风险的影响很小,但很显著。因变量为“总体而言,人工智能将造福我们的社会”的逻辑回归再次抓住了伦理结果。在考虑人工智能对社会的好处时,对社交媒体影响的担忧比考虑人工智能对社会的好处的可能性高19%。政府约束发生的可能性要高出70%。当人工智能被视为未来的宗教实体时,用户认为它对社会的好处会减少。以目标变量“与人工智能相关的信任”为层次决策树,说明用户首先考虑人工智能对社会的伦理影响,然后面临版权侵权和对政治选举的影响的困境。
{"title":"Motivators and detractors to integration of the user AI experience","authors":"Thomas S. Mueller","doi":"10.1007/s43674-026-00088-2","DOIUrl":"10.1007/s43674-026-00088-2","url":null,"abstract":"<div><p>Developers and marketers of artificial intelligence (AI) powered innovations have pushed technology to the forefront, well ahead of user experience and ethical implications. This exploratory study used qualitative semi-structured interviews (<i>N</i> = 21) and then quantitative analysis (<i>N</i> = 629) to predict user motivators and detractors to AI adaptation. Fifty-eight percent of respondents in this study did not agree that AI will benefit our society. There was a significant difference those identified as highly feminine and the highly masculine. Those politically conservative were less likely to support AI initiatives than those politically liberal. Independent variables were factored into latent themes “Ethical Outcomes”, Social Media Risk vs. Reward”, and “Governmental Constraint.” Ethical Outcomes was the key significant predictor of “trust AI with my personal and business activities.” The effect of Social Media Risk was marginal but significant. Logistic regression with the dependent variable “overall, artificial intelligence will benefit our society” once again captured Ethical Outcomes. The concern for social media implications was 19% more likely to be considered when pondering beneficence of AI in society. Governmental Constraint was 70% more likely to occur. When AI is considered as a future religious entity, users perceive a decrease in benefit to society. A hierarchical decision tree with the target variable “trust related to AI” illustrates users first consider ethical implications of AI in society, and then face dilemmas of copyright infringement and effect on political elections.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-03-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s43674-026-00088-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147561761","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
AI-enhanced ECG analysis for arrhythmia classification with edge device compatibility 具有边缘设备兼容性的人工智能增强心电分析心律失常分类
Pub Date : 2026-01-31 DOI: 10.1007/s43674-026-00087-3
Hermawan Nugroho, Ke Jun Peng, Anandan Shanmugam

Cardiovascular diseases (CVDs) are the leading cause of global mortality, necessitating efficient and accessible diagnostic tools for early detection. While deep learning models have demonstrated high accuracy in arrhythmia classification, their deployment in resource-limited clinical settings remains challenging due to computational constraints. This study addresses this gap by developing and validating lightweight deep learning models specifically optimized for edge device deployment, enabling real-time ECG analysis in remote and under-resourced healthcare environments. Utilizing the MIT-BIH Arrhythmia Dataset, which includes 48 half-hour ECG recordings from 47 individuals, we trained and evaluated 2 models: a standard Convolutional Neural Network (CNN) and a computationally efficient Depth-Wise Separable Convolutional Neural Network (DWCNN). Preprocessing involved segmenting ECG recordings into individual heartbeats and addressing class imbalance through downsampling, resulting in a balanced dataset of 21,186 images across 6 arrhythmia types. The DWCNN achieved competitive diagnostic performance (precision: 0.97, recall: 0.97) while utilizing 75% fewer parameters than the standard CNN (8.45 M vs. 34.08 M) and 65% less memory (8.4 MB vs. 24.1 MB). Critically, we demonstrate successful deployment on the Intel Neural Compute Stick 2 (NCS2), a resource-constrained edge device, achieving inference times of 4.09 ms/241.91FPS on CPU and 9.05 ms/109.79FPS on the NCS2 platform. This practical demonstration of real-time arrhythmia classification on low-power edge devices represents a significant advancement toward accessible cardiac diagnostics in point-of-care settings, remote monitoring applications, and resource-limited healthcare facilities where centralized computing infrastructure or specialist expertise may be unavailable.

心血管疾病是全球死亡的主要原因,因此需要有效和可获得的诊断工具来进行早期发现。虽然深度学习模型在心律失常分类方面具有很高的准确性,但由于计算限制,它们在资源有限的临床环境中的部署仍然具有挑战性。本研究通过开发和验证专为边缘设备部署优化的轻量级深度学习模型来解决这一差距,从而在远程和资源不足的医疗保健环境中实现实时ECG分析。利用MIT-BIH心律失常数据集,其中包括来自47个人的48小时ECG记录,我们训练并评估了两种模型:标准卷积神经网络(CNN)和计算效率高的深度可分离卷积神经网络(DWCNN)。预处理包括将ECG记录分割为单个心跳,并通过降采样解决类不平衡问题,从而获得包含6种心律失常类型的21,186张图像的平衡数据集。DWCNN在使用比标准CNN少75%的参数(8.45 M vs. 34.08 M)和65%的内存(8.4 MB vs. 24.1 MB)的情况下实现了具有竞争力的诊断性能(准确率:0.97,召回率:0.97)。关键的是,我们展示了在英特尔神经计算棒2 (NCS2)上的成功部署,这是一种资源受限的边缘设备,在CPU上实现了4.09 ms/241.91FPS的推理时间,在NCS2平台上实现了9.05 ms/109.79FPS的推理时间。在低功耗边缘设备上进行实时心律失常分类的实际演示,代表了在护理点设置、远程监控应用程序和资源有限的医疗保健设施(可能无法获得集中计算基础设施或专业知识)中可获得心脏诊断的重大进步。
{"title":"AI-enhanced ECG analysis for arrhythmia classification with edge device compatibility","authors":"Hermawan Nugroho,&nbsp;Ke Jun Peng,&nbsp;Anandan Shanmugam","doi":"10.1007/s43674-026-00087-3","DOIUrl":"10.1007/s43674-026-00087-3","url":null,"abstract":"<div><p>Cardiovascular diseases (CVDs) are the leading cause of global mortality, necessitating efficient and accessible diagnostic tools for early detection. While deep learning models have demonstrated high accuracy in arrhythmia classification, their deployment in resource-limited clinical settings remains challenging due to computational constraints. This study addresses this gap by developing and validating lightweight deep learning models specifically optimized for edge device deployment, enabling real-time ECG analysis in remote and under-resourced healthcare environments. Utilizing the MIT-BIH Arrhythmia Dataset, which includes 48 half-hour ECG recordings from 47 individuals, we trained and evaluated 2 models: a standard Convolutional Neural Network (CNN) and a computationally efficient Depth-Wise Separable Convolutional Neural Network (DWCNN). Preprocessing involved segmenting ECG recordings into individual heartbeats and addressing class imbalance through downsampling, resulting in a balanced dataset of 21,186 images across 6 arrhythmia types. The DWCNN achieved competitive diagnostic performance (precision: 0.97, recall: 0.97) while utilizing 75% fewer parameters than the standard CNN (8.45 M vs. 34.08 M) and 65% less memory (8.4 MB vs. 24.1 MB). Critically, we demonstrate successful deployment on the Intel Neural Compute Stick 2 (NCS2), a resource-constrained edge device, achieving inference times of 4.09 ms/241.91FPS on CPU and 9.05 ms/109.79FPS on the NCS2 platform. This practical demonstration of real-time arrhythmia classification on low-power edge devices represents a significant advancement toward accessible cardiac diagnostics in point-of-care settings, remote monitoring applications, and resource-limited healthcare facilities where centralized computing infrastructure or specialist expertise may be unavailable.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-01-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147342952","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A combined voting mechanism in KNN and random forest algorithms to enhance the diabetic retinopathy eye disease detection 一种结合KNN和随机森林算法的投票机制来增强糖尿病视网膜病变眼病的检测
Pub Date : 2026-01-22 DOI: 10.1007/s43674-025-00086-w
J. Vijaya, B. Sai Vikas, J. Jaya Surya, K. Nitheesh Kumar, B. Shriya

Diabetic retinopathy (DR) stands out as one of the most significant causes of treatable visual impairment and blindness worldwide. Hence, early detection coupled with timely intervention is crucial to prevent the disease from further progression. However, manually detecting DR through the use of retinal images is highly time-consuming, subjective, and often inaccessible in resource-limited settings. This research introduces a groundbreaking automated system for DR detection and severity classification. First, we collected the corresponding data and applied advanced preprocessing techniques such as resizing image, normalization, Gaussian blur, contrast limited adaptive histogram equalization (CLAHE), and image blending to improve model performance. Furthermore, we employed powerful deep learning (DL) architectures such as VGG, EfficientNet, DenseNet, ResNet50, and transformer models such as vision transformer (ViT), and swin transformer for feature extraction. The resulting features were then classified using robust machine learning algorithms, ensemble models, CNN models, and transformer-based models, including decision tree (DT), K-nearest neighbor (KNN), logistic regression (LR), support vector machine (SVM), random forest (RF), AdaBoost, and XGBoost, VGG, EfficientNet, DenseNet, ResNet50, vision transformer, swin transformer, and proposed a new hybrid technique that integrates KNN with random forest (KNN-RF). We tested the system with the appropriate key metrics: accuracy, precision, recall, and F1-score. Our findings show that the hybrid KNN-RF technique outperforms the others. Results point to promising possibilities for our approach in providing precise, scalable, and cost-effective diabetic retinopathy diagnoses in resource-scarce settings. This study emphasizes the importance of artificial intelligence in revolutionizing healthcare diagnostic processes and tackling essential global health issues.

糖尿病视网膜病变(DR)是世界范围内可治疗的视力障碍和失明的最重要原因之一。因此,早期发现和及时干预对于防止疾病进一步发展至关重要。然而,通过使用视网膜图像来手动检测DR是非常耗时、主观的,而且在资源有限的情况下往往无法实现。本研究介绍了一种突破性的DR检测和严重性分类自动化系统。首先,我们收集了相应的数据,并采用了调整图像大小、归一化、高斯模糊、对比度有限自适应直方图均衡化(CLAHE)和图像混合等先进的预处理技术来提高模型的性能。此外,我们采用了强大的深度学习(DL)架构,如VGG、EfficientNet、DenseNet、ResNet50,以及变压器模型,如vision transformer (ViT)和swin transformer进行特征提取。然后使用鲁棒机器学习算法、集成模型、CNN模型和基于变压器的模型,包括决策树(DT)、k近邻(KNN)、逻辑回归(LR)、支持向量机(SVM)、随机森林(RF)、AdaBoost、XGBoost、VGG、EfficientNet、DenseNet、ResNet50、视觉变压器、swin变压器,对得到的特征进行分类,并提出了一种将KNN与随机森林(KNN-RF)相结合的新混合技术。我们用适当的关键指标对系统进行了测试:准确性、精确度、召回率和f1分数。我们的研究结果表明,混合KNN-RF技术优于其他技术。结果表明,我们的方法有希望在资源稀缺的环境中提供精确、可扩展和具有成本效益的糖尿病视网膜病变诊断。这项研究强调了人工智能在革命性医疗诊断过程和解决基本全球健康问题中的重要性。
{"title":"A combined voting mechanism in KNN and random forest algorithms to enhance the diabetic retinopathy eye disease detection","authors":"J. Vijaya,&nbsp;B. Sai Vikas,&nbsp;J. Jaya Surya,&nbsp;K. Nitheesh Kumar,&nbsp;B. Shriya","doi":"10.1007/s43674-025-00086-w","DOIUrl":"10.1007/s43674-025-00086-w","url":null,"abstract":"<div><p>Diabetic retinopathy (DR) stands out as one of the most significant causes of treatable visual impairment and blindness worldwide. Hence, early detection coupled with timely intervention is crucial to prevent the disease from further progression. However, manually detecting DR through the use of retinal images is highly time-consuming, subjective, and often inaccessible in resource-limited settings. This research introduces a groundbreaking automated system for DR detection and severity classification. First, we collected the corresponding data and applied advanced preprocessing techniques such as resizing image, normalization, Gaussian blur, contrast limited adaptive histogram equalization (CLAHE), and image blending to improve model performance. Furthermore, we employed powerful deep learning (DL) architectures such as VGG, EfficientNet, DenseNet, ResNet50, and transformer models such as vision transformer (ViT), and swin transformer for feature extraction. The resulting features were then classified using robust machine learning algorithms, ensemble models, CNN models, and transformer-based models, including decision tree (DT), K-nearest neighbor (KNN), logistic regression (LR), support vector machine (SVM), random forest (RF), AdaBoost, and XGBoost, VGG, EfficientNet, DenseNet, ResNet50, vision transformer, swin transformer, and proposed a new hybrid technique that integrates KNN with random forest (KNN-RF). We tested the system with the appropriate key metrics: accuracy, precision, recall, and F1-score. Our findings show that the hybrid KNN-RF technique outperforms the others. Results point to promising possibilities for our approach in providing precise, scalable, and cost-effective diabetic retinopathy diagnoses in resource-scarce settings. This study emphasizes the importance of artificial intelligence in revolutionizing healthcare diagnostic processes and tackling essential global health issues.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"6 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2026-01-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146016142","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Construction of new transfer functions and their application in solving knapsack problems with discrete Kepler optimization algorithm 新的传递函数的构造及其在离散Kepler优化算法求解背包问题中的应用
Pub Date : 2025-11-15 DOI: 10.1007/s43674-025-00085-x
Yichao He, Guoxin Chen, Ju Chen, Manman Meng

Transfer function plays a crucial role in discretizing metaheuristic algorithms to solve combinatorial optimization problems. However, existing transfer functions not only have few classes, but their design methods also rely too much on the curve shape. Kepler optimization algorithm (KOA) is a novel metaheuristic algorithm that performs well in solving optimization problems on continuous domains, but cannot be directly applied to solve combinatorial optimization problems on discrete domains. In order to design more transfer functions and solve combinatorial optimization problems by KOA, this paper first proposes a practical method to construct transfer functions. From this, two new classes of transfer functions are given: A-shaped transfer functions and B-shaped transfer functions. Then, based on the transfer function, the first discrete Kepler optimization algorithm (DKOA) suitable for binary optimization problems is proposed. To verify the practicality of the new transfer functions and the efficiency of DKOA, DKOA is used to solve 0–1 knapsack problem and knapsack problem with a single continuous variable, respectively. Comparison with existing transfer functions and the state-of-the-art metaheuristic algorithms for solving these two problems shows that DKOA using A-shaped and B-shaped transfer functions is more competitive in terms of the ability to obtain optimal solutions, average performance and stability. This shows that the proposed new transfer functions are very practical, and the DKOA based on them is an effective metaheuristic algorithm for solving binary optimization problems.

传递函数在求解组合优化问题的离散化元启发式算法中起着至关重要的作用。然而,现有的传递函数不仅类少,而且其设计方法也过于依赖于曲线形状。开普勒优化算法(Kepler optimization algorithm, KOA)是一种新型的元启发式算法,它能很好地解决连续域上的优化问题,但不能直接应用于解决离散域上的组合优化问题。为了设计更多的传递函数,利用KOA求解组合优化问题,本文首先提出了一种实用的构造传递函数的方法。由此,给出了两类新的传递函数:a型传递函数和b型传递函数。然后,基于传递函数,提出了适用于二元优化问题的离散Kepler优化算法(DKOA)。为了验证新传递函数的实用性和DKOA的有效性,分别用DKOA求解0-1背包问题和单连续变量背包问题。与现有的传递函数和最先进的用于解决这两个问题的元启发式算法相比,使用a形和b形传递函数的DKOA在获得最优解的能力、平均性能和稳定性方面更具竞争力。这表明所提出的新传递函数是非常实用的,基于它们的DKOA是解决二元优化问题的一种有效的元启发式算法。
{"title":"Construction of new transfer functions and their application in solving knapsack problems with discrete Kepler optimization algorithm","authors":"Yichao He,&nbsp;Guoxin Chen,&nbsp;Ju Chen,&nbsp;Manman Meng","doi":"10.1007/s43674-025-00085-x","DOIUrl":"10.1007/s43674-025-00085-x","url":null,"abstract":"<div><p>Transfer function plays a crucial role in discretizing metaheuristic algorithms to solve combinatorial optimization problems. However, existing transfer functions not only have few classes, but their design methods also rely too much on the curve shape. Kepler optimization algorithm (KOA) is a novel metaheuristic algorithm that performs well in solving optimization problems on continuous domains, but cannot be directly applied to solve combinatorial optimization problems on discrete domains. In order to design more transfer functions and solve combinatorial optimization problems by KOA, this paper first proposes a practical method to construct transfer functions. From this, two new classes of transfer functions are given: A-shaped transfer functions and B-shaped transfer functions. Then, based on the transfer function, the first discrete Kepler optimization algorithm (DKOA) suitable for binary optimization problems is proposed. To verify the practicality of the new transfer functions and the efficiency of DKOA, DKOA is used to solve 0–1 knapsack problem and knapsack problem with a single continuous variable, respectively. Comparison with existing transfer functions and the state-of-the-art metaheuristic algorithms for solving these two problems shows that DKOA using A-shaped and B-shaped transfer functions is more competitive in terms of the ability to obtain optimal solutions, average performance and stability. This shows that the proposed new transfer functions are very practical, and the DKOA based on them is an effective metaheuristic algorithm for solving binary optimization problems.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"5 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145561074","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Forecasting China’s producer price index for production materials via Gaussian process regression within a Bayesian inference framework 基于贝叶斯推理框架的高斯过程回归预测中国生产资料生产者价格指数
Pub Date : 2025-11-06 DOI: 10.1007/s43674-025-00084-y
Bingzi Jin, Xiaojie Xu

Projecting China’s producer price index (PPI) for production materials yields early signals of inflationary pressures and cost dynamics influencing both national economic stability and international supply networks. Reliable PPI forecasts equip policymakers, market participants, and firms with the information needed to refine monetary policy, pricing decisions, and resource allocation. This study proposes an innovative forecasting architecture based on Gaussian process regression (GPR), whose hyperparameters are estimated via a Bayesian inference procedure, enabling the model to adapt in real time to latent market fluctuations and previously unobserved structural shifts. By integrating these evolving characteristics, our approach more accurately captures changes in China’s PPI trajectory. The empirical analysis relies on a monthly dataset spanning October 1996 to February 2025, covering multiple waves of regulatory reform, industrial evolution, and macroeconomic transformation. Validation is performed over an out-of-sample period from June 2019 through February 2025, producing a relative root mean square error of 0.1120%, a root mean square error of 0.1131, a mean absolute error of 0.0832, and a correlation coefficient of 0.99984. To the best of our knowledge, this represents the first application of a Bayesian-inference-parameterized GPR model to forecast China’s PPI for production materials. Beyond advancing the theoretical discourse on machine-learning-based price prediction, the methodology provides a flexible analytical framework applicable to analogous macroeconomic time-series forecasting challenges.

预测中国生产材料的生产者价格指数(PPI)可以提供影响国家经济稳定和国际供应网络的通胀压力和成本动态的早期信号。可靠的PPI预测为政策制定者、市场参与者和企业提供了完善货币政策、定价决策和资源配置所需的信息。本研究提出了一种基于高斯过程回归(GPR)的创新预测架构,其超参数通过贝叶斯推理过程估计,使模型能够实时适应潜在的市场波动和先前未观察到的结构变化。通过整合这些不断变化的特征,我们的方法更准确地捕捉到了中国PPI轨迹的变化。实证分析依赖于1996年10月至2025年2月的月度数据集,涵盖了监管改革、产业演进和宏观经济转型的多波浪潮。验证在2019年6月至2025年2月的样本外期间进行,产生的相对均方根误差为0.1120%,均方根误差为0.1131,平均绝对误差为0.0832,相关系数为0.99984。据我们所知,这是首次应用贝叶斯推理参数化探地雷达模型来预测中国生产材料的PPI。除了推进基于机器学习的价格预测的理论论述之外,该方法还提供了一个灵活的分析框架,适用于类似的宏观经济时间序列预测挑战。
{"title":"Forecasting China’s producer price index for production materials via Gaussian process regression within a Bayesian inference framework","authors":"Bingzi Jin,&nbsp;Xiaojie Xu","doi":"10.1007/s43674-025-00084-y","DOIUrl":"10.1007/s43674-025-00084-y","url":null,"abstract":"<div><p>Projecting China’s producer price index (PPI) for production materials yields early signals of inflationary pressures and cost dynamics influencing both national economic stability and international supply networks. Reliable PPI forecasts equip policymakers, market participants, and firms with the information needed to refine monetary policy, pricing decisions, and resource allocation. This study proposes an innovative forecasting architecture based on Gaussian process regression (GPR), whose hyperparameters are estimated via a Bayesian inference procedure, enabling the model to adapt in real time to latent market fluctuations and previously unobserved structural shifts. By integrating these evolving characteristics, our approach more accurately captures changes in China’s PPI trajectory. The empirical analysis relies on a monthly dataset spanning October 1996 to February 2025, covering multiple waves of regulatory reform, industrial evolution, and macroeconomic transformation. Validation is performed over an out-of-sample period from June 2019 through February 2025, producing a relative root mean square error of 0.1120%, a root mean square error of 0.1131, a mean absolute error of 0.0832, and a correlation coefficient of 0.99984. To the best of our knowledge, this represents the first application of a Bayesian-inference-parameterized GPR model to forecast China’s PPI for production materials. Beyond advancing the theoretical discourse on machine-learning-based price prediction, the methodology provides a flexible analytical framework applicable to analogous macroeconomic time-series forecasting challenges.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"5 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-11-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145456333","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Comparative performance analysis of a novel fusion-based algorithm for AGV navigation 一种基于融合的AGV导航新算法性能对比分析
Pub Date : 2025-10-29 DOI: 10.1007/s43674-025-00083-z
Ata Jahangir Moshayedi, Dangling Xu, Maryam Sharifdoust, Amir Sohail Khan, Zeashan Hameed Khan, Mehran Emadi Andani

Automated guided vehicles (AGVs) are intelligent robotic systems that play a crucial role in applications, such as transportation, food delivery, and medical emergencies. One of the primary challenges in AGV deployment is achieving precise navigation to ensure task reliability, safety, and efficient battery consumption along predetermined routes. Vision-based methods have gained significant attention for their high performance in robot navigation. However, selecting the most effective algorithm with minimal sensor use remains an active area of research. This study introduces a novel and efficient fusion-based navigation method, termed the Extended Fusion 1 Method (EFM1), which integrates data from camera and infrared (IR) sensors. The system leverages feature-based algorithms, such as SIFT, ORB, FAST, SURF, BRISK, and BRIEF, to improve path-tracking accuracy. The main objective of this fusion approach is to enhance navigational precision and identify the most suitable algorithm for robust AGV path-tracking. The EFM1 method is simulated and validated using the CoppeliaSim (V-REP) simulator, incorporating the real-world dimensions of the previously developed AGV model, Hongma, via Python API. The simulation evaluates six feature-based algorithms across five distinct path types: circular, elliptical, spiral, figure-eight, and custom path. Performance is assessed in terms of maximum achievable speed, minimal path-tracking error, body orientation accuracy, and simulation time. Statistical analysis, including inferential techniques and post hoc tests, is used to interpret the results. The experimental findings demonstrate that the proposed EFM1 algorithm outperforms traditional vision-only approaches in effectively tracking all five path types, confirming its potential for reliable and efficient AGV navigation. The proposed EFM1 algorithm integrates vision and IR sensors, enhancing AGV navigation accuracy by up to 84% while using minimal sensors. It outperforms previous methods by delivering up to 22.2% faster simulation times, significantly reduced error rates (for example, ORB error decreased by 93%), and increased speed across five test paths. The comparison between investigated methods shows that FAST excels on dynamic paths with notable speed improvements, while SURF performs better on complex trajectories as confirmed by statistical analysis. Although EFM1 improves most metrics, body orientation changes increased, indicating a trade-off between agility and movement stability.

自动导引车(agv)是智能机器人系统,在运输、食品配送和医疗紧急情况等应用中发挥着至关重要的作用。AGV部署的主要挑战之一是实现精确导航,以确保任务的可靠性、安全性和沿预定路线的高效电池消耗。基于视觉的机器人导航方法以其优异的性能得到了广泛的关注。然而,如何在最小的传感器使用量下选择最有效的算法仍然是一个活跃的研究领域。本研究介绍了一种新颖高效的基于融合的导航方法,称为扩展融合1方法(EFM1),该方法集成了来自相机和红外(IR)传感器的数据。该系统利用SIFT、ORB、FAST、SURF、BRISK和BRIEF等基于特征的算法来提高路径跟踪的准确性。该融合方法的主要目的是提高导航精度,识别出最适合AGV鲁棒路径跟踪的算法。EFM1方法使用CoppeliaSim (V-REP)模拟器进行模拟和验证,通过Python API结合先前开发的AGV模型Hongma的实际尺寸。仿真评估了五种不同路径类型的六种基于特征的算法:圆形、椭圆、螺旋、数字8和自定义路径。性能是根据最大可达到的速度、最小的路径跟踪误差、身体方向精度和模拟时间来评估的。统计分析,包括推论技术和事后检验,被用来解释结果。实验结果表明,所提出的EFM1算法在有效跟踪所有五种路径类型方面优于传统的纯视觉方法,证实了其可靠高效的AGV导航潜力。提出的EFM1算法集成了视觉和红外传感器,在使用最小传感器的情况下,将AGV导航精度提高了84%。它比以前的方法快了22.2%的模拟时间,显著降低了错误率(例如,ORB错误减少了93%),并提高了五个测试路径的速度。两种方法的对比表明,FAST在动态路径上表现优异,速度显著提高,而SURF在复杂路径上表现更好,统计分析证实了这一点。虽然EFM1改善了大多数指标,但身体方向的变化增加了,这表明了敏捷性和运动稳定性之间的权衡。
{"title":"Comparative performance analysis of a novel fusion-based algorithm for AGV navigation","authors":"Ata Jahangir Moshayedi,&nbsp;Dangling Xu,&nbsp;Maryam Sharifdoust,&nbsp;Amir Sohail Khan,&nbsp;Zeashan Hameed Khan,&nbsp;Mehran Emadi Andani","doi":"10.1007/s43674-025-00083-z","DOIUrl":"10.1007/s43674-025-00083-z","url":null,"abstract":"<div><p>Automated guided vehicles (AGVs) are intelligent robotic systems that play a crucial role in applications, such as transportation, food delivery, and medical emergencies. One of the primary challenges in AGV deployment is achieving precise navigation to ensure task reliability, safety, and efficient battery consumption along predetermined routes. Vision-based methods have gained significant attention for their high performance in robot navigation. However, selecting the most effective algorithm with minimal sensor use remains an active area of research. This study introduces a novel and efficient fusion-based navigation method, termed the Extended Fusion 1 Method (EFM1), which integrates data from camera and infrared (IR) sensors. The system leverages feature-based algorithms, such as SIFT, ORB, FAST, SURF, BRISK, and BRIEF, to improve path-tracking accuracy. The main objective of this fusion approach is to enhance navigational precision and identify the most suitable algorithm for robust AGV path-tracking. The EFM1 method is simulated and validated using the CoppeliaSim (V-REP) simulator, incorporating the real-world dimensions of the previously developed AGV model, Hongma, via Python API. The simulation evaluates six feature-based algorithms across five distinct path types: circular, elliptical, spiral, figure-eight, and custom path. Performance is assessed in terms of maximum achievable speed, minimal path-tracking error, body orientation accuracy, and simulation time. Statistical analysis, including inferential techniques and post hoc tests, is used to interpret the results. The experimental findings demonstrate that the proposed EFM1 algorithm outperforms traditional vision-only approaches in effectively tracking all five path types, confirming its potential for reliable and efficient AGV navigation. The proposed EFM1 algorithm integrates vision and IR sensors, enhancing AGV navigation accuracy by up to 84% while using minimal sensors. It outperforms previous methods by delivering up to 22.2% faster simulation times, significantly reduced error rates (for example, ORB error decreased by 93%), and increased speed across five test paths. The comparison between investigated methods shows that FAST excels on dynamic paths with notable speed improvements, while SURF performs better on complex trajectories as confirmed by statistical analysis. Although EFM1 improves most metrics, body orientation changes increased, indicating a trade-off between agility and movement stability.</p></div>","PeriodicalId":72089,"journal":{"name":"Advances in computational intelligence","volume":"5 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2025-10-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145384942","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Advances in computational intelligence
全部 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.
﹀
mjeditor
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1