AlgorithmsPub Date : 2024-05-24DOI: 10.3390/a17060229
Maadh Rajaa Mohammed, A. Sagheer
{"title":"Employing a Convolutional Neural Network to Classify Sleep Stages from EEG Signals Using Feature Reduction Techniques","authors":"Maadh Rajaa Mohammed, A. Sagheer","doi":"10.3390/a17060229","DOIUrl":"https://doi.org/10.3390/a17060229","url":null,"abstract":"One of the most essential components of human life is sleep. One of the first steps in spotting abnormalities connected to sleep is classifying sleep stages. Based on the kind and frequency of signals obtained during a polysomnography test, sleep phases can be separated into groups. Accurate classification of sleep stages from electroencephalogram (EEG) signals plays a crucial role in sleep disorder diagnosis and treatment. This study proposes a novel approach that combines feature selection techniques with convolutional neural networks (CNNs) to enhance the classification performance of sleep stages using EEG signals. Firstly, a comprehensive feature selection process was employed to extract discriminative features from raw EEG data, aiming to reduce dimensionality and enhance the efficiency of subsequent classification using mutual information (MI) and analysis of variance (ANOVA) after splitting the dataset into two sets—the training set (70%) and testing set (30%)—then processing it using the standard scalar method. Subsequently, a 1D-CNN architecture was designed to automatically learn hierarchical representations of the selected features, capturing complex patterns indicative of different sleep stages. The proposed method was evaluated on a publicly available EDF-Sleep dataset, demonstrating superior performance compared to traditional approaches. The results highlight the effectiveness of integrating feature selection with CNNs in improving the accuracy and reliability of sleep stage classification from EEG signals, which reached 99.84% with MI-50. This approach not only contributes to advancing the field of sleep disorder diagnosis, but also holds promise for developing more efficient and robust clinical decision support systems.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"21 8","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141102868","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}
AlgorithmsPub Date : 2024-05-23DOI: 10.3390/a17060225
John Owoicho Odeh, Xiaolong Yang, C. I. Nwakanma, Sahraoui Dhelim
{"title":"Context Privacy Preservation for User Validation by Wireless Sensors in the Industrial Metaverse Access System","authors":"John Owoicho Odeh, Xiaolong Yang, C. I. Nwakanma, Sahraoui Dhelim","doi":"10.3390/a17060225","DOIUrl":"https://doi.org/10.3390/a17060225","url":null,"abstract":"The Industrial Metaverse provides unparalleled prospects for increasing productivity and efficiency across multiple sectors. As wireless sensor networks play an important role in data collection and transmission within this ecosystem, preserving context privacy becomes critical to protecting sensitive information. This paper investigates the issue of context privacy preservation for user validation via AccesSensor in the Industrial Metaverse and presents a technological method to address it. We explore the need for context privacy, look at existing privacy preservation solutions, and propose novel user validation methods that are customized to the Industrial Metaverse’s access system. This method is evaluated on time-based efficiency, privacy method and bandwidth utilization. Our method performs better as compared to the DPSensor. Our research seeks to provide insights and recommendations for developing strong privacy protection methods in wireless sensor networks that operate within the Industrial Metaverse ecosystem.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"39 22","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141108015","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}
AlgorithmsPub Date : 2024-05-23DOI: 10.3390/a17060226
Arman Ferdowsi, Maryam Dehghan Dehghan Chenary
{"title":"Gain and Pain in Graph Partitioning: Finding Accurate Communities in Complex Networks","authors":"Arman Ferdowsi, Maryam Dehghan Dehghan Chenary","doi":"10.3390/a17060226","DOIUrl":"https://doi.org/10.3390/a17060226","url":null,"abstract":"This paper presents an approach to community detection in complex networks by simultaneously incorporating a connectivity-based metric and Max-Min Modularity. By leveraging the connectivity-based metric and employing a heuristic algorithm, we develop a novel complementary graph for the Max-Min Modularity that enhances its effectiveness. We formulate community detection as an integer programming problem of an equivalent yet more compact counterpart model of the revised Max-Min Modularity maximization problem. Using a row generation technique alongside the heuristic approach, we then provide a hybrid procedure for near-optimally solving the model and discovering high-quality communities. Through a series of experiments, we demonstrate the success of our algorithm, showcasing its efficiency in detecting communities, particularly in extensive networks.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"56 25","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141103146","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}
AlgorithmsPub Date : 2024-05-23DOI: 10.3390/a17060224
Hassan Hachem, Candy Abboud
{"title":"Bayesian Estimation of Simultaneous Regression Quantiles Using Hamiltonian Monte Carlo","authors":"Hassan Hachem, Candy Abboud","doi":"10.3390/a17060224","DOIUrl":"https://doi.org/10.3390/a17060224","url":null,"abstract":"The simultaneous estimation of multiple quantiles is a crucial statistical task that enables a thorough understanding of data distribution for robust analysis and decision-making. In this study, we adopt a Bayesian approach to tackle this critical task, employing the asymmetric Laplace distribution (ALD) as a flexible framework for quantile modeling. Our methodology implementation involves the Hamiltonian Monte Carlo (HMC) algorithm, building on the foundation laid in priorwork , where the error term is assumed to follow an ALD. Capitalizing on the interplay between two distinct quantiles of this distribution, we endorse a straightforward and fully Bayesian method that adheres to the non-crossing property of quantiles. Illustrated through simulated scenarios, we showcase the effectiveness of our approach in quantile estimation, enhancing precision via the HMC algorithm. The proposed method proves versatile, finding application in finance, environmental science, healthcare, and manufacturing, and contributing to sustainable development goals by fostering innovation and enhancing decision-making in diverse fields.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"56 19","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141103152","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}
AlgorithmsPub Date : 2024-05-23DOI: 10.3390/a17060223
R. Martins, Fátima Rodrigues, Susana Costa, Nélson Costa
{"title":"Inertial Sensors-Based Assessment of Human Breathing Pattern: A Systematic Literature Review","authors":"R. Martins, Fátima Rodrigues, Susana Costa, Nélson Costa","doi":"10.3390/a17060223","DOIUrl":"https://doi.org/10.3390/a17060223","url":null,"abstract":"Breathing pattern assessment holds critical importance in clinical practice for detecting respiratory dysfunctions and their impact on health and wellbeing. This systematic literature review investigates the efficacy of inertial sensors in assessing adult human breathing patterns, exploring various methodologies, challenges, and limitations. Utilizing the PSALSAR framework, incorporating the PICOC method and PRISMA statement for comprehensive research, 22 publications were scrutinized from the Scopus, Web of Science, and PubMed databases. A diverse range of sensor fusion methods, data signal analysis techniques, and classifier performances were investigated. Notably, Madgwick’s algorithm and the Principal Component Analysis showed superior performance in tracking respiratory movements. Classifiers like Long Short-Term Memory Recurrent Neural Networks exhibited high accuracy in detecting breathing events. Motion artifacts, limited sample sizes, and physiological variability posed challenges, highlighting the need for further research. Optimal sensor configurations were explored, suggesting improvements with multiple sensors, especially in different body postures. In conclusion, this systematic literature review elucidates methods, challenges, and potential future developments in using inertial sensors for assessing adult human breathing patterns. Overcoming the challenges related to sensor placement, motion artifacts, and algorithm development is essential for progress. Future research should focus on extending sensor applications to clinical settings and diverse populations, enhancing respiratory health management.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"17 16","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141104677","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}
AlgorithmsPub Date : 2024-05-22DOI: 10.3390/a17060222
J. Craveirinha, J. Clímaco, Rita Girão-Silva, Marta Pascoal
{"title":"Multiobjective Path Problems and Algorithms in Telecommunication Network Design—Overview and Trends","authors":"J. Craveirinha, J. Clímaco, Rita Girão-Silva, Marta Pascoal","doi":"10.3390/a17060222","DOIUrl":"https://doi.org/10.3390/a17060222","url":null,"abstract":"A major area of application of multiobjective path problems and resolution algorithms is telecommunication network routing design, taking into account the extremely rapid technological and service evolutions. The need for explicit consideration of heterogeneous Quality of Service metrics makes it advantageous for the development of routing models where various technical–economic aspects, often conflicting, should be tackled. Our work is focused on multiobjective path problem formulations and resolution methods and their applications to routing methods. We review basic concepts and present main formulations of multiobjective path problems, considering different types of objective functions. We outline the different types of resolution methods for these problems, including a classification and overview of relevant algorithms concerning different types of problems. Afterwards, we outline background concepts on routing models and present an overview of selected papers considered as representative of different types of applications of multiobjective path problem formulations and algorithms. A broad characterization of major types of path problems relevant in this context is shown regarding the overview of contributions in different technological and architectural network environments. Finally, we outline research trends in this area, in relation to recent technological evolutions in communication networks.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"67 44","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141109958","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}
AlgorithmsPub Date : 2024-05-21DOI: 10.3390/a17060221
Jose Dixon, Oluwatunmise Akinniyi, Abeer Abdelhamid, Gehad A. Saleh, M. Rahman, Fahmi Khalifa
{"title":"A Hybrid Learning-Architecture for Improved Brain Tumor Recognition","authors":"Jose Dixon, Oluwatunmise Akinniyi, Abeer Abdelhamid, Gehad A. Saleh, M. Rahman, Fahmi Khalifa","doi":"10.3390/a17060221","DOIUrl":"https://doi.org/10.3390/a17060221","url":null,"abstract":"The accurate classification of brain tumors is an important step for early intervention. Artificial intelligence (AI)-based diagnostic systems have been utilized in recent years to help automate the process and provide more objective and faster diagnosis. This work introduces an enhanced AI-based architecture for improved brain tumor classification. We introduce a hybrid architecture that integrates vision transformer (ViT) and deep neural networks to create an ensemble classifier, resulting in a more robust brain tumor classification framework. The analysis pipeline begins with preprocessing and data normalization, followed by extracting three types of MRI-derived information-rich features. The latter included higher-order texture and structural feature sets to harness the spatial interactions between image intensities, which were derived using Haralick features and local binary patterns. Additionally, local deeper features of the brain images are extracted using an optimized convolutional neural networks (CNN) architecture. Finally, ViT-derived features are also integrated due to their ability to handle dependencies across larger distances while being less sensitive to data augmentation. The extracted features are then weighted, fused, and fed to a machine learning classifier for the final classification of brain MRIs. The proposed weighted ensemble architecture has been evaluated on publicly available and locally collected brain MRIs of four classes using various metrics. The results showed that leveraging the benefits of individual components of the proposed architecture leads to improved performance using ablation studies.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"63 3","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141114061","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}
AlgorithmsPub Date : 2024-05-20DOI: 10.3390/a17050220
Yiqun Zhang, Honglei Xu, Yang Li, G. Lin, Liyuan Zhang, Chaoyang Tao, Yonghong Wu
{"title":"An Integer-Fractional Gradient Algorithm for Back Propagation Neural Networks","authors":"Yiqun Zhang, Honglei Xu, Yang Li, G. Lin, Liyuan Zhang, Chaoyang Tao, Yonghong Wu","doi":"10.3390/a17050220","DOIUrl":"https://doi.org/10.3390/a17050220","url":null,"abstract":"This paper proposes a new optimization algorithm for backpropagation (BP) neural networks by fusing integer-order differentiation and fractional-order differentiation, while fractional-order differentiation has significant advantages in describing complex phenomena with long-term memory effects and nonlocality, its application in neural networks is often limited by a lack of physical interpretability and inconsistencies with traditional models. To address these challenges, we propose a mixed integer-fractional (MIF) gradient descent algorithm for the training of neural networks. Furthermore, a detailed convergence analysis of the proposed algorithm is provided. Finally, numerical experiments illustrate that the new gradient descent algorithm not only speeds up the convergence of the BP neural networks but also increases their classification accuracy.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"58 26","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141121803","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}
AlgorithmsPub Date : 2024-05-18DOI: 10.3390/a17050219
Abraham P. Punnen, Jasdeep Dhahan
{"title":"The Knapsack Problem with Conflict Pair Constraints on Bipartite Graphs and Extensions","authors":"Abraham P. Punnen, Jasdeep Dhahan","doi":"10.3390/a17050219","DOIUrl":"https://doi.org/10.3390/a17050219","url":null,"abstract":"In this paper, we study the knapsack problem with conflict pair constraints. After a thorough literature survey on the topic, our study focuses on the special case of bipartite conflict graphs. For complete bipartite (multipartite) conflict graphs, the problem is shown to be NP-hard but solvable in pseudo-polynomial time, and it admits an FPTAS. Extensions of these results to more general classes of graphs are also presented. Further, a class of integer programming models for the general knapsack problem with conflict pair constraints is presented, which generalizes and unifies the existing formulations. The strength of the LP relaxations of these formulations is analyzed, and we discuss different ways to tighten them. Experimental comparisons of these models are also presented to assess their relative strengths. This analysis disclosed various strong and weak points of different formulations of the problem and their relationships to different types of problem data. This information can be used in designing special purpose algorithms for KPCC involving a learning component.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"103 30","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141124920","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}
AlgorithmsPub Date : 2024-04-24DOI: 10.3390/a17050174
Qianqian Zhen, Liang Wu, Guoying Liu
{"title":"An Oracle Bone Inscriptions Detection Algorithm Based on Improved YOLOv8","authors":"Qianqian Zhen, Liang Wu, Guoying Liu","doi":"10.3390/a17050174","DOIUrl":"https://doi.org/10.3390/a17050174","url":null,"abstract":"Ancient Chinese characters known as oracle bone inscriptions (OBIs) were inscribed on turtle shells and animal bones, and they boast a rich history dating back over 3600 years. The detection of OBIs is one of the most basic tasks in OBI research. The current research aimed to determine the precise location of OBIs with rubbing images. Given the low clarity, severe noise, and cracks in oracle bone inscriptions, the mainstream networks within the realm of deep learning possess low detection accuracy on the OBI detection dataset. To address this issue, this study analyzed the significant research progress in oracle bone script detection both domestically and internationally. Then, based on the YOLOv8 algorithm, according to the characteristics of OBI rubbing images, the algorithm was improved accordingly. The proposed algorithm added a small target detection head, modified the loss function, and embedded a CBAM. The results show that the improved model achieves an F-measure of 84.3%, surpassing the baseline model by approximately 1.8%.","PeriodicalId":502609,"journal":{"name":"Algorithms","volume":"41 10","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140661347","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}