首页 > 最新文献

Expert Systems最新文献

英文 中文
Automatic cross- and multi-lingual recognition of dysphonia by ensemble classification using deep speaker embedding models 利用深度扬声器嵌入模型进行集合分类,自动识别跨语言和多语言发音障碍
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-12 DOI: 10.1111/exsy.13660
Dosti Aziz, Dávid Sztahó

Machine Learning (ML) algorithms have demonstrated remarkable performance in dysphonia detection using speech samples. However, their efficacy often diminishes when tested on languages different from the training data, raising questions about their suitability in clinical settings. This study aims to develop a robust method for cross- and multi-lingual dysphonia detection that overcomes the limitation of language dependency in existing ML methods. We propose an innovative approach that leverages speech embeddings from speaker verification models, especially ECAPA and x-vector and employs a majority voting ensemble classifier. We utilize speech features extracted from ECAPA and x-vector embeddings to train three distinct classifiers. The significant advantage of these embedding models lies in their capability to capture speaker characteristics in a language-independent manner, forming fixed-dimensional feature spaces. Additionally, we investigate the impact of generating synthetic data within the embedding feature space using the Synthetic Minority Oversampling Technique (SMOTE). Our experimental results unveil the effectiveness of the proposed method for dysphonia detection. Compared to results obtained from x-vector embeddings, ECAPA consistently demonstrates superior performance in distinguishing between healthy and dysphonic speech, achieving accuracy values of 93.33% and 96.55% in both cross-lingual and multi-lingual scenarios, respectively. This highlights the remarkable capabilities of speaker verification models, especially ECAPA, in capturing language-independent features that enhance overall detection performance. The proposed method effectively addresses the challenges of language dependency in dysphonia detection. ECAPA embeddings, combined with majority voting ensemble classifiers, show significant potential for improving the accuracy and reliability of dysphonia detection in cross- and multi-lingual scenarios.

