首页 > 最新文献

Neural Computing and Applications最新文献

英文 中文
Attention-optimized vision-enhanced prompt learning for few-shot multi-modal sentiment analysis 针对少镜头多模态情感分析的注意力优化视觉增强提示学习
Pub Date : 2024-08-22 DOI: 10.1007/s00521-024-10297-w
Zikai Zhou, Baiyou Qiao, Haisong Feng, Donghong Han, Gang Wu

To fulfill the explosion of multi-modal data, multi-modal sentiment analysis (MSA) emerged and attracted widespread attention. Unfortunately, conventional multi-modal research relies on large-scale datasets. On the one hand, collecting and annotating large-scale datasets is challenging and resource-intensive. On the other hand, the training on large-scale datasets also increases the research cost. However, the few-shot MSA (FMSA), which is proposed recently, requires only few samples for training. Therefore, in comparison, it is more practical and realistic. There have been approaches to investigating the prompt-based method in the field of FMSA, but they have not sufficiently considered or leveraged the information specificity of visual modality. Thus, we propose a vision-enhanced prompt-based model based on graph structure to better utilize vision information for fusion and collaboration in encoding and optimizing prompt representations. Specifically, we first design an aggregation-based multi-modal attention module. Then, based on this module and the biaffine attention, we construct a syntax–semantic dual-channel graph convolutional network to optimize the encoding of learnable prompts by understanding the vision-enhanced information in semantic and syntactic knowledge. Finally, we propose a collaboration-based optimization module based on the collaborative attention mechanism, which employs visual information to collaboratively optimize prompt representations. Extensive experiments conducted on both coarse-grained and fine-grained MSA datasets have demonstrated that our model significantly outperforms the baseline models.

