首页 > 最新文献

Engineering Applications of Artificial Intelligence最新文献

英文 中文
Building image reconstruction and dimensioning of the envelope from two-dimensional perspective drawings 根据二维透视图重建建筑图像和围护结构尺寸
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-21 DOI: 10.1016/j.engappai.2024.109657
Andrew Fisher , Lucas Moreira , Muntasir Billah , Pawan Lingras , Vijay Mago
In the construction industry, a project typically begins with the creation of two-dimensional (2D) building plans, defining the client’s specifications. Using these plans, a digital three-dimensional (3D) model is developed to visualize the anticipated outcome and to verify the model’s alignment with the client’s expectations. The process of converting from 2D to 3D can become time-intensive if there is a need for modifications or if the project’s overall complexity is high. To enhance efficiency and accuracy, this research introduces an end-to-end framework referred to as BIRD which stands for Building Image Reconstruction and Dimensioning. BIRD is capable of accepting five 2D perspective drawings of a building as inputs and generating a proportionate 3D model of the building envelope as an output. This is accomplished through the integration of multiple techniques that use convolutional neural networks to extract a refined set of line segments, identify measurements, and align each perspective with the floor plan drawing. The key contributions of this study includes: (1) a novel deep learning model designed for the identification of line segments in building plans; (2) novel algorithms that facilitate the generation of information required for 3D modeling; (3) an end-to-end framework for building reconstruction; and (4) novel performance metrics specifically tailored for the 2D to 3D conversion challenge. The practical application of this research was validated through the use of complete building plans provided by an industry partner. In summary, it was observed that BIRD demonstrated high accuracy in the creation of 3D visualizations, highlighting its real-world efficacy.
在建筑行业,项目通常从创建二维(2D)建筑图纸开始,确定客户的规格要求。利用这些图纸,开发出数字三维(3D)模型,以直观显示预期结果,并验证模型是否符合客户的期望。如果需要修改或项目整体复杂度较高,从二维转换到三维的过程可能会耗费大量时间。为了提高效率和准确性,本研究引入了一个端到端的框架,即 BIRD(建筑图像重建和尺寸标注)。BIRD 能够接受建筑物的五张二维透视图作为输入,并生成建筑物围护结构的比例三维模型作为输出。这是通过整合多种技术来实现的,这些技术使用卷积神经网络来提取细化线段集、识别测量值,并将每个透视图与平面图对齐。本研究的主要贡献包括(1) 专为识别建筑平面图中的线段而设计的新型深度学习模型;(2) 促进生成三维建模所需信息的新型算法;(3) 用于建筑重建的端到端框架;以及 (4) 专门针对二维到三维转换挑战而定制的新型性能指标。这项研究的实际应用通过使用行业合作伙伴提供的完整建筑图纸得到了验证。总之,BIRD 在三维可视化创建方面表现出很高的准确性,突出了其在现实世界中的功效。
{"title":"Building image reconstruction and dimensioning of the envelope from two-dimensional perspective drawings","authors":"Andrew Fisher ,&nbsp;Lucas Moreira ,&nbsp;Muntasir Billah ,&nbsp;Pawan Lingras ,&nbsp;Vijay Mago","doi":"10.1016/j.engappai.2024.109657","DOIUrl":"10.1016/j.engappai.2024.109657","url":null,"abstract":"<div><div>In the construction industry, a project typically begins with the creation of two-dimensional (2D) building plans, defining the client’s specifications. Using these plans, a digital three-dimensional (3D) model is developed to visualize the anticipated outcome and to verify the model’s alignment with the client’s expectations. The process of converting from 2D to 3D can become time-intensive if there is a need for modifications or if the project’s overall complexity is high. To enhance efficiency and accuracy, this research introduces an end-to-end framework referred to as <em>BIRD</em> which stands for <u>B</u>uilding <u>I</u>mage <u>R</u>econstruction and <u>D</u>imensioning. <em>BIRD</em> is capable of accepting five 2D perspective drawings of a building as inputs and generating a proportionate 3D model of the building envelope as an output. This is accomplished through the integration of multiple techniques that use convolutional neural networks to extract a refined set of line segments, identify measurements, and align each perspective with the floor plan drawing. The key contributions of this study includes: (1) a novel deep learning model designed for the identification of line segments in building plans; (2) novel algorithms that facilitate the generation of information required for 3D modeling; (3) an end-to-end framework for building reconstruction; and (4) novel performance metrics specifically tailored for the 2D to 3D conversion challenge. The practical application of this research was validated through the use of complete building plans provided by an industry partner. In summary, it was observed that <em>BIRD</em> demonstrated high accuracy in the creation of 3D visualizations, highlighting its real-world efficacy.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109657"},"PeriodicalIF":7.5,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720673","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Dynamic localization based-utility decision approach under type-2 Pythagorean fuzzy set for developing internet of modular self-reconfiguration robot things 基于 2 型毕达哥拉斯模糊集的动态定位-效用决策方法,用于开发模块化自重构机器人物联网
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-21 DOI: 10.1016/j.engappai.2024.109671
Nahia Mourad , A.A. Zaidan , Hassan A. Alsattar , Sarah Qahtan , B.B. Zaidan , Muhammet Deveci , Dragan Pamucar , Witold Pedrycz
The Internet of Modular Robot Things (IoMRT) has emerged through the integration of robotic systems into the Internet of Things (IoT), offering a wide range of solutions to meet continuously growing demands. Six self-reconfiguration functionalities/criteria have been proposed for developing IoMRT. However, no study has fully developed an IoMRT that satisfies all the necessary functionalities. Additionally, there is a lack of scholarly research proposing a decision-based approach for evaluating and ranking IoMRT, which highlights a significant research gap. A complex multiple-criteria decision-making (MCDM) problem has arisen in evaluating and ranking IoMRT due to the diversity of functionalities, the need to prioritize these functionalities based on their importance, and data variability. To address this issue, the study proposes a novel decision-based approach for evaluating and ranking IoMRT, which consists of three phases: (i) Developing a novel weighting method called T2PFS-FWZICbIP (Type-2 Pythagorean Fuzzy Set–Fuzzy Weighted Zero Inconsistency based on Interrelationship Process) to measure the importance of the identified functionalities; (ii) Formulating a decision matrix by cross-referencing potential IoMRT developments with the six self-reconfiguration functionalities resulted in the selection of a random sample of 50 IoMRTs as proof of concept. Following this, the DLbU (Dynamic Localization-based Utility) method was proposed, integrating dynamic localization and utility procedures to manage binary data within the decision matrix; (iii) Developing a novel ranking method, T2PFS-DNMA (Type-2 Pythagorean Fuzzy Set–Double Normalization-based Multiple Aggregation), to address the diversity of functionalities and concerns regarding data variance. The results revealed that the Distributed functionality (C1) received the highest weight value of 0.4060 according to T2PFS-FWZICbIP, indicating its high importance in the ranking of IoMRT. In contrast, the High-Fidelity functionality (C5) received a weight value of 0.0733, indicating its very low importance in the ranking. IoMRT2 and IoMRT35 were identified as the most and least favored, respectively, according to T2PFS-DNMA. The robustness of the proposed approach was assessed through sensitivity analysis and comparative studies.
模块化机器人物联网(IoMRT)是通过将机器人系统集成到物联网(IoT)中而出现的,它提供了广泛的解决方案,以满足不断增长的需求。为开发 IoMRT,已经提出了六种自我重新配置功能/标准。然而,还没有一项研究能完全开发出满足所有必要功能的物联网远程监控技术。此外,缺乏学术研究提出一种基于决策的方法来评估物联网实时路况跟踪系统并对其进行排序,这凸显了一个重大的研究空白。由于功能的多样性、根据重要性对这些功能进行优先排序的必要性以及数据的多变性,在对物联网实时通信技术进行评估和排序时出现了一个复杂的多重标准决策(MCDM)问题。为解决这一问题,本研究提出了一种新颖的基于决策的方法,用于对物联网实时交通进行评估和排序,该方法包括三个阶段:(i) 开发一种名为 T2PFS-FWZICbIP(基于相互关系过程的第 2 类毕达哥拉斯模糊集-模糊加权零不一致性)的新型加权方法,以衡量已识别功能的重要性;(ii) 通过将潜在的物联网实时路由器开发与六种自重新配置功能相互参照,形成一个决策矩阵,最终随机选择 50 个物联网实时路由器样本作为概念验证。随后,提出了 DLbU(基于动态定位的效用)方法,整合了动态定位和效用程序,以管理决策矩阵中的二进制数据;(iii) 开发了一种新的排序方法 T2PFS-DNMA(Type-2 Pythagorean Fuzzy Set-Double Normalization-based Multiple Aggregation),以解决功能的多样性和数据差异问题。结果显示,根据 T2PFS-FWZICbIP 方法,分布式功能(C1)的权重值最高,为 0.4060,表明其在 IoMRT 排序中的重要性很高。相比之下,高保真功能(C5)的权重值为 0.0733,表明其在排序中的重要性非常低。根据 T2PFS-DNMA 方法,IoMRT2 和 IoMRT35 分别被认为是最受欢迎和最不受欢迎的。通过敏感性分析和比较研究评估了所建议方法的稳健性。
{"title":"Dynamic localization based-utility decision approach under type-2 Pythagorean fuzzy set for developing internet of modular self-reconfiguration robot things","authors":"Nahia Mourad ,&nbsp;A.A. Zaidan ,&nbsp;Hassan A. Alsattar ,&nbsp;Sarah Qahtan ,&nbsp;B.B. Zaidan ,&nbsp;Muhammet Deveci ,&nbsp;Dragan Pamucar ,&nbsp;Witold Pedrycz","doi":"10.1016/j.engappai.2024.109671","DOIUrl":"10.1016/j.engappai.2024.109671","url":null,"abstract":"<div><div>The Internet of Modular Robot Things (IoMRT) has emerged through the integration of robotic systems into the Internet of Things (IoT), offering a wide range of solutions to meet continuously growing demands. Six self-reconfiguration functionalities/criteria have been proposed for developing IoMRT. However, no study has fully developed an IoMRT that satisfies all the necessary functionalities. Additionally, there is a lack of scholarly research proposing a decision-based approach for evaluating and ranking IoMRT, which highlights a significant research gap. A complex multiple-criteria decision-making (MCDM) problem has arisen in evaluating and ranking IoMRT due to the diversity of functionalities, the need to prioritize these functionalities based on their importance, and data variability. To address this issue, the study proposes a novel decision-based approach for evaluating and ranking IoMRT, which consists of three phases: (i) Developing a novel weighting method called T2PFS-FWZICbIP (Type-2 Pythagorean Fuzzy Set–Fuzzy Weighted Zero Inconsistency based on Interrelationship Process) to measure the importance of the identified functionalities; (ii) Formulating a decision matrix by cross-referencing potential IoMRT developments with the six self-reconfiguration functionalities resulted in the selection of a random sample of 50 IoMRTs as proof of concept. Following this, the DLbU (Dynamic Localization-based Utility) method was proposed, integrating dynamic localization and utility procedures to manage binary data within the decision matrix; (iii) Developing a novel ranking method, T2PFS-DNMA (Type-2 Pythagorean Fuzzy Set–Double Normalization-based Multiple Aggregation), to address the diversity of functionalities and concerns regarding data variance. The results revealed that the Distributed functionality (C1) received the highest weight value of 0.4060 according to T2PFS-FWZICbIP, indicating its high importance in the ranking of IoMRT. In contrast, the High-Fidelity functionality (C5) received a weight value of 0.0733, indicating its very low importance in the ranking. IoMRT2 and IoMRT35 were identified as the most and least favored, respectively, according to T2PFS-DNMA. The robustness of the proposed approach was assessed through sensitivity analysis and comparative studies.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109671"},"PeriodicalIF":7.5,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720674","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands 具有时间窗口和动态需求的多网点取货和送货车辆路由问题
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-21 DOI: 10.1016/j.engappai.2024.109700
Yong Wang , Mengyuan Gou , Siyu Luo , Jianxin Fan , Haizhong Wang
The rapid development of the urban logistics recycling industry, combined with the complexity of the pickup and delivery networks, has created a surge in dynamic customer demands and exacerbated the difficulty of logistics resource sharing. Accordingly, this work focuses on a multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands, which incorporates resource sharing. A bi-objective mathematical model is formulated to minimize the total operating cost and number of vehicles. A three-dimensional affinity propagation clustering and an adaptive nondominated sorting genetic algorithm-II are combined to find Pareto optimal solutions. A dynamic demand insertion strategy is proposed to determine the vehicle service sequences for dynamic situations. Combined with an elite iteration mechanism to prevent the proposed algorithm from falling into search stagnation and improve the convergence performance. The superiority of the proposed algorithm is verified by comparing with CPLEX solver (i.e., ILOG CPLEX Optimization Studio 12.10), multi-objective ant colony optimization, multi-objective particle swarm optimization, multi-objective evolutionary algorithm, multi-objective genetic algorithm, and decomposition-based multi-objective evolutionary algorithm with tabu search. Besides, the proposed model and algorithm are tested by a real-world case study in Chongqing city, China, and the further analysis indicates that significant improvement can be achieved. Furthermore, by incorporating the recognition and prediction techniques of artificial intelligence on dynamic demand data, the proposed approach can realize the self-optimization of multi-depot vehicle routes and the precise allocation of logistics resources in dynamic environments. This study is conducive to the construction of a digitally-intelligent urban logistics system.
城市物流回收行业的快速发展,加上取货和送货网络的复杂性,造成了客户需求的动态激增,加剧了物流资源共享的难度。因此,本研究将重点放在具有时间窗口和动态需求的多网点取货和送货车辆路由问题上,并将资源共享纳入其中。本文建立了一个双目标数学模型,以最小化总运营成本和车辆数量。结合三维亲和传播聚类和自适应非支配排序遗传算法-II,找到帕累托最优解。提出了一种动态需求插入策略,以确定动态情况下的车辆服务序列。结合精英迭代机制,防止算法陷入搜索停滞,提高收敛性能。通过与 CPLEX 求解器(即 ILOG CPLEX Optimization Studio 12.10)、多目标蚁群优化、多目标粒子群优化、多目标进化算法、多目标遗传算法以及基于分解的多目标进化算法与 tabu 搜索进行比较,验证了所提算法的优越性。此外,在中国重庆市的实际案例研究中对所提出的模型和算法进行了测试,进一步的分析表明可以实现显著的改进。此外,通过结合人工智能对动态需求数据的识别和预测技术,所提出的方法可以实现动态环境下多网点车辆路线的自我优化和物流资源的精确分配。这项研究有利于构建数字化智能城市物流系统。
{"title":"The multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands","authors":"Yong Wang ,&nbsp;Mengyuan Gou ,&nbsp;Siyu Luo ,&nbsp;Jianxin Fan ,&nbsp;Haizhong Wang","doi":"10.1016/j.engappai.2024.109700","DOIUrl":"10.1016/j.engappai.2024.109700","url":null,"abstract":"<div><div>The rapid development of the urban logistics recycling industry, combined with the complexity of the pickup and delivery networks, has created a surge in dynamic customer demands and exacerbated the difficulty of logistics resource sharing. Accordingly, this work focuses on a multi-depot pickup and delivery vehicle routing problem with time windows and dynamic demands, which incorporates resource sharing. A bi-objective mathematical model is formulated to minimize the total operating cost and number of vehicles. A three-dimensional affinity propagation clustering and an adaptive nondominated sorting genetic algorithm-II are combined to find Pareto optimal solutions. A dynamic demand insertion strategy is proposed to determine the vehicle service sequences for dynamic situations. Combined with an elite iteration mechanism to prevent the proposed algorithm from falling into search stagnation and improve the convergence performance. The superiority of the proposed algorithm is verified by comparing with CPLEX solver (i.e., ILOG CPLEX Optimization Studio 12.10), multi-objective ant colony optimization, multi-objective particle swarm optimization, multi-objective evolutionary algorithm, multi-objective genetic algorithm, and decomposition-based multi-objective evolutionary algorithm with tabu search. Besides, the proposed model and algorithm are tested by a real-world case study in Chongqing city, China, and the further analysis indicates that significant improvement can be achieved. Furthermore, by incorporating the recognition and prediction techniques of artificial intelligence on dynamic demand data, the proposed approach can realize the self-optimization of multi-depot vehicle routes and the precise allocation of logistics resources in dynamic environments. This study is conducive to the construction of a digitally-intelligent urban logistics system.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109700"},"PeriodicalIF":7.5,"publicationDate":"2024-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720891","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Model-agnostic local explanation: Multi-objective genetic algorithm explainer 与模型无关的本地解释:多目标遗传算法解释器
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109628
Hossein Nematzadeh , José García-Nieto , Sandro Hurtado , José F. Aldana-Montes , Ismael Navas-Delgado
Late detection of plant diseases leads to irreparable losses for farmers, threatening global food security, economic stability, and environmental sustainability. This research introduces the Multi-Objective Genetic Algorithm Explainer (MOGAE), a novel model-agnostic local explainer for image data aimed at the early detection of citrus diseases. MOGAE enhances eXplainable Artificial Intelligence (XAI) by leveraging the Non-dominated Sorting Genetic Algorithm II (NSGA-II) with an adaptive Bit Flip Mutation (BFM) incorporating densify and sparsify operators to adjust superpixel granularity automatically. This innovative approach simplifies the explanation process by eliminating several critical hyperparameters required by traditional methods like Local Interpretable Model-Agnostic Explanations (LIME). To develop the citrus disease classification model, we preprocess the leaf dataset through stratified data splitting, oversampling, and augmentation techniques, then fine-tuning a pre-trained Residual Network 50 layers (ResNet50) model. MOGAE’s effectiveness is demonstrated through comparative analyses with the Ensemble-based Genetic Algorithm Explainer (EGAE) and LIME, showing superior accuracy and interpretability using criteria such as numeric accuracy of explanation and Number of Function Evaluations (NFE). We assess accuracy both intuitively and numerically by measuring the Euclidean distance between expert-provided explanations and those generated by the explainer. The appendix also includes an extensive evaluation of MOGAE on the melanoma dataset, highlighting its versatility and robustness in other domains. The related implementation code for the fine-tuned ResNet50 and MOGAE is available at https://github.com/KhaosResearch/Plant-disease-explanation.
植物病害检测不及时会给农民造成无法弥补的损失,威胁全球粮食安全、经济稳定和环境可持续性。本研究介绍了多目标遗传算法解释器(MOGAE),这是一种新颖的图像数据局部解释器,用于早期检测柑橘病害。MOGAE 利用非优势排序遗传算法 II(NSGA-II)和自适应比特翻转突变(BFM),结合致密化和稀疏化算子,自动调整超像素粒度,从而增强了可解释人工智能(XAI)。这种创新方法消除了本地可解释模型诊断解释(LIME)等传统方法所需的几个关键超参数,从而简化了解释过程。为了开发柑橘病害分类模型,我们通过分层数据分割、超采样和增强技术对叶片数据集进行了预处理,然后对预先训练好的 50 层残差网络(ResNet50)模型进行了微调。通过与基于集合的遗传算法解释器(EGAE)和 LIME 的比较分析,我们证明了 MOGAE 的有效性,并根据解释的数字准确性和函数评估次数(NFE)等标准,展示了其卓越的准确性和可解释性。我们通过测量专家提供的解释与解释器生成的解释之间的欧氏距离,从直观和数值两方面评估了准确性。附录还包括在黑色素瘤数据集上对 MOGAE 的广泛评估,突出了它在其他领域的通用性和鲁棒性。微调后的 ResNet50 和 MOGAE 的相关实现代码请访问 https://github.com/KhaosResearch/Plant-disease-explanation。
{"title":"Model-agnostic local explanation: Multi-objective genetic algorithm explainer","authors":"Hossein Nematzadeh ,&nbsp;José García-Nieto ,&nbsp;Sandro Hurtado ,&nbsp;José F. Aldana-Montes ,&nbsp;Ismael Navas-Delgado","doi":"10.1016/j.engappai.2024.109628","DOIUrl":"10.1016/j.engappai.2024.109628","url":null,"abstract":"<div><div>Late detection of plant diseases leads to irreparable losses for farmers, threatening global food security, economic stability, and environmental sustainability. This research introduces the Multi-Objective Genetic Algorithm Explainer (MOGAE), a novel model-agnostic local explainer for image data aimed at the early detection of citrus diseases. MOGAE enhances eXplainable Artificial Intelligence (XAI) by leveraging the Non-dominated Sorting Genetic Algorithm II (NSGA-II) with an adaptive Bit Flip Mutation (BFM) incorporating densify and sparsify operators to adjust superpixel granularity automatically. This innovative approach simplifies the explanation process by eliminating several critical hyperparameters required by traditional methods like Local Interpretable Model-Agnostic Explanations (LIME). To develop the citrus disease classification model, we preprocess the leaf dataset through stratified data splitting, oversampling, and augmentation techniques, then fine-tuning a pre-trained Residual Network 50 layers (ResNet50) model. MOGAE’s effectiveness is demonstrated through comparative analyses with the Ensemble-based Genetic Algorithm Explainer (EGAE) and LIME, showing superior accuracy and interpretability using criteria such as numeric accuracy of explanation and Number of Function Evaluations (NFE). We assess accuracy both intuitively and numerically by measuring the Euclidean distance between expert-provided explanations and those generated by the explainer. The appendix also includes an extensive evaluation of MOGAE on the melanoma dataset, highlighting its versatility and robustness in other domains. The related implementation code for the fine-tuned ResNet50 and MOGAE is available at <span><span>https://github.com/KhaosResearch/Plant-disease-explanation</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109628"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720889","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Quantum-inspired metaheuristic algorithms for Industry 4.0: A scientometric analysis 面向工业 4.0 的量子启发元搜索算法:科学计量分析
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109635
Pooja, Sandeep Kumar Sood
Quantum-inspired Metaheuristic algorithms have redefined non-deterministic polynomial time hard optimization challenges by leveraging quantum mechanics principles. These algorithms herald a broad range of application scenarios in Industry 4.0 and offer feasible time solutions for complex, large-scale industrial landscapes. The potential benefits provided by the quantum-inspired metaheuristic algorithms have accelerated the scientific advancements in this domain. Consequently, the present research contributes to the existing knowledge base by presenting the intellectual landscape through scientometric and systematic literature analysis. The study is conducted on the dataset derived from the Scopus and Web of Science databases, covering 2001 to 2023. The study employs co-citation and co-occurrence analyses to discern prominent research topics, emerging research frontiers, significant authors, and the most collaborating countries. The research findings underscore that electric vehicles, energy efficiency, and combinatorial optimization are prominent research topics, while carbon emission, resource management, and path planning are burgeoning areas of exploration in this knowledge domain. The intricate and entangled network linkage determines that the research community in this domain fosters a dynamic and synergistic relationship. Overall, the pivotal insights and the research challenges articulated in this article offer valuable insights to researchers and the academic community, aiding in discerning the intellectual terrain and emerging research patterns in quantum-inspired metaheuristic algorithms. This, in turn, fosters the advancement of innovation and facilitates well-informed decision-making within this evolving research paradigm.
量子启发元启发式算法利用量子力学原理重新定义了非确定性多项式时间困难优化挑战。这些算法预示着工业 4.0 的广泛应用场景,并为复杂的大规模工业环境提供了可行的时间解决方案。量子启发元启发式算法提供的潜在优势加速了该领域的科学进步。因此,本研究通过科学计量学和系统的文献分析,展示了知识图景,为现有知识库做出了贡献。本研究的数据集来自 Scopus 和 Web of Science 数据库,时间跨度为 2001 年至 2023 年。研究采用了共引和共现分析,以发现突出的研究课题、新兴的研究前沿、重要的作者以及合作最多的国家。研究结果表明,电动汽车、能源效率和组合优化是突出的研究课题,而碳排放、资源管理和路径规划则是该知识领域新兴的探索领域。错综复杂的网络联系决定了这一领域的研究界形成了一种动态的协同关系。总之,本文阐述的关键见解和研究挑战为研究人员和学术界提供了宝贵的见解,有助于辨别量子启发元启发式算法的知识领域和新兴研究模式。这反过来又促进了创新的进步,有利于在这一不断发展的研究范式中做出明智的决策。
{"title":"Quantum-inspired metaheuristic algorithms for Industry 4.0: A scientometric analysis","authors":"Pooja,&nbsp;Sandeep Kumar Sood","doi":"10.1016/j.engappai.2024.109635","DOIUrl":"10.1016/j.engappai.2024.109635","url":null,"abstract":"<div><div>Quantum-inspired Metaheuristic algorithms have redefined non-deterministic polynomial time hard optimization challenges by leveraging quantum mechanics principles. These algorithms herald a broad range of application scenarios in Industry 4.0 and offer feasible time solutions for complex, large-scale industrial landscapes. The potential benefits provided by the quantum-inspired metaheuristic algorithms have accelerated the scientific advancements in this domain. Consequently, the present research contributes to the existing knowledge base by presenting the intellectual landscape through scientometric and systematic literature analysis. The study is conducted on the dataset derived from the Scopus and Web of Science databases, covering 2001 to 2023. The study employs co-citation and co-occurrence analyses to discern prominent research topics, emerging research frontiers, significant authors, and the most collaborating countries. The research findings underscore that electric vehicles, energy efficiency, and combinatorial optimization are prominent research topics, while carbon emission, resource management, and path planning are burgeoning areas of exploration in this knowledge domain. The intricate and entangled network linkage determines that the research community in this domain fosters a dynamic and synergistic relationship. Overall, the pivotal insights and the research challenges articulated in this article offer valuable insights to researchers and the academic community, aiding in discerning the intellectual terrain and emerging research patterns in quantum-inspired metaheuristic algorithms. This, in turn, fosters the advancement of innovation and facilitates well-informed decision-making within this evolving research paradigm.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109635"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720595","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Automatic collaborative learning for drug repositioning 药物重新定位的自动协作学习
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109653
Yi Wang , Yajie Meng , Chang Zhou , Xianfang Tang , Pan Zeng , Chu Pan , Qiang Zhu , Bengong Zhang , Junlin Xu
Drug repositioning seeks to identify new therapeutic uses for existing drugs, accelerating development and reducing costs. While traditional wet lab experiments are costly, computational methods offer a low-cost, efficient alternative. Despite their potential, most research in this field has uncritically employed the standard message-passing mechanism of Graph Neural Network (GNN), limiting the assessment of collaborative effects on prediction accuracy. In this paper, we introduce a novel model, an automatic collaborative learning framework for drug repositioning. Initially, we propose a metric to measure the interaction levels among neighbors and integrate it with the intrinsic message-passing mechanism of GNN, thereby enhancing the impact of various collaborative effects on prediction accuracy. Furthermore, we introduce an advanced contrastive learning technique to align feature consistency between the disease–drug association space and the customized neighbor space. This approach leverages the inherent regularities across different feature dimensions to minimize feature redundancy. Extensive experiments conducted on three benchmark datasets demonstrate substantial improvements of this novel model over various state-of-the-art methods. Case studies further highlight the practical utility of this model.
药物重新定位旨在为现有药物确定新的治疗用途,从而加快研发速度并降低成本。传统的湿实验室实验成本高昂,而计算方法则提供了一种低成本、高效率的替代方法。尽管这些方法潜力巨大,但该领域的大多数研究都不加批判地采用了图神经网络(GNN)的标准信息传递机制,从而限制了对预测准确性的协同效应评估。在本文中,我们引入了一个新模型,即药物重新定位的自动协作学习框架。首先,我们提出了一种衡量邻居之间交互水平的指标,并将其与 GNN 固有的消息传递机制相结合,从而增强了各种协作效应对预测准确性的影响。此外,我们还引入了一种先进的对比学习技术,以调整疾病-药物关联空间和自定义邻居空间之间的特征一致性。这种方法利用了不同特征维度的固有规律性,最大限度地减少了特征冗余。在三个基准数据集上进行的广泛实验表明,与各种最先进的方法相比,这种新型模型有了实质性的改进。案例研究进一步凸显了这一模型的实用性。
{"title":"Automatic collaborative learning for drug repositioning","authors":"Yi Wang ,&nbsp;Yajie Meng ,&nbsp;Chang Zhou ,&nbsp;Xianfang Tang ,&nbsp;Pan Zeng ,&nbsp;Chu Pan ,&nbsp;Qiang Zhu ,&nbsp;Bengong Zhang ,&nbsp;Junlin Xu","doi":"10.1016/j.engappai.2024.109653","DOIUrl":"10.1016/j.engappai.2024.109653","url":null,"abstract":"<div><div>Drug repositioning seeks to identify new therapeutic uses for existing drugs, accelerating development and reducing costs. While traditional wet lab experiments are costly, computational methods offer a low-cost, efficient alternative. Despite their potential, most research in this field has uncritically employed the standard message-passing mechanism of Graph Neural Network (GNN), limiting the assessment of collaborative effects on prediction accuracy. In this paper, we introduce a novel model, an automatic collaborative learning framework for drug repositioning. Initially, we propose a metric to measure the interaction levels among neighbors and integrate it with the intrinsic message-passing mechanism of GNN, thereby enhancing the impact of various collaborative effects on prediction accuracy. Furthermore, we introduce an advanced contrastive learning technique to align feature consistency between the disease–drug association space and the customized neighbor space. This approach leverages the inherent regularities across different feature dimensions to minimize feature redundancy. Extensive experiments conducted on three benchmark datasets demonstrate substantial improvements of this novel model over various state-of-the-art methods. Case studies further highlight the practical utility of this model.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109653"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720771","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A knowledge-refined hybrid graph model for quality prediction of industrial processes 用于工业流程质量预测的知识提炼混合图模型
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109711
Yang Wang , Feifan Shen , Lingjian Ye
The complexity of industrial processes has spurred the application of soft sensor techniques for predicting key quality variables based on easy-measurable process variables. Currently, data-driven soft sensors based on Artificial Intelligence techniques have become the mainstream. However, these soft sensing models deeply rely on the quality of training data, where the domain knowledge is often ignored. Meanwhile, a significant amount of labeled data is not fully utilized. To address these issues, this paper proposes a supervised framework based on a knowledge-refined hybrid graph network, which contributes to the artificial intelligence application of nonlinear dynamic soft sensors. The problems of applying traditional artificial intelligence models in soft sensor have been addressed by reconstructing the input module of graph neural networks with knowledge-guided approaches. Both spatial and temporal correlations of process data are captured and the hybrid network significantly improves the reliability and interpretability of the soft sensing model. By incorporating labeled data into the model, the representation of quality information is also enhanced. Finally, the proposed framework was applied to an industrial debutanizer column, and the experimental results fully demonstrate the effectiveness and superiority of the method.
工业流程的复杂性促使人们应用软传感器技术,根据易于测量的流程变量预测关键质量变量。目前,基于人工智能技术的数据驱动型软传感器已成为主流。然而,这些软传感模型严重依赖于训练数据的质量,而领域知识往往被忽视。同时,大量标注数据没有得到充分利用。针对这些问题,本文提出了一种基于知识提炼混合图网络的监督框架,有助于非线性动态软传感器的人工智能应用。通过知识引导方法重构图神经网络的输入模块,解决了传统人工智能模型在软传感器中的应用问题。混合网络捕捉了过程数据的空间和时间相关性,显著提高了软传感模型的可靠性和可解释性。通过将标记数据纳入模型,质量信息的表示也得到了增强。最后,将所提出的框架应用于工业去芒硝塔,实验结果充分证明了该方法的有效性和优越性。
{"title":"A knowledge-refined hybrid graph model for quality prediction of industrial processes","authors":"Yang Wang ,&nbsp;Feifan Shen ,&nbsp;Lingjian Ye","doi":"10.1016/j.engappai.2024.109711","DOIUrl":"10.1016/j.engappai.2024.109711","url":null,"abstract":"<div><div>The complexity of industrial processes has spurred the application of soft sensor techniques for predicting key quality variables based on easy-measurable process variables. Currently, data-driven soft sensors based on Artificial Intelligence techniques have become the mainstream. However, these soft sensing models deeply rely on the quality of training data, where the domain knowledge is often ignored. Meanwhile, a significant amount of labeled data is not fully utilized. To address these issues, this paper proposes a supervised framework based on a knowledge-refined hybrid graph network, which contributes to the artificial intelligence application of nonlinear dynamic soft sensors. The problems of applying traditional artificial intelligence models in soft sensor have been addressed by reconstructing the input module of graph neural networks with knowledge-guided approaches. Both spatial and temporal correlations of process data are captured and the hybrid network significantly improves the reliability and interpretability of the soft sensing model. By incorporating labeled data into the model, the representation of quality information is also enhanced. Finally, the proposed framework was applied to an industrial debutanizer column, and the experimental results fully demonstrate the effectiveness and superiority of the method.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109711"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel multi-objective artificial bee colony algorithm for solving the two-echelon load-dependent location-routing problem with pick-up and delivery 一种新颖的多目标人工蜂群算法,用于解决具有取货和送货功能的双货柜货载定位路由问题
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109636
Dekun Tan, Xuhui Liu, Ruchun Zhou, Xuefeng Fu, Zhenzhen Li
This study considers a two-echelon load-dependent location routing problem with pick-up and delivery (2E-LDLRPPD). As a variant of the two-echelon vehicle routing problem with pick-up and delivery (2E-VRPPD), the 2E-LDLRPPD includes additional variants such as two-echelon location-routing problem (2E-LRP) and load-dependent vehicle routing problem (LDVRP). However, much of the existing research work has traditionally focused on a single objective, predominantly aimed to minimize costs. In our case, we build a multi-objective model that concurrently minimizes costs, carbon emissions, and the number of vehicles used. Heuristic algorithms are commonly used to solve complex location-routing problems. Therefore, we propose a hybrid heuristic algorithm named the improved elite-guided multi-objective artificial bee colony algorithm with variable neighborhood search (IEMOABC-VNS). Base on elite-guided multi-objective artificial bee colony algorithm (EMOABC), a two-archive elite-guide strategy is deployed to strike a balance between diversity and convergence. The efficacy of the IEMOABC-VNS is compared experimentally with four other hybrid heuristic algorithms on test instances and a real-world case. Computational results demonstrate that the IEMOABC-VNS outperforms the competing algorithms in solving 2E-LDLRPPD, and obtains a high-quality Pareto front in a relatively short time. Especially, the algorithm exhibits significant performance enhancements when applied to large-scale instances.
本研究考虑的是带取货和送货功能的双干线负载相关位置路由问题(2E-LDLRPPD)。作为带取货和送货的双货柜车辆路由问题(2E-VRPPD)的变体,2E-LDLRPPD 还包括其他变体,如双货柜位置路由问题(2E-LRP)和负载相关车辆路由问题(LDVRP)。然而,现有的大部分研究工作传统上都集中在单一目标上,主要目的是最大限度地降低成本。在我们的案例中,我们建立了一个多目标模型,同时使成本、碳排放和车辆使用数量最小化。启发式算法通常用于解决复杂的定位路由问题。因此,我们提出了一种混合启发式算法,名为 "改进的精英引导多目标人工蜂群算法与可变邻域搜索(IEMOABC-VNS)"。该算法以精英引导多目标人工蜂群算法(EMOABC)为基础,采用双档案精英引导策略,在多样性和收敛性之间取得平衡。IEMOABC-VNS 的功效通过实验与其他四种混合启发式算法在测试实例和实际案例上进行了比较。计算结果表明,IEMOABC-VNS 在求解 2E-LDLRPPD 时优于其他竞争算法,并能在较短时间内获得高质量的帕累托前沿。特别是,该算法在应用于大规模实例时表现出了显著的性能提升。
{"title":"A novel multi-objective artificial bee colony algorithm for solving the two-echelon load-dependent location-routing problem with pick-up and delivery","authors":"Dekun Tan,&nbsp;Xuhui Liu,&nbsp;Ruchun Zhou,&nbsp;Xuefeng Fu,&nbsp;Zhenzhen Li","doi":"10.1016/j.engappai.2024.109636","DOIUrl":"10.1016/j.engappai.2024.109636","url":null,"abstract":"<div><div>This study considers a two-echelon load-dependent location routing problem with pick-up and delivery (2E-LDLRPPD). As a variant of the two-echelon vehicle routing problem with pick-up and delivery (2E-VRPPD), the 2E-LDLRPPD includes additional variants such as two-echelon location-routing problem (2E-LRP) and load-dependent vehicle routing problem (LDVRP). However, much of the existing research work has traditionally focused on a single objective, predominantly aimed to minimize costs. In our case, we build a multi-objective model that concurrently minimizes costs, carbon emissions, and the number of vehicles used. Heuristic algorithms are commonly used to solve complex location-routing problems. Therefore, we propose a hybrid heuristic algorithm named the improved elite-guided multi-objective artificial bee colony algorithm with variable neighborhood search (IEMOABC-VNS). Base on elite-guided multi-objective artificial bee colony algorithm (EMOABC), a two-archive elite-guide strategy is deployed to strike a balance between diversity and convergence. The efficacy of the IEMOABC-VNS is compared experimentally with four other hybrid heuristic algorithms on test instances and a real-world case. Computational results demonstrate that the IEMOABC-VNS outperforms the competing algorithms in solving 2E-LDLRPPD, and obtains a high-quality Pareto front in a relatively short time. Especially, the algorithm exhibits significant performance enhancements when applied to large-scale instances.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109636"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A collaborative surface target detection and localization method for an unmanned surface vehicle swarm 无人水面飞行器群的水面目标协同探测和定位方法
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-20 DOI: 10.1016/j.engappai.2024.109679
Bo Wang , Chenyu Mao , Kaixin Wei , Xueyi Wu , Ye Li
A single unmanned surface vehicle (USV) designed for marine missions suffers from limited payload, low efficiency and weak intelligence, while a swarm of USVs shows significant advantages in mission flexibility, diverse payload and task efficiency. One of the key issues for an USV swarm is how to achieve highly efficient collaborative perception. To address this issue, a method framework of collaborative surface target detection and localization based on multiple sensors for a swarm including 4 USVs is designed. First, perception systems are constructed, a joint calibration method for different sensors is proposed, and a lightweight target detection method improved with attention mechanism and lightweight adaptive spatial feature fusion is designed. Second, a specialized fusion method using sensor principles based on an extended Kalman filter (EKF) is proposed for a single USV to obtain a target state model. Third, the obtained target models from different USVs are registered with fuzzy matching and integrated into the complete model in a geographic coordinate system. The proposed method is applied to the collaborative perception system on our developed 4 USV swarm and verified in real marine environment and simulation. Experimental results show that our proposed method framework significantly improves the accuracy, efficiency, and reliability of the target detection and localization. The proposed LAF-YOLOv8-s reduces the model size by 5.1M, while the mean average precision (mAP) reaches 68.7%, which is significantly superior to other methods. The average collaborative localization error is reduced by 2.9m. The dataset is available at https://github.com/maochenyu1/WSLight.
为执行海洋任务而设计的单个无人水面飞行器(USV)存在有效载荷有限、效率低和智能弱等问题,而无人水面飞行器群则在任务灵活性、有效载荷多样性和任务效率方面具有显著优势。USV 星群的关键问题之一是如何实现高效的协同感知。为解决这一问题,本文设计了一种基于多传感器的水面目标协同探测和定位方法框架,适用于包括 4 艘 USV 的星群。首先,构建了感知系统,提出了不同传感器的联合校准方法,并设计了一种利用注意力机制和轻量级自适应空间特征融合改进的轻量级目标检测方法。其次,针对单个 USV,提出了一种基于扩展卡尔曼滤波器(EKF)、利用传感器原理的专门融合方法,以获得目标状态模型。第三,将不同 USV 获得的目标模型进行模糊匹配注册,并在地理坐标系中整合成完整的模型。我们将提出的方法应用于我们开发的 4 USV 蜂群协同感知系统,并在真实海洋环境和模拟环境中进行了验证。实验结果表明,我们提出的方法框架显著提高了目标探测和定位的准确性、效率和可靠性。提出的 LAF-YOLOv8-s 减少了 5.1M 的模型大小,平均精度(mAP)达到 68.7%,明显优于其他方法。平均协作定位误差减少了 2.9 米。数据集可在 https://github.com/maochenyu1/WSLight 上获取。
{"title":"A collaborative surface target detection and localization method for an unmanned surface vehicle swarm","authors":"Bo Wang ,&nbsp;Chenyu Mao ,&nbsp;Kaixin Wei ,&nbsp;Xueyi Wu ,&nbsp;Ye Li","doi":"10.1016/j.engappai.2024.109679","DOIUrl":"10.1016/j.engappai.2024.109679","url":null,"abstract":"<div><div>A single unmanned surface vehicle (USV) designed for marine missions suffers from limited payload, low efficiency and weak intelligence, while a swarm of USVs shows significant advantages in mission flexibility, diverse payload and task efficiency. One of the key issues for an USV swarm is how to achieve highly efficient collaborative perception. To address this issue, a method framework of collaborative surface target detection and localization based on multiple sensors for a swarm including 4 USVs is designed. First, perception systems are constructed, a joint calibration method for different sensors is proposed, and a lightweight target detection method improved with attention mechanism and lightweight adaptive spatial feature fusion is designed. Second, a specialized fusion method using sensor principles based on an extended Kalman filter (EKF) is proposed for a single USV to obtain a target state model. Third, the obtained target models from different USVs are registered with fuzzy matching and integrated into the complete model in a geographic coordinate system. The proposed method is applied to the collaborative perception system on our developed 4 USV swarm and verified in real marine environment and simulation. Experimental results show that our proposed method framework significantly improves the accuracy, efficiency, and reliability of the target detection and localization. The proposed LAF-YOLOv8-s reduces the model size by 5.1M, while the mean average precision (mAP) reaches 68.7%, which is significantly superior to other methods. The average collaborative localization error is reduced by 2.9m. The dataset is available at <span><span>https://github.com/maochenyu1/WSLight</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109679"},"PeriodicalIF":7.5,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Positive discrimination of minority classes through data generation and distribution: A case study in olive disease classification 通过数据生成和分发积极区分少数群体:橄榄疾病分类案例研究
IF 7.5 2区 计算机科学 Q1 AUTOMATION & CONTROL SYSTEMS Pub Date : 2024-11-19 DOI: 10.1016/j.engappai.2024.109646
Hicham El Akhal, Aissa Ben Yahya, Abdelbaki El Belrhiti El Alaoui
Deep learning models have achieved remarkable success in various tasks, especially in classification. This success is particularly evident in the precise classification of plant diseases, which is crucial for effective agricultural management. However, accurate classification faces challenges, particularly in data collection, where certain classes are underrepresented, namely the minority classes. This issue can significantly impact model performance. To tackle this challenge, this paper introduces a novel methodology that differs from existing approaches. We focus on addressing the issue of minority classes in image-based classification tasks, particularly for olive diseases. We employ data generation methods, including basic transformations, to produce augmented data and utilize Deep Convolutional Generative Adversarial Networks (DCGAN) to produce generated data. Next, we apply the Frechet Inception Distance (FID) to the generated dataset to select the highest-quality images. We then distribute varying percentages (25%, 50%, 75%, 100%) of this new data into the minority classes of the original dataset. Our data distribution strategies involve incorporating specific amounts of (1) augmented data, (2) generated data, and (3) a combination of both augmented and generated data to achieve target percentages (T.P) in the resulting dataset. Our experiments focus on classifying olive diseases into seven distinct categories using a pre-trained Convolutional Neural Network (CNN) architecture. We observe significant improvements in the model’s performance, particularly in the accurate classification of minority classes. This approach enhances diagnostic accuracy and optimizes data distribution, which is crucial for effectively addressing the challenges posed by minority classes.
深度学习模型在各种任务中取得了显著的成功,尤其是在分类方面。这种成功在植物病害的精确分类方面尤为明显,这对有效的农业管理至关重要。然而,精确分类也面临着挑战,尤其是在数据收集过程中,某些类别(即少数类别)的代表性不足。这个问题会严重影响模型性能。为了应对这一挑战,本文介绍了一种不同于现有方法的新方法。我们专注于解决基于图像的分类任务中的少数类别问题,尤其是针对橄榄疾病的分类任务。我们采用数据生成方法(包括基本转换)生成增强数据,并利用深度卷积生成对抗网络(DCGAN)生成生成数据。接下来,我们对生成的数据集应用弗雷谢特起始距离(FID)来选择最高质量的图像。然后,我们将这些新数据的不同比例(25%、50%、75%、100%)分配到原始数据集的少数类别中。我们的数据分布策略包括将特定数量的 (1) 增强数据、(2) 生成数据和 (3) 增强数据与生成数据相结合,以在生成的数据集中实现目标百分比 (T.P)。我们的实验重点是使用预先训练好的卷积神经网络(CNN)架构将橄榄疾病分为七个不同的类别。我们观察到该模型的性能有了明显改善,尤其是在准确分类少数群体类别方面。这种方法提高了诊断准确性并优化了数据分布,这对于有效应对少数群体带来的挑战至关重要。
{"title":"Positive discrimination of minority classes through data generation and distribution: A case study in olive disease classification","authors":"Hicham El Akhal,&nbsp;Aissa Ben Yahya,&nbsp;Abdelbaki El Belrhiti El Alaoui","doi":"10.1016/j.engappai.2024.109646","DOIUrl":"10.1016/j.engappai.2024.109646","url":null,"abstract":"<div><div>Deep learning models have achieved remarkable success in various tasks, especially in classification. This success is particularly evident in the precise classification of plant diseases, which is crucial for effective agricultural management. However, accurate classification faces challenges, particularly in data collection, where certain classes are underrepresented, namely the minority classes. This issue can significantly impact model performance. To tackle this challenge, this paper introduces a novel methodology that differs from existing approaches. We focus on addressing the issue of minority classes in image-based classification tasks, particularly for olive diseases. We employ data generation methods, including basic transformations, to produce augmented data and utilize Deep Convolutional Generative Adversarial Networks (DCGAN) to produce generated data. Next, we apply the Frechet Inception Distance (FID) to the generated dataset to select the highest-quality images. We then distribute varying percentages (25%, 50%, 75%, 100%) of this new data into the minority classes of the original dataset. Our data distribution strategies involve incorporating specific amounts of (1) augmented data, (2) generated data, and (3) a combination of both augmented and generated data to achieve target percentages (T.P) in the resulting dataset. Our experiments focus on classifying olive diseases into seven distinct categories using a pre-trained Convolutional Neural Network (CNN) architecture. We observe significant improvements in the model’s performance, particularly in the accurate classification of minority classes. This approach enhances diagnostic accuracy and optimizes data distribution, which is crucial for effectively addressing the challenges posed by minority classes.</div></div>","PeriodicalId":50523,"journal":{"name":"Engineering Applications of Artificial Intelligence","volume":"139 ","pages":"Article 109646"},"PeriodicalIF":7.5,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142720766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Engineering Applications of Artificial 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.
×
引用
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