机器学习(ML)算法在使用语音样本进行发音障碍检测方面表现出色。然而,当在与训练数据不同的语言上进行测试时,这些算法的功效往往会减弱,从而引发了这些算法在临床环境中是否适用的问题。本研究旨在开发一种稳健的跨语言和多语言发音障碍检测方法,以克服现有 ML 方法中语言依赖性的限制。我们提出了一种创新方法,利用说话人验证模型(尤其是 ECAPA 和 x-vector)中的语音嵌入,并采用多数投票集合分类器。我们利用从 ECAPA 和 x-vector 嵌入中提取的语音特征来训练三种不同的分类器。这些嵌入模型的显著优势在于它们能够以与语言无关的方式捕捉说话者的特征,形成固定维度的特征空间。此外,我们还利用合成少数群体过采样技术(SMOTE)研究了在嵌入特征空间内生成合成数据的影响。我们的实验结果揭示了所提方法在发音障碍检测中的有效性。与 x 向量嵌入的结果相比,ECAPA 在区分健康语音和发音障碍语音方面始终表现出卓越的性能,在跨语言和多语言场景中的准确率分别达到 93.33% 和 96.55%。这凸显了说话人验证模型,尤其是 ECAPA,在捕捉语言无关特征以提高整体检测性能方面的卓越能力。所提出的方法有效地解决了发音障碍检测中语言依赖性的难题。ECAPA 嵌入与多数投票集合分类器相结合,在提高跨语言和多语言场景中发音障碍检测的准确性和可靠性方面显示出巨大的潜力。
{"title":"Automatic cross- and multi-lingual recognition of dysphonia by ensemble classification using deep speaker embedding models","authors":"Dosti Aziz,&nbsp;Dávid Sztahó","doi":"10.1111/exsy.13660","DOIUrl":"10.1111/exsy.13660","url":null,"abstract":"<p>Machine Learning (ML) algorithms have demonstrated remarkable performance in dysphonia detection using speech samples. However, their efficacy often diminishes when tested on languages different from the training data, raising questions about their suitability in clinical settings. This study aims to develop a robust method for cross- and multi-lingual dysphonia detection that overcomes the limitation of language dependency in existing ML methods. We propose an innovative approach that leverages speech embeddings from speaker verification models, especially ECAPA and x-vector and employs a majority voting ensemble classifier. We utilize speech features extracted from ECAPA and x-vector embeddings to train three distinct classifiers. The significant advantage of these embedding models lies in their capability to capture speaker characteristics in a language-independent manner, forming fixed-dimensional feature spaces. Additionally, we investigate the impact of generating synthetic data within the embedding feature space using the Synthetic Minority Oversampling Technique (SMOTE). Our experimental results unveil the effectiveness of the proposed method for dysphonia detection. Compared to results obtained from x-vector embeddings, ECAPA consistently demonstrates superior performance in distinguishing between healthy and dysphonic speech, achieving accuracy values of 93.33% and 96.55% in both cross-lingual and multi-lingual scenarios, respectively. This highlights the remarkable capabilities of speaker verification models, especially ECAPA, in capturing language-independent features that enhance overall detection performance. The proposed method effectively addresses the challenges of language dependency in dysphonia detection. ECAPA embeddings, combined with majority voting ensemble classifiers, show significant potential for improving the accuracy and reliability of dysphonia detection in cross- and multi-lingual scenarios.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.13660","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141353066","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
The hierarchical importance of patent's characteristics to licensing: An analysis through Random Forest 专利特征对许可的等级重要性:随机森林分析
IF 3.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-06-12 DOI: 10.1111/exsy.13661
Alexânder Araújo Reis, Rafael Ângelo Santos Leite, Cícero Eduardo Walter, Igor Bezerra Reis, Ramiro Gonçalves, J. Martins, Frederico Branco, M. Au‐Yong‐Oliveira
The purpose of this study is to ascertain the hierarchical importance of a patent's characteristics to licensing. This research has a causal‐exploratory purpose, in that it sought to establish relationships between variables. This research aims to identify which characteristics are influential in the licensing of Brazilian academic patents in the biotechnology and pharmaceutical technology fields, based on the mining of data contained in licensed and unlicensed patent documents. Which characteristics of Brazilian academic patents are most influential in their licensing potential? An analysis through Random Forest was performed. To the best of our knowledge, there are no studies in Brazil using machine learning to identify which characteristics are influential in licensing a particular academic patent, especially given the difficulty of gathering this information. We found that regardless of the measure used, the three most critical licensing characteristics for the Biotechnology and Pharmaceutical patents analysed are Patent Scope, Life Cycle, and Claims. At the same time, the least important is the Patent Cooperation Treaty. The relevance of this research is based on the fact that after identifying which intrinsic characteristics influence the final value and licensing probabilities of a given patent, it will be possible to develop mathematical models that provide accurate information for establishing technology transfer agreements. In practical terms, the results suggest that greater patent versatility, combined with lifecycle management and a technical effort to build strong claims, increases the licensing potential of academic biopharmaceutical patents.
本研究的目的是确定专利特征对许可的等级重要性。本研究具有因果探索目的,即寻求建立变量之间的关系。本研究旨在通过挖掘已授权和未授权专利文件中的数据,确定哪些特征对巴西生物技术和制药技术领域的学术专利授权有影响。巴西学术专利的哪些特征对其许可潜力影响最大?我们通过随机森林进行了分析。据我们所知,巴西还没有研究利用机器学习来确定哪些特征对某项学术专利的授权有影响,特别是考虑到收集这些信息的难度。我们发现,无论使用哪种测量方法,对于所分析的生物技术和制药专利而言,最关键的三个许可特征是专利范围、生命周期和权利要求。同时,最不重要的是《专利合作条约》。这项研究的意义在于,在确定哪些内在特征会影响特定专利的最终价值和许可概率后,就有可能建立数学模型,为制定技术转让协议提供准确的信息。在实际应用中,研究结果表明,提高专利的通用性,结合生命周期管理和建立强有力权利要求的技术努力,可以提高学术生物制药专利的许可潜力。
{"title":"The hierarchical importance of patent's characteristics to licensing: An analysis through Random Forest","authors":"Alexânder Araújo Reis, Rafael Ângelo Santos Leite, Cícero Eduardo Walter, Igor Bezerra Reis, Ramiro Gonçalves, J. Martins, Frederico Branco, M. Au‐Yong‐Oliveira","doi":"10.1111/exsy.13661","DOIUrl":"https://doi.org/10.1111/exsy.13661","url":null,"abstract":"The purpose of this study is to ascertain the hierarchical importance of a patent's characteristics to licensing. This research has a causal‐exploratory purpose, in that it sought to establish relationships between variables. This research aims to identify which characteristics are influential in the licensing of Brazilian academic patents in the biotechnology and pharmaceutical technology fields, based on the mining of data contained in licensed and unlicensed patent documents. Which characteristics of Brazilian academic patents are most influential in their licensing potential? An analysis through Random Forest was performed. To the best of our knowledge, there are no studies in Brazil using machine learning to identify which characteristics are influential in licensing a particular academic patent, especially given the difficulty of gathering this information. We found that regardless of the measure used, the three most critical licensing characteristics for the Biotechnology and Pharmaceutical patents analysed are Patent Scope, Life Cycle, and Claims. At the same time, the least important is the Patent Cooperation Treaty. The relevance of this research is based on the fact that after identifying which intrinsic characteristics influence the final value and licensing probabilities of a given patent, it will be possible to develop mathematical models that provide accurate information for establishing technology transfer agreements. In practical terms, the results suggest that greater patent versatility, combined with lifecycle management and a technical effort to build strong claims, increases the licensing potential of academic biopharmaceutical patents.","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141350319","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Privacy preserving security using multi‐key homomorphic encryption for face recognition 使用多密钥同态加密技术保护人脸识别隐私安全
IF 3.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-06-11 DOI: 10.1111/exsy.13645
Jing Wang, Rundong Xin, Osama Alfarraj, Amr M. Tolba, Qitao Tang
Recently, face recognition based on homomorphic encryption for privacy preservation has garnered significant attention. However, there are two major challenges with homomorphic encryption methods: the security and efficiency of face recognition systems. We present a more efficient and secure PUM (Privacy preserving security Using Multi‐key homomorphic encryption) mechanism for facial recognition. By integrating feature grouping with parallel computing, we enhance the efficiency of homomorphic operations. The use of multi‐key encryption ensures the security of the facial recognition system. This approach improves the security and speed of facial recognition systems in cloud computing scenarios, increasing the original 128‐bit security to a maximum of 1664‐bit security. In terms of efficiency, comparing encrypted images takes only 0.302 s, with an accuracy rate of 99.425%. When applied to a campus scenario, the average search time for a facial template library containing 700 encrypted features is approximately 1.5 s. Consequently, our solution not only ensures user privacy but also demonstrates superior operational efficiency and practical value. In comparison to recently emerged ciphertext facial recognition systems, our solution has demonstrated notable enhancements in both security and time efficiency.
最近,基于同态加密以保护隐私的人脸识别技术备受关注。然而,同态加密方法面临两大挑战:人脸识别系统的安全性和效率。我们提出了一种更高效、更安全的 PUM(使用多密钥同态加密的隐私保护安全)人脸识别机制。通过将特征分组与并行计算相结合,我们提高了同态运算的效率。多密钥加密的使用确保了面部识别系统的安全性。这种方法提高了云计算场景下人脸识别系统的安全性和速度,将原来的 128 位安全性提高到最高 1664 位安全性。在效率方面,比较加密图像仅需 0.302 秒,准确率高达 99.425%。应用于校园场景时,包含 700 个加密特征的面部模板库的平均搜索时间约为 1.5 秒。因此,我们的解决方案不仅能确保用户隐私,还具有卓越的运行效率和实用价值。与最近出现的密码文本面部识别系统相比,我们的解决方案在安全性和时间效率方面都有显著提高。
{"title":"Privacy preserving security using multi‐key homomorphic encryption for face recognition","authors":"Jing Wang, Rundong Xin, Osama Alfarraj, Amr M. Tolba, Qitao Tang","doi":"10.1111/exsy.13645","DOIUrl":"https://doi.org/10.1111/exsy.13645","url":null,"abstract":"Recently, face recognition based on homomorphic encryption for privacy preservation has garnered significant attention. However, there are two major challenges with homomorphic encryption methods: the security and efficiency of face recognition systems. We present a more efficient and secure PUM (Privacy preserving security Using Multi‐key homomorphic encryption) mechanism for facial recognition. By integrating feature grouping with parallel computing, we enhance the efficiency of homomorphic operations. The use of multi‐key encryption ensures the security of the facial recognition system. This approach improves the security and speed of facial recognition systems in cloud computing scenarios, increasing the original 128‐bit security to a maximum of 1664‐bit security. In terms of efficiency, comparing encrypted images takes only 0.302 s, with an accuracy rate of 99.425%. When applied to a campus scenario, the average search time for a facial template library containing 700 encrypted features is approximately 1.5 s. Consequently, our solution not only ensures user privacy but also demonstrates superior operational efficiency and practical value. In comparison to recently emerged ciphertext facial recognition systems, our solution has demonstrated notable enhancements in both security and time efficiency.","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141355158","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A supervised learning tool for heatwave predictions using daily high summer temperatures 利用夏季日最高气温预测热浪的监督学习工具
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-11 DOI: 10.1111/exsy.13656
Gazi Md Daud Iqbal, Jay Rosenberger, Matthew Rosenberger, Muhammad Shah Alam, Lidan Ha, Emmanuel Anoruo, Sadie Gregory, Tom Mazzone

Global temperature is increasing at an alarming rate, which increases the number of heatwaves. Heatwaves have significant impacts, both directly and indirectly, on human and natural systems and can create considerable risk to public health. Predicting the occurrence of a heatwave can save lives, increase the production of crops, improve water quality, and reduce transportation restrictions. Because of its geographical location, Bangladesh is particularly vulnerable to cyclones, droughts, earthquakes, floods, and heatwaves. The Bangladesh Meteorological Department collects temperature data at multiple weather stations, and we use data from 10 weather stations in this research. Data show that most heatwaves occur in the summer months, namely, April, May, and June. In this research, we develop Classification and Regression Tree (CART) models that use daily temperature data for the months of March, April, May, and June to predict the likelihood of a heatwave within the next 7 days, the next 28 days, and on any particular day based on daily high temperatures from the previous 14 days. We also use different model parameters to evaluate the accuracy of the models. Finally, we develop treed Stepwise Logistic Regression models to predict the probability of heatwaves occurring. Even though this research uses data from Bangladesh Meteorological Department, the developed modeling approach can be used in other geographic regions.

全球气温正在以惊人的速度上升,这增加了热浪的次数。热浪对人类和自然系统产生直接和间接的重大影响,并可能对公众健康造成相当大的风险。预测热浪的发生可以挽救生命、提高农作物产量、改善水质和减少交通限制。由于其地理位置,孟加拉国特别容易受到气旋、干旱、地震、洪水和热浪的影响。孟加拉国气象局在多个气象站收集气温数据,我们在本研究中使用了 10 个气象站的数据。数据显示,大多数热浪发生在夏季,即 4 月、5 月和 6 月。在这项研究中,我们利用 3 月、4 月、5 月和 6 月的日气温数据开发了分类和回归树 (CART) 模型,根据前 14 天的日最高气温预测未来 7 天、未来 28 天和任何一天出现热浪的可能性。我们还使用不同的模型参数来评估模型的准确性。最后,我们建立了有树逐步逻辑回归模型来预测热浪发生的概率。尽管这项研究使用的是孟加拉国气象局的数据,但所开发的建模方法可用于其他地理区域。
{"title":"A supervised learning tool for heatwave predictions using daily high summer temperatures","authors":"Gazi Md Daud Iqbal,&nbsp;Jay Rosenberger,&nbsp;Matthew Rosenberger,&nbsp;Muhammad Shah Alam,&nbsp;Lidan Ha,&nbsp;Emmanuel Anoruo,&nbsp;Sadie Gregory,&nbsp;Tom Mazzone","doi":"10.1111/exsy.13656","DOIUrl":"10.1111/exsy.13656","url":null,"abstract":"<p>Global temperature is increasing at an alarming rate, which increases the number of heatwaves. Heatwaves have significant impacts, both directly and indirectly, on human and natural systems and can create considerable risk to public health. Predicting the occurrence of a heatwave can save lives, increase the production of crops, improve water quality, and reduce transportation restrictions. Because of its geographical location, Bangladesh is particularly vulnerable to cyclones, droughts, earthquakes, floods, and heatwaves. The Bangladesh Meteorological Department collects temperature data at multiple weather stations, and we use data from 10 weather stations in this research. Data show that most heatwaves occur in the summer months, namely, April, May, and June. In this research, we develop Classification and Regression Tree (CART) models that use daily temperature data for the months of March, April, May, and June to predict the likelihood of a heatwave within the next 7 days, the next 28 days, and on any particular day based on daily high temperatures from the previous 14 days. We also use different model parameters to evaluate the accuracy of the models. Finally, we develop treed Stepwise Logistic Regression models to predict the probability of heatwaves occurring. Even though this research uses data from Bangladesh Meteorological Department, the developed modeling approach can be used in other geographic regions.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141359427","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
When geoscience meets generative AI and large language models: Foundations, trends, and future challenges 当地球科学遇上生成式人工智能和大型语言模型:基础、趋势和未来挑战
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-11 DOI: 10.1111/exsy.13654
Abdenour Hadid, Tanujit Chakraborty, Daniel Busby

Generative Artificial Intelligence (GAI) represents an emerging field that promises the creation of synthetic data and outputs in different modalities. GAI has recently shown impressive results across a large spectrum of applications ranging from biology, medicine, education, legislation, computer science, and finance. As one strives for enhanced safety, efficiency, and sustainability, generative AI indeed emerges as a key differentiator and promises a paradigm shift in the field. This article explores the potential applications of generative AI and large language models in geoscience. The recent developments in the field of machine learning and deep learning have enabled the generative model's utility for tackling diverse prediction problems, simulation, and multi-criteria decision-making challenges related to geoscience and Earth system dynamics. This survey discusses several GAI models that have been used in geoscience comprising generative adversarial networks (GANs), physics-informed neural networks (PINNs), and generative pre-trained transformer (GPT)-based structures. These tools have helped the geoscience community in several applications, including (but not limited to) data generation/augmentation, super-resolution, panchromatic sharpening, haze removal, restoration, and land surface changing. Some challenges still remain, such as ensuring physical interpretation, nefarious use cases, and trustworthiness. Beyond that, GAI models show promises to the geoscience community, especially with the support to climate change, urban science, atmospheric science, marine science, and planetary science through their extraordinary ability to data-driven modelling and uncertainty quantification.

生成式人工智能(GAI)是一个新兴领域,有望以不同方式创建合成数据和输出结果。最近,GAI 在生物学、医学、教育、立法、计算机科学和金融等众多应用领域都取得了令人瞩目的成果。在人们努力提高安全性、效率和可持续性的过程中,生成式人工智能确实成为一个关键的差异化因素,并有望实现该领域的范式转变。本文探讨了生成式人工智能和大型语言模型在地球科学领域的潜在应用。机器学习和深度学习领域的最新发展使生成模型在应对与地球科学和地球系统动力学相关的各种预测问题、模拟和多标准决策挑战方面大显身手。本研究讨论了地质科学中使用的几种 GAI 模型,包括生成对抗网络(GAN)、物理信息神经网络(PINN)和基于生成预训练变换器(GPT)的结构。这些工具在多个应用领域为地球科学界提供了帮助,包括(但不限于)数据生成/增强、超分辨率、全色锐化、雾霾消除、恢复和地表变化。一些挑战依然存在,如确保物理解释、邪恶用例和可信度。除此之外,GAI 模型通过其数据驱动建模和不确定性量化的非凡能力,为地球科学界展示了前景,尤其是对气候变化、城市科学、大气科学、海洋科学和行星科学的支持。
{"title":"When geoscience meets generative AI and large language models: Foundations, trends, and future challenges","authors":"Abdenour Hadid,&nbsp;Tanujit Chakraborty,&nbsp;Daniel Busby","doi":"10.1111/exsy.13654","DOIUrl":"https://doi.org/10.1111/exsy.13654","url":null,"abstract":"<p>Generative Artificial Intelligence (GAI) represents an emerging field that promises the creation of synthetic data and outputs in different modalities. GAI has recently shown impressive results across a large spectrum of applications ranging from biology, medicine, education, legislation, computer science, and finance. As one strives for enhanced safety, efficiency, and sustainability, generative AI indeed emerges as a key differentiator and promises a paradigm shift in the field. This article explores the potential applications of generative AI and large language models in geoscience. The recent developments in the field of machine learning and deep learning have enabled the generative model's utility for tackling diverse prediction problems, simulation, and multi-criteria decision-making challenges related to geoscience and Earth system dynamics. This survey discusses several GAI models that have been used in geoscience comprising generative adversarial networks (GANs), physics-informed neural networks (PINNs), and generative pre-trained transformer (GPT)-based structures. These tools have helped the geoscience community in several applications, including (but not limited to) data generation/augmentation, super-resolution, panchromatic sharpening, haze removal, restoration, and land surface changing. Some challenges still remain, such as ensuring physical interpretation, nefarious use cases, and trustworthiness. Beyond that, GAI models show promises to the geoscience community, especially with the support to climate change, urban science, atmospheric science, marine science, and planetary science through their extraordinary ability to data-driven modelling and uncertainty quantification.</p>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1111/exsy.13654","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142165757","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-model deep learning system for screening human monkeypox using skin images 利用皮肤图像筛查人类猴痘的多模型深度学习系统
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-09 DOI: 10.1111/exsy.13651
Kapil Gupta, Varun Bajaj, Deepak Kumar Jain, Amir Hussain

Purpose

Human monkeypox (MPX) is a viral infection that transmits between individuals via direct contact with animals, bodily fluids, respiratory droplets, and contaminated objects like bedding. Traditional manual screening for the MPX infection is a time-consuming process prone to human error. Therefore, a computer-aided MPX screening approach utilizing skin lesion images to enhance clinical performance and alleviate the workload of healthcare providers is needed. The primary objective of this work is to devise an expert system that accurately classifies MPX images for the automatic detection of MPX subjects.

Methods

This work presents a multi-modal deep learning system through the fusion of convolutional neural network (CNN) and machine learning algorithms, which effectively and autonomously detect MPX-infected subjects using skin lesion images. The proposed framework, termed MPXCN-Net is developed by fusing deep features of three pre-trained CNNs: MobileNetV2, DarkNet19, and ResNet18. Three classifiers—K-nearest neighbour, support vector machine (SVM), and ensemble classifier—with various kernel functions, are used to identify infected patients. To validate the efficacy of our proposed system, we employ a publicly accessible MPX skin lesion dataset.

Results

By amalgamating features extracted from all three CNNs and utilizing the medium Gaussian kernel of the SVM classifier, our proposed system achieves an outstanding average classification accuracy of 90.4%.

Conclusions

Developed MPXCN-Net is suitable for testing with a large diversified dataset before being used in clinical settings.

人猴痘(MPX)是一种病毒感染,通过与动物、体液、呼吸道飞沫和被褥等污染物品的直接接触在人与人之间传播。传统的 MPX 感染人工筛查过程耗时,容易出现人为错误。因此,需要一种利用皮损图像的计算机辅助 MPX 筛查方法来提高临床效果,减轻医护人员的工作量。这项工作的主要目标是设计一种专家系统,对 MPX 图像进行准确分类,以便自动检测 MPX 受试者。这项工作通过融合卷积神经网络(CNN)和机器学习算法,提出了一种多模态深度学习系统,该系统可利用皮损图像有效、自主地检测 MPX 感染受试者。所提出的框架被称为 MPXCN-Net,是通过融合三个预先训练好的 CNN 的深度特征而开发的:MobileNetV2、DarkNet19 和 ResNet18。三种分类器--K-近邻分类器、支持向量机(SVM)和集合分类器--具有不同的核函数,用于识别感染患者。为了验证我们提出的系统的有效性,我们采用了一个可公开访问的 MPX 皮肤病变数据集。通过合并从所有三个 CNN 提取的特征并利用 SVM 分类器的中等高斯核,我们提出的系统达到了 90.4% 的出色平均分类准确率。
{"title":"Multi-model deep learning system for screening human monkeypox using skin images","authors":"Kapil Gupta,&nbsp;Varun Bajaj,&nbsp;Deepak Kumar Jain,&nbsp;Amir Hussain","doi":"10.1111/exsy.13651","DOIUrl":"10.1111/exsy.13651","url":null,"abstract":"<div>\u0000 \u0000 \u0000 <section>\u0000 \u0000 <h3> Purpose</h3>\u0000 \u0000 <p>Human monkeypox (MPX) is a viral infection that transmits between individuals via direct contact with animals, bodily fluids, respiratory droplets, and contaminated objects like bedding. Traditional manual screening for the MPX infection is a time-consuming process prone to human error. Therefore, a computer-aided MPX screening approach utilizing skin lesion images to enhance clinical performance and alleviate the workload of healthcare providers is needed. The primary objective of this work is to devise an expert system that accurately classifies MPX images for the automatic detection of MPX subjects.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Methods</h3>\u0000 \u0000 <p>This work presents a multi-modal deep learning system through the fusion of convolutional neural network (CNN) and machine learning algorithms, which effectively and autonomously detect MPX-infected subjects using skin lesion images. The proposed framework, termed MPXCN-Net is developed by fusing deep features of three pre-trained CNNs: MobileNetV2, DarkNet19, and ResNet18. Three classifiers—K-nearest neighbour, support vector machine (SVM), and ensemble classifier—with various kernel functions, are used to identify infected patients. To validate the efficacy of our proposed system, we employ a publicly accessible MPX skin lesion dataset.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Results</h3>\u0000 \u0000 <p>By amalgamating features extracted from all three CNNs and utilizing the medium Gaussian kernel of the SVM classifier, our proposed system achieves an outstanding average classification accuracy of 90.4%.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Conclusions</h3>\u0000 \u0000 <p>Developed MPXCN-Net is suitable for testing with a large diversified dataset before being used in clinical settings.</p>\u0000 </section>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141367458","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Deep learning based brain tumour architecture for weight sharing optimization in federated learning 在联合学习中优化权重共享的基于深度学习的脑肿瘤架构
IF 3.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-06-06 DOI: 10.1111/exsy.13643
Ameer N. Onaizah, Yuanqing Xia, Ahmed J. Obaid, Khurram Hussain
Large amounts of data is necessary for deep learning models to semantically segment images. A major issue in the field of medical imaging is accumulating adequate data and then applying specialized skills to label those medical imaging data. Collaboration across institutions might be able to alleviate this problem, but sharing medical data to a centralized place is complicated due to legal, privacy, technical, and data ownership constraints, particularly among international institutions. By guaranteeing user privacy and preventing unauthorized access to raw data, Federated Learning plays a significant role especially in decentralized deep learning applications. Each client is given a unique learning process assignment. Clients first train a machine learning model locally using data from their area. Then, clients upload training data (local updates of model weights and biases) to a server. After that, the server compiles client‐provided updates to build a global learning model. Due to the numerous parameters (weights and biases) employed by deep learning models, the constant transmission between clients and the server raises communication costs and is inefficient from the standpoint of resource use. When there are more contributing clients and communication rounds, the cost of communication becomes a bigger concern. In this paper, a novel federated learning with weight sharing optimization compression architecture FedWSOcomp is proposed for cross institutional collaboration. In FedWSOcomp, the weights from deep learning models between clients and servers help in considerably reducing the amount of updates. Top‐z sparsification, quantization with clustering, and compression with three separate encoding techniques are all implemented by FedWSOcomp. Modern compression techniques are outperformed by FedWSOcomp, which achieves compression rates of up to 1085× while saving up to 99% of bandwidth and 99% of energy for clients during communication.
深度学习模型需要大量数据才能对图像进行语义分割。医学影像领域的一个主要问题是积累足够的数据,然后运用专业技能为这些医学影像数据贴标签。跨机构合作或许能缓解这一问题,但由于法律、隐私、技术和数据所有权方面的限制,尤其是国际机构之间的限制,将医疗数据共享到一个集中的地方非常复杂。通过保证用户隐私和防止未经授权访问原始数据,联邦学习(Federated Learning)尤其在分散式深度学习应用中发挥着重要作用。每个客户端都有一个独特的学习过程任务。客户端首先使用其所在区域的数据在本地训练机器学习模型。然后,客户端将训练数据(模型权重和偏置的本地更新)上传到服务器。之后,服务器对客户提供的更新进行编译,以建立全局学习模型。由于深度学习模型使用了大量参数(权重和偏置),客户端和服务器之间的持续传输会增加通信成本,从资源使用的角度来看效率低下。当贡献的客户端和通信轮数较多时,通信成本就会成为一个更大的问题。本文为跨机构协作提出了一种新颖的联合学习与权重共享优化压缩架构 FedWSOcomp。在 FedWSOcomp 中,客户端和服务器之间深度学习模型的权重有助于大大减少更新量。FedWSOcomp 实现了 Top-z 稀疏化、带聚类的量化和三种独立编码技术的压缩。FedWSOcomp 的性能优于现代压缩技术,其压缩率高达 1085 倍,同时在通信过程中为客户端节省了高达 99% 的带宽和 99% 的能源。
{"title":"Deep learning based brain tumour architecture for weight sharing optimization in federated learning","authors":"Ameer N. Onaizah, Yuanqing Xia, Ahmed J. Obaid, Khurram Hussain","doi":"10.1111/exsy.13643","DOIUrl":"https://doi.org/10.1111/exsy.13643","url":null,"abstract":"Large amounts of data is necessary for deep learning models to semantically segment images. A major issue in the field of medical imaging is accumulating adequate data and then applying specialized skills to label those medical imaging data. Collaboration across institutions might be able to alleviate this problem, but sharing medical data to a centralized place is complicated due to legal, privacy, technical, and data ownership constraints, particularly among international institutions. By guaranteeing user privacy and preventing unauthorized access to raw data, Federated Learning plays a significant role especially in decentralized deep learning applications. Each client is given a unique learning process assignment. Clients first train a machine learning model locally using data from their area. Then, clients upload training data (local updates of model weights and biases) to a server. After that, the server compiles client‐provided updates to build a global learning model. Due to the numerous parameters (weights and biases) employed by deep learning models, the constant transmission between clients and the server raises communication costs and is inefficient from the standpoint of resource use. When there are more contributing clients and communication rounds, the cost of communication becomes a bigger concern. In this paper, a novel federated learning with weight sharing optimization compression architecture FedWSOcomp is proposed for cross institutional collaboration. In FedWSOcomp, the weights from deep learning models between clients and servers help in considerably reducing the amount of updates. Top‐z sparsification, quantization with clustering, and compression with three separate encoding techniques are all implemented by FedWSOcomp. Modern compression techniques are outperformed by FedWSOcomp, which achieves compression rates of up to 1085× while saving up to 99% of bandwidth and 99% of energy for clients during communication.","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141381699","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Enhancing depression detection: A multimodal approach with text extension and content fusion 加强抑郁症检测:采用文本扩展和内容融合的多模态方法
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-04 DOI: 10.1111/exsy.13616
Jinyan Chen, Shuxian Liu, Meijia Xu, Peicheng Wang

Background

With ubiquitous social media platforms, people express their thoughts and emotions, making social media data valuable for studying and detecting depression symptoms.

Objective

First, we detect depression by leveraging textual, visual, and auxiliary features from the Weibo social media platform. Second, we aim to comprehend the reasons behind the model's results, particularly in medicine, where trust is crucial.

Methods

To address challenges such as varying text lengths and abundant social media data, we employ a text extension technique to standardize text length, enhancing model robustness and semantic feature learning accuracy. We utilize tree-long short-term memory and bidirectional gate recurrent unit models to capture long-term and short-term dependencies in text data, respectively. To extract emotional features from images, the integration of optical character recognition (OCR) technology with an emotion lexicon is employed, addressing the limitations of OCR technology in accuracy when dealing with complex or blurred text. In addition, auxiliary features based on social behaviour are introduced. These modalities’ output features are fed into an attention fusion network for effective depression indicators.

Results

Extensive experiments validate our methodology, showing a precision of 0.987 and recall rate of 0.97 in depression detection tasks.

Conclusions

By leveraging text, images, and auxiliary features from Weibo, we develop text picture sentiment auxiliary (TPSA), a novel depression detection model. we ascertained that the emotional features extracted from images and text play a pivotal role in depression detection, providing valuable insights for the detection and assessment of the psychological disorder.

通过无处不在的社交媒体平台,人们可以表达自己的想法和情绪,这使得社交媒体数据在研究和检测抑郁症状方面具有重要价值。首先,我们利用微博社交媒体平台的文本、视觉和辅助特征来检测抑郁症。其次,我们旨在理解模型结果背后的原因,特别是在医学领域,信任是至关重要的。为了应对文本长度不一和社交媒体数据丰富等挑战,我们采用了文本扩展技术来标准化文本长度,从而提高模型的鲁棒性和语义特征学习的准确性。我们利用树状长短期记忆模型和双向门递归单元模型分别捕捉文本数据中的长期和短期依赖关系。为了从图像中提取情感特征,我们采用了将光学字符识别(OCR)技术与情感词典相结合的方法,以解决 OCR 技术在处理复杂或模糊文本时在准确性方面的局限性。此外,还引入了基于社会行为的辅助特征。通过利用微博中的文本、图像和辅助特征,我们开发出了文本图片情感辅助模型(TPSA)--一种新型抑郁检测模型。我们发现,从图像和文本中提取的情感特征在抑郁检测中发挥了关键作用,为心理疾病的检测和评估提供了宝贵的见解。
{"title":"Enhancing depression detection: A multimodal approach with text extension and content fusion","authors":"Jinyan Chen,&nbsp;Shuxian Liu,&nbsp;Meijia Xu,&nbsp;Peicheng Wang","doi":"10.1111/exsy.13616","DOIUrl":"10.1111/exsy.13616","url":null,"abstract":"<div>\u0000 \u0000 \u0000 <section>\u0000 \u0000 <h3> Background</h3>\u0000 \u0000 <p>With ubiquitous social media platforms, people express their thoughts and emotions, making social media data valuable for studying and detecting depression symptoms.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Objective</h3>\u0000 \u0000 <p>First, we detect depression by leveraging textual, visual, and auxiliary features from the Weibo social media platform. Second, we aim to comprehend the reasons behind the model's results, particularly in medicine, where trust is crucial.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Methods</h3>\u0000 \u0000 <p>To address challenges such as varying text lengths and abundant social media data, we employ a text extension technique to standardize text length, enhancing model robustness and semantic feature learning accuracy. We utilize tree-long short-term memory and bidirectional gate recurrent unit models to capture long-term and short-term dependencies in text data, respectively. To extract emotional features from images, the integration of optical character recognition (OCR) technology with an emotion lexicon is employed, addressing the limitations of OCR technology in accuracy when dealing with complex or blurred text. In addition, auxiliary features based on social behaviour are introduced. These modalities’ output features are fed into an attention fusion network for effective depression indicators.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Results</h3>\u0000 \u0000 <p>Extensive experiments validate our methodology, showing a precision of 0.987 and recall rate of 0.97 in depression detection tasks.</p>\u0000 </section>\u0000 \u0000 <section>\u0000 \u0000 <h3> Conclusions</h3>\u0000 \u0000 <p>By leveraging text, images, and auxiliary features from Weibo, we develop text picture sentiment auxiliary (TPSA), a novel depression detection model. we ascertained that the emotional features extracted from images and text play a pivotal role in depression detection, providing valuable insights for the detection and assessment of the psychological disorder.</p>\u0000 </section>\u0000 </div>","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141387089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Generalized hop-based approaches for identifying influential nodes in social networks 在社交网络中识别有影响力节点的基于跳数的通用方法
IF 3 4区 计算机科学 Q2 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Pub Date : 2024-06-04 DOI: 10.1111/exsy.13649
Tarun Kumer Biswas, Alireza Abbasi, Ripon Kumar Chakrabortty
<p>Locating a set of influential users within a social network, known as the Influence Maximization (IM) problem, can have significant implications for boosting the spread of positive information/news and curbing the spread of negative elements such as misinformation and disease. However, the traditional simulation-based spread computations under conventional diffusion models render existing algorithms inefficient in finding optimal solutions. In recent years, hop and path-based approaches have gained popularity, particularly under the cascade models to address the scalability issue. Nevertheless, these existing functions vary based on the considered hop-distance and provide no guidance on capturing spread sizes beyond two-hops. In this paper, we introduce Hop-based Expected Influence Maximization (HEIM), an approach utilizing generalized functions to compute influence spread across varying hop-distances in conventional diffusion models. We extend our investigation to the Linear Threshold (LT) model, in addition to the Independent Cascade (IC) and Weighted Cascade (WC) models, filling a gap in current literature. Our theoretical analysis shows that the proposed functions preserve both monotonicity and submodularity, and the proposed HEIM algorithm can achieve an approximation ratio of <span></span><math> <mrow> <mfenced> <mrow> <mn>1</mn> <mo>−</mo> <mfrac> <mn>1</mn> <mi>e</mi> </mfrac> </mrow> </mfenced> </mrow></math> under a limited hop-measures, whereas a multiplicative <span></span><math> <mrow> <mfenced> <mrow> <mfrac> <mn>1</mn> <msub> <mi>k</mi> <msub> <mi>σ</mi> <mi>h</mi> </msub> </msub> </mfrac> <mfenced> <mrow> <mn>1</mn> <mo>−</mo> <msup> <mi>e</mi> <mrow> <mo>−</mo> <msub> <mi>k</mi> <msub> <mi>σ</mi> <mi>h</mi> </msub> </msub> </mrow> </msup> </mrow> </mfenced> <mi>α</mi> </mrow> </mfenced> <
在社交网络中找到一组有影响力的用户(即影响力最大化(IM)问题),对于促进正面信息/新闻的传播以及遏制负面信息(如错误信息和疾病)的传播具有重要意义。然而,在传统的传播模型下,基于模拟的传统传播计算使得现有算法在寻找最优解时效率低下。近年来,基于跳数和路径的方法越来越受欢迎,特别是在级联模型下,以解决可扩展性问题。然而,这些现有函数根据所考虑的跳距而有所不同,并且没有为捕捉超过两跳的传播大小提供指导。在本文中,我们介绍了基于跳数的预期影响力最大化(HEIM),这是一种利用广义函数计算传统扩散模型中不同跳数距离的影响力扩散的方法。除了独立级联(IC)和加权级联(WC)模型外,我们还将研究扩展到线性阈值(LT)模型,填补了当前文献的空白。我们的理论分析表明,所提出的函数同时保留了单调性和次模性,所提出的 HEIM 算法在有限跳数度量下可以达到近似率,而在全局度量下则可以达到乘法近似率。此外,我们还证明,与现有的基于模拟的方法相比,预期传播方法可以作为一种更好的基准方法。通过在三个真实世界网络上的实验,对 HEIM 算法的性能进行了评估,并与其他六种现有算法进行了比较。结果表明,基于三跳的 HEIM 算法获得了卓越的解决方案质量,在统计测试中排名第一,而且速度明显快于现有的基准方法。相反,基于单跳的 HEIM 算法计算速度更快,但仍能提供有竞争力的解决方案,为决策者提供了基于应用需求的灵活性。
{"title":"Generalized hop-based approaches for identifying influential nodes in social networks","authors":"Tarun Kumer Biswas,&nbsp;Alireza Abbasi,&nbsp;Ripon Kumar Chakrabortty","doi":"10.1111/exsy.13649","DOIUrl":"10.1111/exsy.13649","url":null,"abstract":"&lt;p&gt;Locating a set of influential users within a social network, known as the Influence Maximization (IM) problem, can have significant implications for boosting the spread of positive information/news and curbing the spread of negative elements such as misinformation and disease. However, the traditional simulation-based spread computations under conventional diffusion models render existing algorithms inefficient in finding optimal solutions. In recent years, hop and path-based approaches have gained popularity, particularly under the cascade models to address the scalability issue. Nevertheless, these existing functions vary based on the considered hop-distance and provide no guidance on capturing spread sizes beyond two-hops. In this paper, we introduce Hop-based Expected Influence Maximization (HEIM), an approach utilizing generalized functions to compute influence spread across varying hop-distances in conventional diffusion models. We extend our investigation to the Linear Threshold (LT) model, in addition to the Independent Cascade (IC) and Weighted Cascade (WC) models, filling a gap in current literature. Our theoretical analysis shows that the proposed functions preserve both monotonicity and submodularity, and the proposed HEIM algorithm can achieve an approximation ratio of &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mfenced&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 &lt;mfrac&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;/mfrac&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mfenced&gt;\u0000 &lt;/mrow&gt;&lt;/math&gt; under a limited hop-measures, whereas a multiplicative &lt;span&gt;&lt;/span&gt;&lt;math&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mfenced&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mfrac&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;σ&lt;/mi&gt;\u0000 &lt;mi&gt;h&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mfrac&gt;\u0000 &lt;mfenced&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mn&gt;1&lt;/mn&gt;\u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 &lt;msup&gt;\u0000 &lt;mi&gt;e&lt;/mi&gt;\u0000 &lt;mrow&gt;\u0000 &lt;mo&gt;−&lt;/mo&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;k&lt;/mi&gt;\u0000 &lt;msub&gt;\u0000 &lt;mi&gt;σ&lt;/mi&gt;\u0000 &lt;mi&gt;h&lt;/mi&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/msub&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/msup&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mfenced&gt;\u0000 &lt;mi&gt;α&lt;/mi&gt;\u0000 &lt;/mrow&gt;\u0000 &lt;/mfenced&gt;\u0000 &lt;","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.0,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141387766","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Al‐based energy aware parent selection mechanism to enhance security and energy efficiency for smart homes in Internet of Things 基于 Al 的能量感知父母选择机制,提高物联网智能家居的安全性和能效
IF 3.3 4区 计算机科学 Q1 Computer Science Pub Date : 2024-06-02 DOI: 10.1111/exsy.13647
Habib Ur Rahman, Muhammad Asif Habib, Shahzad Sarwar, Awais Ahmad, Anand Paul, Yazeed Alkhrijah, Waeal J. Obidallah
The growing ubiquity of Internet of Things (IoT) devices within smart homes demands the use of advanced strategies in IoT implementation, with an emphasis on energy efficiency and security. The incorporation of Artificial Intelligence (AI) within the IoT framework improves the overall efficiency of the network. An inefficient mechanism of parent selection at the network layer of IoT causes energy drain in the nodes, particularly near the sink node. As a result, nodes die earlier, causing network holes that further increase the control message overhead as well as the energy consumption of the network, compromising network security. This research introduces an AI‐based approach to parent selection of the Routing Protocol for Low Power and Lossy networks (RPL) at the network layer of IoT to enhance security and energy efficiency. A novel objective function, named Energy and Parent Load Objective Function (EA‐EPL), is also proposed that considers the composite metrics, including energy and parent load. Extensive experiments are conducted to assess EA‐EPL against OF0 and MRHOF algorithms. Experimental results show that EA‐EPL outperformed these algorithms in improving energy efficiency, network stability, and packet delivery ratio. The results also demonstrate a significant enhancement in the overall efficiency of IoT networks and increased security in smart home environments.
智能家居中的物联网(IoT)设备越来越普遍,这就要求在实施物联网时采用先进的策略,重点是能源效率和安全性。将人工智能(AI)纳入物联网框架可提高网络的整体效率。物联网网络层低效的父节点选择机制会导致节点能量消耗,尤其是在汇节点附近。因此,节点会提前死亡,造成网络漏洞,从而进一步增加控制信息开销和网络能耗,危及网络安全。本研究介绍了一种基于人工智能的方法,用于在物联网网络层选择低功耗和低损耗网络路由协议(RPL)的父节点,以提高安全性和能效。此外,还提出了一种名为 "能量和父负载目标函数(EA-EPL)"的新目标函数,该函数考虑了包括能量和父负载在内的综合指标。为了评估 EA-EPL 与 OF0 和 MRHOF 算法的对比情况,我们进行了广泛的实验。实验结果表明,EA-EPL 在提高能源效率、网络稳定性和数据包传送率方面优于这些算法。实验结果还表明,EA-EPL 显著提高了物联网网络的整体效率,并增强了智能家居环境的安全性。
{"title":"Al‐based energy aware parent selection mechanism to enhance security and energy efficiency for smart homes in Internet of Things","authors":"Habib Ur Rahman, Muhammad Asif Habib, Shahzad Sarwar, Awais Ahmad, Anand Paul, Yazeed Alkhrijah, Waeal J. Obidallah","doi":"10.1111/exsy.13647","DOIUrl":"https://doi.org/10.1111/exsy.13647","url":null,"abstract":"The growing ubiquity of Internet of Things (IoT) devices within smart homes demands the use of advanced strategies in IoT implementation, with an emphasis on energy efficiency and security. The incorporation of Artificial Intelligence (AI) within the IoT framework improves the overall efficiency of the network. An inefficient mechanism of parent selection at the network layer of IoT causes energy drain in the nodes, particularly near the sink node. As a result, nodes die earlier, causing network holes that further increase the control message overhead as well as the energy consumption of the network, compromising network security. This research introduces an AI‐based approach to parent selection of the Routing Protocol for Low Power and Lossy networks (RPL) at the network layer of IoT to enhance security and energy efficiency. A novel objective function, named Energy and Parent Load Objective Function (EA‐EPL), is also proposed that considers the composite metrics, including energy and parent load. Extensive experiments are conducted to assess EA‐EPL against OF0 and MRHOF algorithms. Experimental results show that EA‐EPL outperformed these algorithms in improving energy efficiency, network stability, and packet delivery ratio. The results also demonstrate a significant enhancement in the overall efficiency of IoT networks and increased security in smart home environments.","PeriodicalId":51053,"journal":{"name":"Expert Systems","volume":null,"pages":null},"PeriodicalIF":3.3,"publicationDate":"2024-06-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141272941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Expert Systems
全部 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