为了应对多模态数据的爆炸式增长,多模态情感分析(MSA)应运而生,并引起了广泛关注。遗憾的是,传统的多模态研究依赖于大规模数据集。一方面,收集和注释大规模数据集是一项具有挑战性的资源密集型工作。另一方面,在大规模数据集上进行训练也增加了研究成本。然而,最近提出的少量样本 MSA(FMSA)只需要少量样本进行训练。因此,相比之下,它更实用、更现实。在 FMSA 领域,已经有研究基于提示的方法的方法,但这些方法没有充分考虑或利用视觉模式的信息特异性。因此,我们提出了一种基于图结构的视觉增强型提示模型,以便在编码和优化提示表征时更好地利用视觉信息进行融合与协作。具体来说,我们首先设计了一个基于聚合的多模态注意力模块。然后,基于该模块和双模注意力,我们构建了一个语法-语义双通道图卷积网络,通过理解视觉增强的语义和句法知识信息来优化可学习提示的编码。最后,我们提出了基于协作注意机制的协作优化模块,该模块利用视觉信息协作优化提示表征。在粗粒度和细粒度 MSA 数据集上进行的大量实验表明,我们的模型明显优于基线模型。
{"title":"Attention-optimized vision-enhanced prompt learning for few-shot multi-modal sentiment analysis","authors":"Zikai Zhou, Baiyou Qiao, Haisong Feng, Donghong Han, Gang Wu","doi":"10.1007/s00521-024-10297-w","DOIUrl":"https://doi.org/10.1007/s00521-024-10297-w","url":null,"abstract":"<p>To fulfill the explosion of multi-modal data, multi-modal sentiment analysis (MSA) emerged and attracted widespread attention. Unfortunately, conventional multi-modal research relies on large-scale datasets. On the one hand, collecting and annotating large-scale datasets is challenging and resource-intensive. On the other hand, the training on large-scale datasets also increases the research cost. However, the few-shot MSA (FMSA), which is proposed recently, requires only few samples for training. Therefore, in comparison, it is more practical and realistic. There have been approaches to investigating the prompt-based method in the field of FMSA, but they have not sufficiently considered or leveraged the information specificity of visual modality. Thus, we propose a vision-enhanced prompt-based model based on graph structure to better utilize vision information for fusion and collaboration in encoding and optimizing prompt representations. Specifically, we first design an aggregation-based multi-modal attention module. Then, based on this module and the biaffine attention, we construct a syntax–semantic dual-channel graph convolutional network to optimize the encoding of learnable prompts by understanding the vision-enhanced information in semantic and syntactic knowledge. Finally, we propose a collaboration-based optimization module based on the collaborative attention mechanism, which employs visual information to collaboratively optimize prompt representations. Extensive experiments conducted on both coarse-grained and fine-grained MSA datasets have demonstrated that our model significantly outperforms the baseline models.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188291","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
Polar fox optimization algorithm: a novel meta-heuristic algorithm 极狐优化算法:一种新型元启发式算法
Pub Date : 2024-08-21 DOI: 10.1007/s00521-024-10346-4
Ahmad Ghiaskar, Amir Amiri, Seyedali Mirjalili

The proposed paper introduces a new optimization algorithm inspired by nature called the polar fox optimization algorithm (PFA). This algorithm addresses the herd life of polar foxes and especially their hunting method. The polar fox jumping strategy for hunting, which is performed through high hearing power, is mathematically formulated and implemented to perform optimization processes in a wide range of search spaces. The performance of the polar fox algorithm is tested with 14 classic benchmark functions. To provide a comprehensive comparison, all 14 test functions are expanded, shifted, rotated and combined for this test. For further testing, the recent CEC 2021 test’s complex functions are studied in the unimodal, basic, hybrid and composition modes. Finally, the rate of convergence and computational time of PFA are also evaluated by several changes with other algorithms. Comparisons show that PFA has numerous benefits over other well-known meta-heuristic algorithms and determines the solutions with fewer control parameters. So it offers competitive and promising results. In addition, this research tests PFA performance with 6 different challenging engineering problems. Compared to the well-known meta-artist methods, the superiority of the PFA is observed from the experimental results of the proposed algorithm in real-world problem-solving. The source codes of the PFA are publicly available at https://github.com/ATR616/PFA.

本文介绍了一种受大自然启发的新优化算法,称为 "北极狐优化算法"(PFA)。该算法针对北极狐的群居生活,特别是其狩猎方法。通过高听力执行的北极狐跳跃狩猎策略被数学化,并在广泛的搜索空间中执行优化过程。极狐算法的性能通过 14 个经典基准函数进行了测试。为了提供全面的比较,所有 14 个测试函数都在本次测试中进行了扩展、移动、旋转和组合。为了进一步测试,最近的 CEC 2021 测试在单模态、基本模态、混合模态和组合模态下对复杂函数进行了研究。最后,通过与其他算法的比较,对 PFA 的收敛速度和计算时间进行了评估。比较结果表明,与其他著名的元启发式算法相比,PFA 有很多优点,而且只需较少的控制参数就能确定解。因此,它能提供有竞争力和有前景的结果。此外,本研究还用 6 个不同的挑战性工程问题测试了 PFA 的性能。与知名的元算法相比,PFA 在实际问题求解中的实验结果显示了其优越性。PFA 的源代码可在 https://github.com/ATR616/PFA 公开获取。
{"title":"Polar fox optimization algorithm: a novel meta-heuristic algorithm","authors":"Ahmad Ghiaskar, Amir Amiri, Seyedali Mirjalili","doi":"10.1007/s00521-024-10346-4","DOIUrl":"https://doi.org/10.1007/s00521-024-10346-4","url":null,"abstract":"<p>The proposed paper introduces a new optimization algorithm inspired by nature called the polar fox optimization algorithm (PFA). This algorithm addresses the herd life of polar foxes and especially their hunting method. The polar fox jumping strategy for hunting, which is performed through high hearing power, is mathematically formulated and implemented to perform optimization processes in a wide range of search spaces. The performance of the polar fox algorithm is tested with 14 classic benchmark functions. To provide a comprehensive comparison, all 14 test functions are expanded, shifted, rotated and combined for this test. For further testing, the recent CEC 2021 test’s complex functions are studied in the unimodal, basic, hybrid and composition modes. Finally, the rate of convergence and computational time of PFA are also evaluated by several changes with other algorithms. Comparisons show that PFA has numerous benefits over other well-known meta-heuristic algorithms and determines the solutions with fewer control parameters. So it offers competitive and promising results. In addition, this research tests PFA performance with 6 different challenging engineering problems. Compared to the well-known meta-artist methods, the superiority of the PFA is observed from the experimental results of the proposed algorithm in real-world problem-solving. The source codes of the PFA are publicly available at https://github.com/ATR616/PFA.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188296","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
Sampled-data synchronization for heterogeneous delays inertial neural networks with generally uncertain semi-Markovian jumping and its application 具有一般不确定半马尔可夫跳跃的异质延迟惯性神经网络的采样数据同步及其应用
Pub Date : 2024-08-21 DOI: 10.1007/s00521-024-10192-4
Junyi Wang, Wenyuan He, Hongli Xu, Haibin Cai, Xiangyong Chen

This article is concerned with sampled-data synchronization problem of heterogeneous delays inertial neural networks (INNs) with generally uncertain semi-Markovian (GUSM) jumping. Different from traditional Markovian inertial neural networks (MINNs), the INNs with GUSM are investigated in this paper by fully considering the sojourn time and the lacking transition rates, which is more general and applicable for practical system. The new extended two-sided looped-functional (ETSLF) approach is adopted in this paper, and some improved less conservative criteria are derived to achieve the synchronization of the drive and response INNs. The controller gain matrices are acquired based on synchronization criteria. Finally, the viability of the method is presented through three examples.

本文关注具有一般不确定半马尔可夫跳跃(GUSM)的异质延迟惯性神经网络(INNs)的采样数据同步问题。与传统的马尔可夫惯性神经网络(MINNs)不同,本文对具有 GUSM 的 INNs 进行了研究,充分考虑了滞留时间和缺失转换率,更具通用性,更适用于实际系统。本文采用了新的扩展双面循环函数(ETSLF)方法,并得出了一些改进的不太保守的准则,以实现驱动和响应 INN 的同步。控制器增益矩阵是根据同步标准获得的。最后,通过三个实例介绍了该方法的可行性。
{"title":"Sampled-data synchronization for heterogeneous delays inertial neural networks with generally uncertain semi-Markovian jumping and its application","authors":"Junyi Wang, Wenyuan He, Hongli Xu, Haibin Cai, Xiangyong Chen","doi":"10.1007/s00521-024-10192-4","DOIUrl":"https://doi.org/10.1007/s00521-024-10192-4","url":null,"abstract":"<p>This article is concerned with sampled-data synchronization problem of heterogeneous delays inertial neural networks (INNs) with generally uncertain semi-Markovian (GUSM) jumping. Different from traditional Markovian inertial neural networks (MINNs), the INNs with GUSM are investigated in this paper by fully considering the sojourn time and the lacking transition rates, which is more general and applicable for practical system. The new extended two-sided looped-functional (ETSLF) approach is adopted in this paper, and some improved less conservative criteria are derived to achieve the synchronization of the drive and response INNs. The controller gain matrices are acquired based on synchronization criteria. Finally, the viability of the method is presented through three examples.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188358","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
Evolutionary variational inference for Bayesian generalized nonlinear models 贝叶斯广义非线性模型的进化变异推理
Pub Date : 2024-08-21 DOI: 10.1007/s00521-024-10349-1
Philip Sebastian Hauglie Sommerfelt, Aliaksandr Hubin

In the exploration of recently developed Bayesian Generalized Nonlinear Models (BGNLM), this paper proposes a pragmatic scalable approximation for computing posterior distributions. Traditional Markov chain Monte Carlo within the populations of the Genetically Modified Mode Jumping Markov Chain Monte Carlo (GMJMCMC) algorithm is an NP-hard search problem. To linearize them, we suggest using instead variational Bayes, employing either mean-field approximation or normalizing flows for simplicity and scalability. This results in an evolutionary variational Bayes algorithm as a more scalable alternative to GMJMCMC. Through practical applications including inference on Bayesian linear models, Bayesian fractional polynomials, and full BGNLM, we demonstrate the effectiveness of our method, delivering accurate predictions, transparency and interpretations, and accessible measures of uncertainty, while improving the scalability of BGNLM inference through on the one hand using a novel variational Bayes method, but, on the other hand, enabling the use of GPUs for computations.

在探索最新开发的贝叶斯广义非线性模型(BGNLM)时,本文提出了一种计算后验分布的实用可扩展近似方法。遗传修正模式跳跃马尔可夫链蒙特卡洛(GMJMCMC)算法种群内的传统马尔可夫链蒙特卡洛是一个 NP-困难搜索问题。为了使其线性化,我们建议使用变异贝叶斯,采用均值场近似或归一化流量,以简化算法并提高可扩展性。这就产生了一种进化变异贝叶斯算法,作为 GMJMCMC 更具可扩展性的替代方案。通过对贝叶斯线性模型、贝叶斯分数多项式和完整 BGNLM 的推理等实际应用,我们证明了我们的方法的有效性,它提供了准确的预测、透明度和解释,以及可获得的不确定性度量,同时一方面通过使用新颖的变分贝叶斯方法,另一方面通过使用 GPU 进行计算,提高了 BGNLM 推理的可扩展性。
{"title":"Evolutionary variational inference for Bayesian generalized nonlinear models","authors":"Philip Sebastian Hauglie Sommerfelt, Aliaksandr Hubin","doi":"10.1007/s00521-024-10349-1","DOIUrl":"https://doi.org/10.1007/s00521-024-10349-1","url":null,"abstract":"<p>In the exploration of recently developed Bayesian Generalized Nonlinear Models (BGNLM), this paper proposes a pragmatic scalable approximation for computing posterior distributions. Traditional Markov chain Monte Carlo within the populations of the Genetically Modified Mode Jumping Markov Chain Monte Carlo (GMJMCMC) algorithm is an NP-hard search problem. To linearize them, we suggest using instead variational Bayes, employing either mean-field approximation or normalizing flows for simplicity and scalability. This results in an evolutionary variational Bayes algorithm as a more scalable alternative to GMJMCMC. Through practical applications including inference on Bayesian linear models, Bayesian fractional polynomials, and full BGNLM, we demonstrate the effectiveness of our method, delivering accurate predictions, transparency and interpretations, and accessible measures of uncertainty, while improving the scalability of BGNLM inference through on the one hand using a novel variational Bayes method, but, on the other hand, enabling the use of GPUs for computations.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188294","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
Multimodal fusion: advancing medical visual question-answering 多模态融合:推进医学视觉问题解答
Pub Date : 2024-08-20 DOI: 10.1007/s00521-024-10318-8
Anjali Mudgal, Udbhav Kush, Aditya Kumar, Amir Jafari

This paper explores the application of Visual Question-Answering (VQA) technology, which combines computer vision and natural language processing (NLP), in the medical domain, specifically for analyzing radiology scans. VQA can facilitate medical decision-making and improve patient outcomes by accurately interpreting medical imaging, which requires specialized expertise and time. The paper proposes developing an advanced VQA system for medical datasets using the Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generation (BLIP) architecture from Salesforce, leveraging deep learning and transfer learning techniques to handle the unique challenges of medical/radiology images. The paper discusses the underlying concepts, methodologies, and results of applying the BLIP architecture and fine-tuning approaches for VQA in the medical domain, highlighting their effectiveness in addressing the complexities of VQA tasks for radiology scans. Inspired by the BLIP architecture from Salesforce, we propose a novel multi-modal fusion approach for medical VQA and evaluating its promising potential.

本文探讨了可视化问题解答(VQA)技术在医疗领域的应用,该技术结合了计算机视觉和自然语言处理(NLP),特别适用于分析放射扫描。VQA 可以准确解释医学影像,从而促进医疗决策并改善患者的治疗效果,而这需要专业知识和时间。本文建议使用 Salesforce 的 Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generation (BLIP) 架构,利用深度学习和迁移学习技术为医疗数据集开发先进的 VQA 系统,以应对医疗/放射学图像的独特挑战。本文讨论了将 BLIP 架构和微调方法应用于医疗领域 VQA 的基本概念、方法和结果,强调了它们在解决放射学扫描 VQA 任务复杂性方面的有效性。在 Salesforce BLIP 架构的启发下,我们提出了一种用于医疗 VQA 的新型多模态融合方法,并对其潜力进行了评估。
{"title":"Multimodal fusion: advancing medical visual question-answering","authors":"Anjali Mudgal, Udbhav Kush, Aditya Kumar, Amir Jafari","doi":"10.1007/s00521-024-10318-8","DOIUrl":"https://doi.org/10.1007/s00521-024-10318-8","url":null,"abstract":"<p>This paper explores the application of Visual Question-Answering (VQA) technology, which combines computer vision and natural language processing (NLP), in the medical domain, specifically for analyzing radiology scans. VQA can facilitate medical decision-making and improve patient outcomes by accurately interpreting medical imaging, which requires specialized expertise and time. The paper proposes developing an advanced VQA system for medical datasets using the Bootstrapping Language-Image Pre-training for Unified Vision-Language Understanding and Generation (BLIP) architecture from Salesforce, leveraging deep learning and transfer learning techniques to handle the unique challenges of medical/radiology images. The paper discusses the underlying concepts, methodologies, and results of applying the BLIP architecture and fine-tuning approaches for VQA in the medical domain, highlighting their effectiveness in addressing the complexities of VQA tasks for radiology scans. Inspired by the BLIP architecture from Salesforce, we propose a novel multi-modal fusion approach for medical VQA and evaluating its promising potential.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188351","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
The innovation dynamic mechanism of platform enterprise business model based on deep learning 基于深度学习的平台型企业商业模式创新动力机制
Pub Date : 2024-08-20 DOI: 10.1007/s00521-024-10242-x
Yanjun Kang, Guoquan Liu

With the continuous emergence and rapid development of high and new technologies such as big data, cloud computing, artificial intelligence, mobile Internet, and the Internet of Things, the platform economy has developed rapidly and has become the current mainstream business model. This paper first analyzes the external driving factors that promote the rapid development of platform-based business models, then combines the existing research results of scholars to analyze the components of platform-based business models and uses deep learning methods. The research carried out model construction, drew causal relationship diagrams and flow diagrams, selected typical and representative platform-based enterprises for research, collected relevant data, and verified that the model's effectiveness reached 98%. On this basis, the model was compounded. Simulation and sensitivity analysis explores the critical factor driving platform-type enterprises to carry out business model innovation: the service quality coefficient of platform-type enterprises.

随着大数据、云计算、人工智能、移动互联网、物联网等高新技术的不断涌现和快速发展,平台经济发展迅速,已成为当前的主流商业模式。本文首先分析了促进平台型商业模式快速发展的外部驱动因素,然后结合学者们已有的研究成果,运用深度学习方法分析了平台型商业模式的构成要素。研究进行了模型构建,绘制了因果关系图和流程图,选取了具有典型性和代表性的平台型企业进行研究,收集了相关数据,验证了模型的有效性达到 98%。在此基础上,对模型进行了复合。通过仿真和敏感性分析,探讨了驱动平台型企业进行商业模式创新的关键因素:平台型企业的服务质量系数。
{"title":"The innovation dynamic mechanism of platform enterprise business model based on deep learning","authors":"Yanjun Kang, Guoquan Liu","doi":"10.1007/s00521-024-10242-x","DOIUrl":"https://doi.org/10.1007/s00521-024-10242-x","url":null,"abstract":"<p>With the continuous emergence and rapid development of high and new technologies such as big data, cloud computing, artificial intelligence, mobile Internet, and the Internet of Things, the platform economy has developed rapidly and has become the current mainstream business model. This paper first analyzes the external driving factors that promote the rapid development of platform-based business models, then combines the existing research results of scholars to analyze the components of platform-based business models and uses deep learning methods. The research carried out model construction, drew causal relationship diagrams and flow diagrams, selected typical and representative platform-based enterprises for research, collected relevant data, and verified that the model's effectiveness reached 98%. On this basis, the model was compounded. Simulation and sensitivity analysis explores the critical factor driving platform-type enterprises to carry out business model innovation: the service quality coefficient of platform-type enterprises.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188353","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
SEAformer: frequency domain decomposition transformer with signal enhanced for long-term wind power forecasting SEAformer:用于长期风电预测的信号增强型频域分解变压器
Pub Date : 2024-08-19 DOI: 10.1007/s00521-024-10295-y
Leiming Yan, Siqi Wu, Shaopeng Li, Xianyi Chen

Accurate and reliable wind power forecasting is of great importance for stable grid operation and advanced dispatch planning. Due to the complex, non-stationary, and highly volatile nature of wind power data, Transformer-based methods find it difficult to capture long-term trend features and incur high computational costs. To address these challenging problems, we propose a frequency domain decomposition Transformer architecture with signal enhanced attention mechanism (SEAformer). Firstly, we devise a frequency domain-based trend decomposition structure that enables the Transformer to extract more effective long-term trend features, thereby further improving the long-term prediction accuracy of the model. Secondly, in response to the large fluctuations and instability of wind power data, we design an internal signal enhanced substructure combined with an attention mechanism in the Transformer, which filters out high-frequency noise signals and reduces the computational cost of the Transformer. We conduct extensive experiments on the benchmark dataset, the experimental analysis demonstrates that SEAformer outperforms the baseline methods (Transformer-based, MLP-based, and Traditional methods) in both multivariate and univariate prediction tasks, exhibiting the best prediction performance.

准确可靠的风力发电预测对电网稳定运行和先进的调度规划至关重要。由于风电数据的复杂性、非稳态性和高波动性,基于变压器的方法难以捕捉长期趋势特征,而且计算成本高昂。为了解决这些具有挑战性的问题,我们提出了一种具有信号增强关注机制(SEAformer)的频域分解 Transformer 架构。首先,我们设计了一种基于频域的趋势分解结构,使变换器能够提取更有效的长期趋势特征,从而进一步提高模型的长期预测精度。其次,针对风电数据波动大、不稳定的特点,我们设计了一种内部信号增强子结构,结合 Transformer 中的注意机制,过滤掉高频噪声信号,降低 Transformer 的计算成本。我们在基准数据集上进行了大量实验,实验分析表明 SEAformer 在多变量和单变量预测任务中均优于基线方法(基于变换器、基于 MLP 和传统方法),表现出最佳的预测性能。
{"title":"SEAformer: frequency domain decomposition transformer with signal enhanced for long-term wind power forecasting","authors":"Leiming Yan, Siqi Wu, Shaopeng Li, Xianyi Chen","doi":"10.1007/s00521-024-10295-y","DOIUrl":"https://doi.org/10.1007/s00521-024-10295-y","url":null,"abstract":"<p>Accurate and reliable wind power forecasting is of great importance for stable grid operation and advanced dispatch planning. Due to the complex, non-stationary, and highly volatile nature of wind power data, Transformer-based methods find it difficult to capture long-term trend features and incur high computational costs. To address these challenging problems, we propose a frequency domain decomposition Transformer architecture with signal enhanced attention mechanism (SEAformer). Firstly, we devise a frequency domain-based trend decomposition structure that enables the Transformer to extract more effective long-term trend features, thereby further improving the long-term prediction accuracy of the model. Secondly, in response to the large fluctuations and instability of wind power data, we design an internal signal enhanced substructure combined with an attention mechanism in the Transformer, which filters out high-frequency noise signals and reduces the computational cost of the Transformer. We conduct extensive experiments on the benchmark dataset, the experimental analysis demonstrates that SEAformer outperforms the baseline methods (Transformer-based, MLP-based, and Traditional methods) in both multivariate and univariate prediction tasks, exhibiting the best prediction performance.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188354","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
Predictions of steel price indices through machine learning for the regional northeast Chinese market 通过机器学习预测中国东北地区市场的钢材价格指数
Pub Date : 2024-08-19 DOI: 10.1007/s00521-024-10270-7
Bingzi Jin, Xiaojie Xu

Projections of commodity prices have long been a significant source of dependence for investors and the government. This study investigates the challenging topic of forecasting the daily regional steel price index in the northeast Chinese market from January 1, 2010, to April 15, 2021. The projection of this significant commodity price indication has not received enough attention in the literature. The forecasting model that is used is Gaussian process regressions, which are trained using a mix of cross-validation and Bayesian optimizations. The models that were built precisely predicted the price indices between January 8, 2019, and April 15, 2021, with an out-of-sample relative root mean square error of 0.5432%. Investors and government officials can use the established models to study pricing and make judgments. Forecasting results can help create comparable commodity price indices when reference data on the price trends suggested by these models are used.

长期以来,商品价格预测一直是投资者和政府的重要依赖。本研究探讨了预测 2010 年 1 月 1 日至 2021 年 4 月 15 日中国东北市场每日区域钢材价格指数这一具有挑战性的课题。对这一重要商品价格指标的预测在文献中尚未得到足够重视。所使用的预测模型是高斯过程回归,该模型是通过交叉验证和贝叶斯优化的混合方法进行训练的。建立的模型精确预测了 2019 年 1 月 8 日至 2021 年 4 月 15 日期间的价格指数,样本外相对均方根误差为 0.5432%。投资者和政府官员可以利用已建立的模型来研究定价和做出判断。在使用这些模型所建议的价格趋势参考数据时,预测结果有助于创建可比较的商品价格指数。
{"title":"Predictions of steel price indices through machine learning for the regional northeast Chinese market","authors":"Bingzi Jin, Xiaojie Xu","doi":"10.1007/s00521-024-10270-7","DOIUrl":"https://doi.org/10.1007/s00521-024-10270-7","url":null,"abstract":"<p>Projections of commodity prices have long been a significant source of dependence for investors and the government. This study investigates the challenging topic of forecasting the daily regional steel price index in the northeast Chinese market from January 1, 2010, to April 15, 2021. The projection of this significant commodity price indication has not received enough attention in the literature. The forecasting model that is used is Gaussian process regressions, which are trained using a mix of cross-validation and Bayesian optimizations. The models that were built precisely predicted the price indices between January 8, 2019, and April 15, 2021, with an out-of-sample relative root mean square error of 0.5432%. Investors and government officials can use the established models to study pricing and make judgments. Forecasting results can help create comparable commodity price indices when reference data on the price trends suggested by these models are used.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188352","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
Computational and artificial neural network study on ternary nanofluid flow with heat and mass transfer with magnetohydrodynamics and mass transpiration 三元纳米流体流动的计算与人工神经网络研究--磁流体力学与质量蒸腾的传热传质关系
Pub Date : 2024-08-19 DOI: 10.1007/s00521-024-10325-9
U. S. Mahabaleshwar, K. M. Nihaal, Dia Zeidan, T. Dbouk, D. Laroze

Ternary nanofluids have been an interesting field for academics and researchers in the modern technological era because of their advanced thermophysical properties and the desire to increase heat transfer rates. Furthermore, the innovative, sophisticated artificial neural network strategy with the Levenberg–Marquardt backpropagation technique (LMBPT) is proposed for research on heat and mass transport over non-Newtonian ternary Casson fluid on a radially extending surface with magnetic field and convective boundary conditions. The main objective of the current research is to conduct a comparative study of numerical solutions of the ternary nanofluid model of heat/mass transport utilizing the artificial neural network (ANN) together with the (LMBPT). To accurately represent complex patterns, neural networks modify their parameters flexibly, resulting in more accurate predictions and greater generalization with numerical outcomes. The model equations were reduced from partial to ODEs through applying appropriate similarity variables. The shooting technique and the byp-4c algorithm were then used to analyze the numerical data. The current study reveals that a rise in the Casson parameter diminishes the fluid velocity but an opposite nature is seen in thermal distribution for rising behavior of heat source/sink and Biot number, and the concentration profile tends to deteriorate when the mass transfer is elevated. Furthermore, the resulting values of the significant engineering coefficients are numerically analyzed and tabulated.

在现代科技时代,三元纳米流体因其先进的热物理性质和提高传热速率的愿望,一直是学术界和研究人员感兴趣的领域。此外,本研究还提出了一种创新、复杂的人工神经网络策略--Levenberg-Marquardt 反向传播技术(LMBPT),用于研究非牛顿三元卡松流体在具有磁场和对流边界条件的径向延伸表面上的热量和质量传输。当前研究的主要目的是利用人工神经网络(ANN)和(LMBPT)对三元纳米流体热量/质量传输模型的数值解法进行比较研究。为了准确地表示复杂的模式,神经网络可以灵活地修改参数,从而使预测更准确,数值结果的概括性更强。通过应用适当的相似变量,将模型方程从偏微分方程简化为 ODE。然后使用射击技术和 byp-4c 算法分析数值数据。目前的研究表明,卡森参数的上升会降低流体速度,但热源/散热器和比奥特数的上升行为在热分布中却表现出相反的性质,而且当传质升高时,浓度曲线趋于恶化。此外,还对得出的重要工程系数值进行了数值分析并制成表格。
{"title":"Computational and artificial neural network study on ternary nanofluid flow with heat and mass transfer with magnetohydrodynamics and mass transpiration","authors":"U. S. Mahabaleshwar, K. M. Nihaal, Dia Zeidan, T. Dbouk, D. Laroze","doi":"10.1007/s00521-024-10325-9","DOIUrl":"https://doi.org/10.1007/s00521-024-10325-9","url":null,"abstract":"<p>Ternary nanofluids have been an interesting field for academics and researchers in the modern technological era because of their advanced thermophysical properties and the desire to increase heat transfer rates. Furthermore, the innovative, sophisticated artificial neural network strategy with the Levenberg–Marquardt backpropagation technique (LMBPT) is proposed for research on heat and mass transport over non-Newtonian ternary Casson fluid on a radially extending surface with magnetic field and convective boundary conditions. The main objective of the current research is to conduct a comparative study of numerical solutions of the ternary nanofluid model of heat/mass transport utilizing the artificial neural network (ANN) together with the (LMBPT). To accurately represent complex patterns, neural networks modify their parameters flexibly, resulting in more accurate predictions and greater generalization with numerical outcomes. The model equations were reduced from partial to ODEs through applying appropriate similarity variables. The shooting technique and the byp-4c algorithm were then used to analyze the numerical data. The current study reveals that a rise in the Casson parameter diminishes the fluid velocity but an opposite nature is seen in thermal distribution for rising behavior of heat source/sink and Biot number, and the concentration profile tends to deteriorate when the mass transfer is elevated. Furthermore, the resulting values of the significant engineering coefficients are numerically analyzed and tabulated.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188350","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 reduced-form multigrid approach for ANN equivalent to classic multigrid expansion 等同于经典多网格扩展的简化形式多网格 ANN 方法
Pub Date : 2024-08-19 DOI: 10.1007/s00521-024-10311-1
Jeong-Kweon Seo

In this paper, we investigate the method of solving partial differential equations (PDEs) using artificial neural network (ANN) structures, which have been actively applied in artificial intelligence models. The ANN model for solving PDEs offers the advantage of providing explicit and continuous solutions. However, the ANN model for solving PDEs cannot construct a conventionally solvable linear system with known matrix solvers; thus, computational speed could be a significant concern. We study the implementation of the multigrid method, developing a general concept for a coarse-grid correction method to be integrated into the ANN-PDE architecture, with the goal of enhancing computational efficiency. By developing a reduced form of the multigrid method for ANN, we demonstrate that it can be interpreted as an equivalent representation of the classic multigrid expansion. We validated the applicability of the proposed method through rigorous experiments, which included analyzing loss decay and the number of iterations along with improvements in terms of accuracy, speed, and complexity. We accomplished this by employing the gradient descent method and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method to update the gradients while solving the given ANN systems of PDEs.

本文研究了利用人工神经网络(ANN)结构求解偏微分方程(PDE)的方法,该方法已被积极应用于人工智能模型中。用于求解 PDE 的 ANN 模型具有提供显式连续解的优势。然而,用于求解 PDE 的人工神经网络模型无法用已知的矩阵求解器构建传统的可解线性系统;因此,计算速度可能是一个重要问题。我们研究了多网格方法的实施,提出了将粗网格校正方法集成到 ANN-PDE 架构中的一般概念,目的是提高计算效率。通过为 ANN 开发简化形式的多网格方法,我们证明了它可以被解释为经典多网格扩展的等效表示。我们通过严格的实验验证了所提方法的适用性,包括分析损失衰减和迭代次数,以及在精度、速度和复杂性方面的改进。为此,我们采用梯度下降法和 Broyden-Fletcher-Goldfarb-Shanno (BFGS) 法更新梯度,同时求解给定的 PDE ANN 系统。
{"title":"A reduced-form multigrid approach for ANN equivalent to classic multigrid expansion","authors":"Jeong-Kweon Seo","doi":"10.1007/s00521-024-10311-1","DOIUrl":"https://doi.org/10.1007/s00521-024-10311-1","url":null,"abstract":"<p>In this paper, we investigate the method of solving partial differential equations (PDEs) using artificial neural network (ANN) structures, which have been actively applied in artificial intelligence models. The ANN model for solving PDEs offers the advantage of providing explicit and continuous solutions. However, the ANN model for solving PDEs cannot construct a conventionally solvable linear system with known matrix solvers; thus, computational speed could be a significant concern. We study the implementation of the multigrid method, developing a general concept for a coarse-grid correction method to be integrated into the ANN-PDE architecture, with the goal of enhancing computational efficiency. By developing a reduced form of the multigrid method for ANN, we demonstrate that it can be interpreted as an equivalent representation of the classic multigrid expansion. We validated the applicability of the proposed method through rigorous experiments, which included analyzing loss decay and the number of iterations along with improvements in terms of accuracy, speed, and complexity. We accomplished this by employing the gradient descent method and the Broyden–Fletcher–Goldfarb–Shanno (BFGS) method to update the gradients while solving the given ANN systems of PDEs.</p>","PeriodicalId":18925,"journal":{"name":"Neural Computing and Applications","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142188360","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
期刊
Neural Computing and 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