Pub Date : 2024-08-13DOI: 10.1108/ijicc-04-2024-0184
Samia Nawaz Yousafzai, Hooria Shahbaz, Armughan Ali, Amreen Qamar, Inzamam Mashood Nasir, Sara Tehsin, R. Damaševičius
PurposeThe objective is to develop a more effective model that simplifies and accelerates the news classification process using advanced text mining and deep learning (DL) techniques. A distributed framework utilizing Bidirectional Encoder Representations from Transformers (BERT) was developed to classify news headlines. This approach leverages various text mining and DL techniques on a distributed infrastructure, aiming to offer an alternative to traditional news classification methods.Design/methodology/approachThis study focuses on the classification of distinct types of news by analyzing tweets from various news channels. It addresses the limitations of using benchmark datasets for news classification, which often result in models that are impractical for real-world applications.FindingsThe framework’s effectiveness was evaluated on a newly proposed dataset and two additional benchmark datasets from the Kaggle repository, assessing the performance of each text mining and classification method across these datasets. The results of this study demonstrate that the proposed strategy significantly outperforms other approaches in terms of accuracy and execution time. This indicates that the distributed framework, coupled with the use of BERT for text analysis, provides a robust solution for analyzing large volumes of data efficiently. The findings also highlight the value of the newly released corpus for further research in news classification and emotion classification, suggesting its potential to facilitate advancements in these areas.Originality/valueThis research introduces an innovative distributed framework for news classification that addresses the shortcomings of models trained on benchmark datasets. By utilizing cutting-edge techniques and a novel dataset, the study offers significant improvements in accuracy and processing speed. The release of the corpus represents a valuable contribution to the field, enabling further exploration into news and emotion classification. This work sets a new standard for the analysis of news data, offering practical implications for the development of more effective and efficient news classification systems.
{"title":"X-News dataset for online news categorization","authors":"Samia Nawaz Yousafzai, Hooria Shahbaz, Armughan Ali, Amreen Qamar, Inzamam Mashood Nasir, Sara Tehsin, R. Damaševičius","doi":"10.1108/ijicc-04-2024-0184","DOIUrl":"https://doi.org/10.1108/ijicc-04-2024-0184","url":null,"abstract":"PurposeThe objective is to develop a more effective model that simplifies and accelerates the news classification process using advanced text mining and deep learning (DL) techniques. A distributed framework utilizing Bidirectional Encoder Representations from Transformers (BERT) was developed to classify news headlines. This approach leverages various text mining and DL techniques on a distributed infrastructure, aiming to offer an alternative to traditional news classification methods.Design/methodology/approachThis study focuses on the classification of distinct types of news by analyzing tweets from various news channels. It addresses the limitations of using benchmark datasets for news classification, which often result in models that are impractical for real-world applications.FindingsThe framework’s effectiveness was evaluated on a newly proposed dataset and two additional benchmark datasets from the Kaggle repository, assessing the performance of each text mining and classification method across these datasets. The results of this study demonstrate that the proposed strategy significantly outperforms other approaches in terms of accuracy and execution time. This indicates that the distributed framework, coupled with the use of BERT for text analysis, provides a robust solution for analyzing large volumes of data efficiently. The findings also highlight the value of the newly released corpus for further research in news classification and emotion classification, suggesting its potential to facilitate advancements in these areas.Originality/valueThis research introduces an innovative distributed framework for news classification that addresses the shortcomings of models trained on benchmark datasets. By utilizing cutting-edge techniques and a novel dataset, the study offers significant improvements in accuracy and processing speed. The release of the corpus represents a valuable contribution to the field, enabling further exploration into news and emotion classification. This work sets a new standard for the analysis of news data, offering practical implications for the development of more effective and efficient news classification systems.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141919573","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-08-13DOI: 10.1108/ijicc-04-2024-0184
Samia Nawaz Yousafzai, Hooria Shahbaz, Armughan Ali, Amreen Qamar, Inzamam Mashood Nasir, Sara Tehsin, R. Damaševičius
PurposeThe objective is to develop a more effective model that simplifies and accelerates the news classification process using advanced text mining and deep learning (DL) techniques. A distributed framework utilizing Bidirectional Encoder Representations from Transformers (BERT) was developed to classify news headlines. This approach leverages various text mining and DL techniques on a distributed infrastructure, aiming to offer an alternative to traditional news classification methods.Design/methodology/approachThis study focuses on the classification of distinct types of news by analyzing tweets from various news channels. It addresses the limitations of using benchmark datasets for news classification, which often result in models that are impractical for real-world applications.FindingsThe framework’s effectiveness was evaluated on a newly proposed dataset and two additional benchmark datasets from the Kaggle repository, assessing the performance of each text mining and classification method across these datasets. The results of this study demonstrate that the proposed strategy significantly outperforms other approaches in terms of accuracy and execution time. This indicates that the distributed framework, coupled with the use of BERT for text analysis, provides a robust solution for analyzing large volumes of data efficiently. The findings also highlight the value of the newly released corpus for further research in news classification and emotion classification, suggesting its potential to facilitate advancements in these areas.Originality/valueThis research introduces an innovative distributed framework for news classification that addresses the shortcomings of models trained on benchmark datasets. By utilizing cutting-edge techniques and a novel dataset, the study offers significant improvements in accuracy and processing speed. The release of the corpus represents a valuable contribution to the field, enabling further exploration into news and emotion classification. This work sets a new standard for the analysis of news data, offering practical implications for the development of more effective and efficient news classification systems.
{"title":"X-News dataset for online news categorization","authors":"Samia Nawaz Yousafzai, Hooria Shahbaz, Armughan Ali, Amreen Qamar, Inzamam Mashood Nasir, Sara Tehsin, R. Damaševičius","doi":"10.1108/ijicc-04-2024-0184","DOIUrl":"https://doi.org/10.1108/ijicc-04-2024-0184","url":null,"abstract":"PurposeThe objective is to develop a more effective model that simplifies and accelerates the news classification process using advanced text mining and deep learning (DL) techniques. A distributed framework utilizing Bidirectional Encoder Representations from Transformers (BERT) was developed to classify news headlines. This approach leverages various text mining and DL techniques on a distributed infrastructure, aiming to offer an alternative to traditional news classification methods.Design/methodology/approachThis study focuses on the classification of distinct types of news by analyzing tweets from various news channels. It addresses the limitations of using benchmark datasets for news classification, which often result in models that are impractical for real-world applications.FindingsThe framework’s effectiveness was evaluated on a newly proposed dataset and two additional benchmark datasets from the Kaggle repository, assessing the performance of each text mining and classification method across these datasets. The results of this study demonstrate that the proposed strategy significantly outperforms other approaches in terms of accuracy and execution time. This indicates that the distributed framework, coupled with the use of BERT for text analysis, provides a robust solution for analyzing large volumes of data efficiently. The findings also highlight the value of the newly released corpus for further research in news classification and emotion classification, suggesting its potential to facilitate advancements in these areas.Originality/valueThis research introduces an innovative distributed framework for news classification that addresses the shortcomings of models trained on benchmark datasets. By utilizing cutting-edge techniques and a novel dataset, the study offers significant improvements in accuracy and processing speed. The release of the corpus represents a valuable contribution to the field, enabling further exploration into news and emotion classification. This work sets a new standard for the analysis of news data, offering practical implications for the development of more effective and efficient news classification systems.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-08-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141919130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
PurposeAs intelligent technology advances, practical applications often involve data with multiple labels. Therefore, multi-label feature selection methods have attracted much attention to extract valuable information. However, current methods tend to lack interpretability when evaluating the relationship between different types of variables without considering the potential causal relationship.Design/methodology/approachTo address the above problems, we propose an ensemble causal feature selection method based on mutual information and group fusion strategy (CMIFS) for multi-label data. First, the causal relationship between labels and features is analyzed by local causal structure learning, respectively, to obtain a causal feature set. Second, we eliminate false positive features from the obtained feature set using mutual information to improve the feature subset reliability. Eventually, we employ a group fusion strategy to fuse the obtained feature subsets from multiple data sub-space to enhance the stability of the results.FindingsExperimental comparisons are performed on six datasets to validate that our proposal can enhance the interpretation and robustness of the model compared with other methods in different metrics. Furthermore, the statistical analyses further validate the effectiveness of our approach.Originality/valueThe present study makes a noteworthy contribution to proposing a causal feature selection approach based on mutual information to obtain an approximate optimal feature subset for multi-label data. Additionally, our proposal adopts the group fusion strategy to guarantee the robustness of the obtained feature subset.
{"title":"A novel ensemble causal feature selection approach with mutual information and group fusion strategy for multi-label data","authors":"Yifeng Zheng, Xianlong Zeng, Wenjie Zhang, Baoya Wei, Weishuo Ren, Depeng Qing","doi":"10.1108/ijicc-04-2024-0144","DOIUrl":"https://doi.org/10.1108/ijicc-04-2024-0144","url":null,"abstract":"PurposeAs intelligent technology advances, practical applications often involve data with multiple labels. Therefore, multi-label feature selection methods have attracted much attention to extract valuable information. However, current methods tend to lack interpretability when evaluating the relationship between different types of variables without considering the potential causal relationship.Design/methodology/approachTo address the above problems, we propose an ensemble causal feature selection method based on mutual information and group fusion strategy (CMIFS) for multi-label data. First, the causal relationship between labels and features is analyzed by local causal structure learning, respectively, to obtain a causal feature set. Second, we eliminate false positive features from the obtained feature set using mutual information to improve the feature subset reliability. Eventually, we employ a group fusion strategy to fuse the obtained feature subsets from multiple data sub-space to enhance the stability of the results.FindingsExperimental comparisons are performed on six datasets to validate that our proposal can enhance the interpretation and robustness of the model compared with other methods in different metrics. Furthermore, the statistical analyses further validate the effectiveness of our approach.Originality/valueThe present study makes a noteworthy contribution to proposing a causal feature selection approach based on mutual information to obtain an approximate optimal feature subset for multi-label data. Additionally, our proposal adopts the group fusion strategy to guarantee the robustness of the obtained feature subset.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141817315","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-05DOI: 10.1108/ijicc-03-2024-0106
Nouhaila Bensalah, H. Ayad, A. Adib, Abdelhamid Ibn El Farouk
PurposeThe paper aims to enhance Arabic machine translation (MT) by proposing novel approaches: (1) a dimensionality reduction technique for word embeddings tailored for Arabic text, optimizing efficiency while retaining semantic information; (2) a comprehensive comparison of meta-embedding techniques to improve translation quality; and (3) a method leveraging self-attention and Gated CNNs to capture token dependencies, including temporal and hierarchical features within sentences, and interactions between different embedding types. These approaches collectively aim to enhance translation quality by combining different embedding schemes and leveraging advanced modeling techniques.Design/methodology/approachRecent works on MT in general and Arabic MT in particular often pick one type of word embedding model. In this paper, we present a novel approach to enhance Arabic MT by addressing three key aspects. Firstly, we propose a new dimensionality reduction technique for word embeddings, specifically tailored for Arabic text. This technique optimizes the efficiency of embeddings while retaining their semantic information. Secondly, we conduct an extensive comparison of different meta-embedding techniques, exploring the combination of static and contextual embeddings. Through this analysis, we identify the most effective approach to improve translation quality. Lastly, we introduce a novel method that leverages self-attention and Gated convolutional neural networks (CNNs) to capture token dependencies, including temporal and hierarchical features within sentences, as well as interactions between different types of embeddings. Our experimental results demonstrate the effectiveness of our proposed approach in significantly enhancing Arabic MT performance. It outperforms baseline models with a BLEU score increase of 2 points and achieves superior results compared to state-of-the-art approaches, with an average improvement of 4.6 points across all evaluation metrics.FindingsThe proposed approaches significantly enhance Arabic MT performance. The dimensionality reduction technique improves the efficiency of word embeddings while preserving semantic information. Comprehensive comparison identifies effective meta-embedding techniques, with the contextualized dynamic meta-embeddings (CDME) model showcasing competitive results. Integration of Gated CNNs with the transformer model surpasses baseline performance, leveraging both architectures' strengths. Overall, these findings demonstrate substantial improvements in translation quality, with a BLEU score increase of 2 points and an average improvement of 4.6 points across all evaluation metrics, outperforming state-of-the-art approaches.Originality/valueThe paper’s originality lies in its departure from simply fine-tuning the transformer model for a specific task. Instead, it introduces modifications to the internal architecture of the transformer, integrating Gated CNNs to enhance translation performance. This
{"title":"Contextualized dynamic meta embeddings based on Gated CNNs and self-attention for Arabic machine translation","authors":"Nouhaila Bensalah, H. Ayad, A. Adib, Abdelhamid Ibn El Farouk","doi":"10.1108/ijicc-03-2024-0106","DOIUrl":"https://doi.org/10.1108/ijicc-03-2024-0106","url":null,"abstract":"PurposeThe paper aims to enhance Arabic machine translation (MT) by proposing novel approaches: (1) a dimensionality reduction technique for word embeddings tailored for Arabic text, optimizing efficiency while retaining semantic information; (2) a comprehensive comparison of meta-embedding techniques to improve translation quality; and (3) a method leveraging self-attention and Gated CNNs to capture token dependencies, including temporal and hierarchical features within sentences, and interactions between different embedding types. These approaches collectively aim to enhance translation quality by combining different embedding schemes and leveraging advanced modeling techniques.Design/methodology/approachRecent works on MT in general and Arabic MT in particular often pick one type of word embedding model. In this paper, we present a novel approach to enhance Arabic MT by addressing three key aspects. Firstly, we propose a new dimensionality reduction technique for word embeddings, specifically tailored for Arabic text. This technique optimizes the efficiency of embeddings while retaining their semantic information. Secondly, we conduct an extensive comparison of different meta-embedding techniques, exploring the combination of static and contextual embeddings. Through this analysis, we identify the most effective approach to improve translation quality. Lastly, we introduce a novel method that leverages self-attention and Gated convolutional neural networks (CNNs) to capture token dependencies, including temporal and hierarchical features within sentences, as well as interactions between different types of embeddings. Our experimental results demonstrate the effectiveness of our proposed approach in significantly enhancing Arabic MT performance. It outperforms baseline models with a BLEU score increase of 2 points and achieves superior results compared to state-of-the-art approaches, with an average improvement of 4.6 points across all evaluation metrics.FindingsThe proposed approaches significantly enhance Arabic MT performance. The dimensionality reduction technique improves the efficiency of word embeddings while preserving semantic information. Comprehensive comparison identifies effective meta-embedding techniques, with the contextualized dynamic meta-embeddings (CDME) model showcasing competitive results. Integration of Gated CNNs with the transformer model surpasses baseline performance, leveraging both architectures' strengths. Overall, these findings demonstrate substantial improvements in translation quality, with a BLEU score increase of 2 points and an average improvement of 4.6 points across all evaluation metrics, outperforming state-of-the-art approaches.Originality/valueThe paper’s originality lies in its departure from simply fine-tuning the transformer model for a specific task. Instead, it introduces modifications to the internal architecture of the transformer, integrating Gated CNNs to enhance translation performance. This ","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141674372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-07-04DOI: 10.1108/ijicc-01-2024-0017
Weijiang Wu, Heping Tan, Yifeng Zheng
PurposeCommunity detection is a key factor in analyzing the structural features of complex networks. However, traditional dynamic community detection methods often fail to effectively solve the problems of deep network information loss and computational complexity in hyperbolic space. To address this challenge, a hyperbolic space-based dynamic graph neural network community detection model (HSDCDM) is proposed.Design/methodology/approachHSDCDM first projects the node features into the hyperbolic space and then utilizes the hyperbolic graph convolution module on the Poincaré and Lorentz models to realize feature fusion and information transfer. In addition, the parallel optimized temporal memory module ensures fast and accurate capture of time domain information over extended periods. Finally, the community clustering module divides the community structure by combining the node characteristics of the space domain and the time domain. To evaluate the performance of HSDCDM, experiments are conducted on both artificial and real datasets.FindingsExperimental results on complex networks demonstrate that HSDCDM significantly enhances the quality of community detection in hierarchical networks. It shows an average improvement of 7.29% in NMI and a 9.07% increase in ARI across datasets compared to traditional methods. For complex networks with non-Euclidean geometric structures, the HSDCDM model incorporating hyperbolic geometry can better handle the discontinuity of the metric space, provides a more compact embedding that preserves the data structure, and offers advantages over methods based on Euclidean geometry methods.Originality/valueThis model aggregates the potential information of nodes in space through manifold-preserving distribution mapping and hyperbolic graph topology modules. Moreover, it optimizes the Simple Recurrent Unit (SRU) on the hyperbolic space Lorentz model to effectively extract time series data in hyperbolic space, thereby enhancing computing efficiency by eliminating the reliance on tangent space.
{"title":"Dynamic community detection algorithm based on hyperbolic graph convolution","authors":"Weijiang Wu, Heping Tan, Yifeng Zheng","doi":"10.1108/ijicc-01-2024-0017","DOIUrl":"https://doi.org/10.1108/ijicc-01-2024-0017","url":null,"abstract":"PurposeCommunity detection is a key factor in analyzing the structural features of complex networks. However, traditional dynamic community detection methods often fail to effectively solve the problems of deep network information loss and computational complexity in hyperbolic space. To address this challenge, a hyperbolic space-based dynamic graph neural network community detection model (HSDCDM) is proposed.Design/methodology/approachHSDCDM first projects the node features into the hyperbolic space and then utilizes the hyperbolic graph convolution module on the Poincaré and Lorentz models to realize feature fusion and information transfer. In addition, the parallel optimized temporal memory module ensures fast and accurate capture of time domain information over extended periods. Finally, the community clustering module divides the community structure by combining the node characteristics of the space domain and the time domain. To evaluate the performance of HSDCDM, experiments are conducted on both artificial and real datasets.FindingsExperimental results on complex networks demonstrate that HSDCDM significantly enhances the quality of community detection in hierarchical networks. It shows an average improvement of 7.29% in NMI and a 9.07% increase in ARI across datasets compared to traditional methods. For complex networks with non-Euclidean geometric structures, the HSDCDM model incorporating hyperbolic geometry can better handle the discontinuity of the metric space, provides a more compact embedding that preserves the data structure, and offers advantages over methods based on Euclidean geometry methods.Originality/valueThis model aggregates the potential information of nodes in space through manifold-preserving distribution mapping and hyperbolic graph topology modules. Moreover, it optimizes the Simple Recurrent Unit (SRU) on the hyperbolic space Lorentz model to effectively extract time series data in hyperbolic space, thereby enhancing computing efficiency by eliminating the reliance on tangent space.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":2.2,"publicationDate":"2024-07-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141677447","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-06DOI: 10.1108/ijicc-11-2023-0336
Ö. H. Namli, Seda Yanık, A. Erdoğan, Anke Schmeink
PurposeCoronary artery disease is one of the most common cardiovascular disorders in the world, and it can be deadly. Traditional diagnostic approaches are based on angiography, which is an interventional procedure having side effects such as contrast nephropathy or radio exposure as well as significant expenses. The purpose of this paper is to propose a novel artificial intelligence (AI) approach for the diagnosis of coronary artery disease as an effective alternative to traditional diagnostic methods.Design/methodology/approachIn this study, a novel ensemble AI approach based on optimization and classification is proposed. The proposed ensemble structure consists of three stages: feature selection, classification and combining. In the first stage, important features for each classification method are identified using the binary particle swarm optimization algorithm (BPSO). In the second stage, individual classification methods are used. In the final stage, the prediction results obtained from the individual methods are combined in an optimized way using the particle swarm optimization (PSO) algorithm to achieve better predictions.FindingsThe proposed method has been tested using an up-to-date real dataset collected at Basaksehir Çam and Sakura City Hospital. The data of disease prediction are unbalanced. Hence, the proposed ensemble approach improves majorly the F-measure and ROC area which are more prominent measures in case of unbalanced classification. The comparison shows that the proposed approach improves the F-measure and ROC area results of the individual classification methods around 14.5% in average and diagnoses with an accuracy rate of 96%.Originality/valueThis study presents a low-cost and low-risk AI-based approach for diagnosing heart disease compared to traditional diagnostic methods. Most of the existing research studies focus on base classification methods. In this study, we mainly investigate an effective ensemble method that uses optimization approaches for feature selection and combining stages for the medical diagnostic domain. Furthermore, the approaches in the literature are commonly tested on open-access dataset in heart disease diagnoses, whereas we apply our approach on a real and up-to-date dataset.
目的冠状动脉疾病是世界上最常见的心血管疾病之一，可致命。传统的诊断方法以血管造影术为基础，而血管造影术是一种介入性手术，具有造影剂肾病或放射线照射等副作用，而且费用高昂。本文旨在提出一种新型人工智能（AI）方法，用于诊断冠状动脉疾病，作为传统诊断方法的有效替代方案。所提出的集合结构包括三个阶段：特征选择、分类和组合。在第一阶段，使用二元粒子群优化算法（BPSO）确定每种分类方法的重要特征。在第二阶段，使用单个分类方法。在最后阶段，使用粒子群优化算法（PSO）以优化的方式合并从单个方法中获得的预测结果，以获得更好的预测结果。 研究结果使用在 Basaksehir Çam 和樱花市医院收集的最新真实数据集测试了所提出的方法。疾病预测数据是不平衡的。因此，所提出的集合方法主要提高了 F 值和 ROC 面积，而这两项指标在不平衡分类的情况下更为突出。比较结果表明，所提出的方法平均提高了单个分类方法的 F-measure 和 ROC 面积结果约 14.5%，诊断准确率高达 96%。现有的研究大多集中在基础分类方法上。在本研究中，我们主要研究了一种有效的集合方法，该方法在医疗诊断领域的特征选择和组合阶段使用了优化方法。此外，文献中的方法通常在心脏病诊断的开放数据集上进行测试，而我们的方法则应用于真实的最新数据集。
{"title":"A novel ensemble artificial intelligence approach for coronary artery disease prediction","authors":"Ö. H. Namli, Seda Yanık, A. Erdoğan, Anke Schmeink","doi":"10.1108/ijicc-11-2023-0336","DOIUrl":"https://doi.org/10.1108/ijicc-11-2023-0336","url":null,"abstract":"PurposeCoronary artery disease is one of the most common cardiovascular disorders in the world, and it can be deadly. Traditional diagnostic approaches are based on angiography, which is an interventional procedure having side effects such as contrast nephropathy or radio exposure as well as significant expenses. The purpose of this paper is to propose a novel artificial intelligence (AI) approach for the diagnosis of coronary artery disease as an effective alternative to traditional diagnostic methods.Design/methodology/approachIn this study, a novel ensemble AI approach based on optimization and classification is proposed. The proposed ensemble structure consists of three stages: feature selection, classification and combining. In the first stage, important features for each classification method are identified using the binary particle swarm optimization algorithm (BPSO). In the second stage, individual classification methods are used. In the final stage, the prediction results obtained from the individual methods are combined in an optimized way using the particle swarm optimization (PSO) algorithm to achieve better predictions.FindingsThe proposed method has been tested using an up-to-date real dataset collected at Basaksehir Çam and Sakura City Hospital. The data of disease prediction are unbalanced. Hence, the proposed ensemble approach improves majorly the F-measure and ROC area which are more prominent measures in case of unbalanced classification. The comparison shows that the proposed approach improves the F-measure and ROC area results of the individual classification methods around 14.5% in average and diagnoses with an accuracy rate of 96%.Originality/valueThis study presents a low-cost and low-risk AI-based approach for diagnosing heart disease compared to traditional diagnostic methods. Most of the existing research studies focus on base classification methods. In this study, we mainly investigate an effective ensemble method that uses optimization approaches for feature selection and combining stages for the medical diagnostic domain. Furthermore, the approaches in the literature are commonly tested on open-access dataset in heart disease diagnoses, whereas we apply our approach on a real and up-to-date dataset.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141380634","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-04DOI: 10.1108/ijicc-02-2024-0077
Akhil Kumar, R. Dhanalakshmi
PurposeThe purpose of this work is to present an approach for autonomous detection of eye disease in fundus images. Furthermore, this work presents an improved variant of the Tiny YOLOv7 model developed specifically for eye disease detection. The model proposed in this work is a highly useful tool for the development of applications for autonomous detection of eye diseases in fundus images that can help and assist ophthalmologists.Design/methodology/approachThe approach adopted to carry out this work is twofold. Firstly, a richly annotated dataset consisting of eye disease classes, namely, cataract, glaucoma, retinal disease and normal eye, was created. Secondly, an improved variant of the Tiny YOLOv7 model was developed and proposed as EYE-YOLO. The proposed EYE-YOLO model has been developed by integrating multi-spatial pyramid pooling in the feature extraction network and Focal-EIOU loss in the detection network of the Tiny YOLOv7 model. Moreover, at run time, the mosaic augmentation strategy has been utilized with the proposed model to achieve benchmark results. Further, evaluations have been carried out for performance metrics, namely, precision, recall, F1 Score, average precision (AP) and mean average precision (mAP).FindingsThe proposed EYE-YOLO achieved 28% higher precision, 18% higher recall, 24% higher F1 Score and 30.81% higher mAP than the Tiny YOLOv7 model. Moreover, in terms of AP for each class of the employed dataset, it achieved 9.74% higher AP for cataract, 27.73% higher AP for glaucoma, 72.50% higher AP for retina disease and 13.26% higher AP for normal eye. In comparison to the state-of-the-art Tiny YOLOv5, Tiny YOLOv6 and Tiny YOLOv8 models, the proposed EYE-YOLO achieved 6–23.32% higher mAP.Originality/valueThis work addresses the problem of eye disease recognition as a bounding box regression and detection problem. Whereas, the work in the related research is largely based on eye disease classification. The other highlight of this work is to propose a richly annotated dataset for different eye diseases useful for training deep learning-based object detectors. The major highlight of this work lies in the proposal of an improved variant of the Tiny YOLOv7 model focusing on eye disease detection. The proposed modifications in the Tiny YOLOv7 aided the proposed model in achieving better results as compared to the state-of-the-art Tiny YOLOv8 and YOLOv8 Nano.
{"title":"EYE-YOLO: a multi-spatial pyramid pooling and Focal-EIOU loss inspired tiny YOLOv7 for fundus eye disease detection","authors":"Akhil Kumar, R. Dhanalakshmi","doi":"10.1108/ijicc-02-2024-0077","DOIUrl":"https://doi.org/10.1108/ijicc-02-2024-0077","url":null,"abstract":"PurposeThe purpose of this work is to present an approach for autonomous detection of eye disease in fundus images. Furthermore, this work presents an improved variant of the Tiny YOLOv7 model developed specifically for eye disease detection. The model proposed in this work is a highly useful tool for the development of applications for autonomous detection of eye diseases in fundus images that can help and assist ophthalmologists.Design/methodology/approachThe approach adopted to carry out this work is twofold. Firstly, a richly annotated dataset consisting of eye disease classes, namely, cataract, glaucoma, retinal disease and normal eye, was created. Secondly, an improved variant of the Tiny YOLOv7 model was developed and proposed as EYE-YOLO. The proposed EYE-YOLO model has been developed by integrating multi-spatial pyramid pooling in the feature extraction network and Focal-EIOU loss in the detection network of the Tiny YOLOv7 model. Moreover, at run time, the mosaic augmentation strategy has been utilized with the proposed model to achieve benchmark results. Further, evaluations have been carried out for performance metrics, namely, precision, recall, F1 Score, average precision (AP) and mean average precision (mAP).FindingsThe proposed EYE-YOLO achieved 28% higher precision, 18% higher recall, 24% higher F1 Score and 30.81% higher mAP than the Tiny YOLOv7 model. Moreover, in terms of AP for each class of the employed dataset, it achieved 9.74% higher AP for cataract, 27.73% higher AP for glaucoma, 72.50% higher AP for retina disease and 13.26% higher AP for normal eye. In comparison to the state-of-the-art Tiny YOLOv5, Tiny YOLOv6 and Tiny YOLOv8 models, the proposed EYE-YOLO achieved 6–23.32% higher mAP.Originality/valueThis work addresses the problem of eye disease recognition as a bounding box regression and detection problem. Whereas, the work in the related research is largely based on eye disease classification. The other highlight of this work is to propose a richly annotated dataset for different eye diseases useful for training deep learning-based object detectors. The major highlight of this work lies in the proposal of an improved variant of the Tiny YOLOv7 model focusing on eye disease detection. The proposed modifications in the Tiny YOLOv7 aided the proposed model in achieving better results as compared to the state-of-the-art Tiny YOLOv8 and YOLOv8 Nano.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141266105","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-06-04DOI: 10.1108/ijicc-02-2024-0091
Haonan Hou, Chao Zhang, Fanghui Lu, Panna Lu
PurposeThree-way decision (3WD) and probabilistic rough sets (PRSs) are theoretical tools capable of simulating humans' multi-level and multi-perspective thinking modes in the field of decision-making. They are proposed to assist decision-makers in better managing incomplete or imprecise information under conditions of uncertainty or fuzziness. However, it is easy to cause decision losses and the personal thresholds of decision-makers cannot be taken into account. To solve this problem, this paper combines picture fuzzy (PF) multi-granularity (MG) with 3WD and establishes the notion of PF MG 3WD.Design/methodology/approachAn effective incomplete model based on PF MG 3WD is designed in this paper. First, the form of PF MG incomplete information systems (IISs) is established to reasonably record the uncertain information. On this basis, the PF conditional probability is established by using PF similarity relations, and the concept of adjustable PF MG PRSs is proposed by using the PF conditional probability to fuse data. Then, a comprehensive PF multi-attribute group decision-making (MAGDM) scheme is formed by the adjustable PF MG PRSs and the VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) method. Finally, an actual breast cancer data set is used to reveal the validity of the constructed method.FindingsThe experimental results confirm the effectiveness of PF MG 3WD in predicting breast cancer. Compared with existing models, PF MG 3WD has better robustness and generalization performance. This is mainly due to the incomplete PF MG 3WD proposed in this paper, which effectively reduces the influence of unreasonable outliers and threshold settings.Originality/valueThe model employs the VIKOR method for optimal granularity selections, which takes into account both group utility maximization and individual regret minimization, while incorporating decision-makers' subjective preferences as well. This ensures that the experiment maintains higher exclusion stability and reliability, enhancing the robustness of the decision results.
{"title":"Breast cancer pre-diagnosis based on incomplete picture fuzzy multi-granularity three-way decisions","authors":"Haonan Hou, Chao Zhang, Fanghui Lu, Panna Lu","doi":"10.1108/ijicc-02-2024-0091","DOIUrl":"https://doi.org/10.1108/ijicc-02-2024-0091","url":null,"abstract":"PurposeThree-way decision (3WD) and probabilistic rough sets (PRSs) are theoretical tools capable of simulating humans' multi-level and multi-perspective thinking modes in the field of decision-making. They are proposed to assist decision-makers in better managing incomplete or imprecise information under conditions of uncertainty or fuzziness. However, it is easy to cause decision losses and the personal thresholds of decision-makers cannot be taken into account. To solve this problem, this paper combines picture fuzzy (PF) multi-granularity (MG) with 3WD and establishes the notion of PF MG 3WD.Design/methodology/approachAn effective incomplete model based on PF MG 3WD is designed in this paper. First, the form of PF MG incomplete information systems (IISs) is established to reasonably record the uncertain information. On this basis, the PF conditional probability is established by using PF similarity relations, and the concept of adjustable PF MG PRSs is proposed by using the PF conditional probability to fuse data. Then, a comprehensive PF multi-attribute group decision-making (MAGDM) scheme is formed by the adjustable PF MG PRSs and the VlseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) method. Finally, an actual breast cancer data set is used to reveal the validity of the constructed method.FindingsThe experimental results confirm the effectiveness of PF MG 3WD in predicting breast cancer. Compared with existing models, PF MG 3WD has better robustness and generalization performance. This is mainly due to the incomplete PF MG 3WD proposed in this paper, which effectively reduces the influence of unreasonable outliers and threshold settings.Originality/valueThe model employs the VIKOR method for optimal granularity selections, which takes into account both group utility maximization and individual regret minimization, while incorporating decision-makers' subjective preferences as well. This ensures that the experiment maintains higher exclusion stability and reliability, enhancing the robustness of the decision results.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-06-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141267660","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-03-22DOI: 10.1108/ijicc-11-2023-0385
Mohd. Mustaqeem, Suhel Mustajab, M.Aftab Alam
PurposeSoftware defect prediction (SDP) is a critical aspect of software quality assurance, aiming to identify and manage potential defects in software systems. In this paper, we have proposed a novel hybrid approach that combines Gray Wolf Optimization with Feature Selection (GWOFS) and multilayer perceptron (MLP) for SDP. The GWOFS-MLP hybrid model is designed to optimize feature selection, ultimately enhancing the accuracy and efficiency of SDP. Gray Wolf Optimization, inspired by the social hierarchy and hunting behavior of gray wolves, is employed to select a subset of relevant features from an extensive pool of potential predictors. This study investigates the key challenges that traditional SDP approaches encounter and proposes promising solutions to overcome time complexity and the curse of the dimensionality reduction problem.Design/methodology/approachThe integration of GWOFS and MLP results in a robust hybrid model that can adapt to diverse software datasets. This feature selection process harnesses the cooperative hunting behavior of wolves, allowing for the exploration of critical feature combinations. The selected features are then fed into an MLP, a powerful artificial neural network (ANN) known for its capability to learn intricate patterns within software metrics. MLP serves as the predictive engine, utilizing the curated feature set to model and classify software defects accurately.FindingsThe performance evaluation of the GWOFS-MLP hybrid model on a real-world software defect dataset demonstrates its effectiveness. The model achieves a remarkable training accuracy of 97.69% and a testing accuracy of 97.99%. Additionally, the receiver operating characteristic area under the curve (ROC-AUC) score of 0.89 highlights the model’s ability to discriminate between defective and defect-free software components.Originality/valueExperimental implementations using machine learning-based techniques with feature reduction are conducted to validate the proposed solutions. The goal is to enhance SDP’s accuracy, relevance and efficiency, ultimately improving software quality assurance processes. The confusion matrix further illustrates the model’s performance, with only a small number of false positives and false negatives.
{"title":"A hybrid approach for optimizing software defect prediction using a gray wolf optimization and multilayer perceptron","authors":"Mohd. Mustaqeem, Suhel Mustajab, M.Aftab Alam","doi":"10.1108/ijicc-11-2023-0385","DOIUrl":"https://doi.org/10.1108/ijicc-11-2023-0385","url":null,"abstract":"PurposeSoftware defect prediction (SDP) is a critical aspect of software quality assurance, aiming to identify and manage potential defects in software systems. In this paper, we have proposed a novel hybrid approach that combines Gray Wolf Optimization with Feature Selection (GWOFS) and multilayer perceptron (MLP) for SDP. The GWOFS-MLP hybrid model is designed to optimize feature selection, ultimately enhancing the accuracy and efficiency of SDP. Gray Wolf Optimization, inspired by the social hierarchy and hunting behavior of gray wolves, is employed to select a subset of relevant features from an extensive pool of potential predictors. This study investigates the key challenges that traditional SDP approaches encounter and proposes promising solutions to overcome time complexity and the curse of the dimensionality reduction problem.Design/methodology/approachThe integration of GWOFS and MLP results in a robust hybrid model that can adapt to diverse software datasets. This feature selection process harnesses the cooperative hunting behavior of wolves, allowing for the exploration of critical feature combinations. The selected features are then fed into an MLP, a powerful artificial neural network (ANN) known for its capability to learn intricate patterns within software metrics. MLP serves as the predictive engine, utilizing the curated feature set to model and classify software defects accurately.FindingsThe performance evaluation of the GWOFS-MLP hybrid model on a real-world software defect dataset demonstrates its effectiveness. The model achieves a remarkable training accuracy of 97.69% and a testing accuracy of 97.99%. Additionally, the receiver operating characteristic area under the curve (ROC-AUC) score of 0.89 highlights the model’s ability to discriminate between defective and defect-free software components.Originality/valueExperimental implementations using machine learning-based techniques with feature reduction are conducted to validate the proposed solutions. The goal is to enhance SDP’s accuracy, relevance and efficiency, ultimately improving software quality assurance processes. The confusion matrix further illustrates the model’s performance, with only a small number of false positives and false negatives.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-03-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140213948","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2024-01-25DOI: 10.1108/ijicc-11-2023-0329
Lin Kang, Jie Wang, Junjie Chen, Di Yang
PurposeSince the performance of vehicular users and cellular users (CUE) in Vehicular networks is highly affected by the allocated resources to them. The purpose of this paper is to investigate the resource allocation for vehicular communications when multiple V2V links and a V2I link share spectrum with CUE in uplink communication under different Quality of Service (QoS).Design/methodology/approachAn optimization model to maximize the V2I capacity is established based on slowly varying large-scale fading channel information. Multiple V2V links are clustered based on sparrow search algorithm (SSA) to reduce interference. Then, a weighted tripartite graph is constructed by jointly optimizing the power of CUE, V2I and V2V clusters. Finally, spectrum resources are allocated based on a weighted 3D matching algorithm.FindingsThe performance of the proposed algorithm is tested. Simulation results show that the proposed algorithm can maximize the channel capacity of V2I while ensuring the reliability of V2V and the quality of service of CUE.Originality/valueThere is a lack of research on resource allocation algorithms of CUE, V2I and multiple V2V in different QoS. To solve the problem, one new resource allocation algorithm is proposed in this paper. Firstly, multiple V2V links are clustered using SSA to reduce interference. Secondly, the power allocation of CUE, V2I and V2V is jointly optimized. Finally, the weighted 3D matching algorithm is used to allocate spectrum resources.
{"title":"Resource allocation in vehicular network based on sparrow search algorithm and hyper-graph in the presence of multiple cellular users","authors":"Lin Kang, Jie Wang, Junjie Chen, Di Yang","doi":"10.1108/ijicc-11-2023-0329","DOIUrl":"https://doi.org/10.1108/ijicc-11-2023-0329","url":null,"abstract":"PurposeSince the performance of vehicular users and cellular users (CUE) in Vehicular networks is highly affected by the allocated resources to them. The purpose of this paper is to investigate the resource allocation for vehicular communications when multiple V2V links and a V2I link share spectrum with CUE in uplink communication under different Quality of Service (QoS).Design/methodology/approachAn optimization model to maximize the V2I capacity is established based on slowly varying large-scale fading channel information. Multiple V2V links are clustered based on sparrow search algorithm (SSA) to reduce interference. Then, a weighted tripartite graph is constructed by jointly optimizing the power of CUE, V2I and V2V clusters. Finally, spectrum resources are allocated based on a weighted 3D matching algorithm.FindingsThe performance of the proposed algorithm is tested. Simulation results show that the proposed algorithm can maximize the channel capacity of V2I while ensuring the reliability of V2V and the quality of service of CUE.Originality/valueThere is a lack of research on resource allocation algorithms of CUE, V2I and multiple V2V in different QoS. To solve the problem, one new resource allocation algorithm is proposed in this paper. Firstly, multiple V2V links are clustered using SSA to reduce interference. Secondly, the power allocation of CUE, V2I and V2V is jointly optimized. Finally, the weighted 3D matching algorithm is used to allocate spectrum resources.","PeriodicalId":45291,"journal":{"name":"International Journal of Intelligent Computing and Cybernetics","volume":null,"pages":null},"PeriodicalIF":4.3,"publicationDate":"2024-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139598370","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：