Pub Date : 2024-01-11DOI: 10.1007/s12559-023-10233-5
Abstract
Driver drowsiness is a significant concern and one of the leading causes of traffic accidents. Advances in cognitive neuroscience and computer science have enabled the detection of drivers’ drowsiness using Brain-Computer Interfaces (BCIs) and Machine Learning (ML). However, the literature lacks a comprehensive evaluation of drowsiness detection performance using a heterogeneous set of ML algorithms, being also necessary to study the performance of scalable ML models suitable for groups of subjects. To address these limitations, this work presents an intelligent framework employing BCIs and features based on electroencephalography for detecting drowsiness in driving scenarios. The SEED-VIG dataset is used to evaluate the best-performing models for individual subjects and groups. Results show that Random Forest (RF) outperformed other models used in the literature, such as Support Vector Machine (SVM), with a 78% f1-score for individual models. Regarding scalable models, RF reached a 79% f1-score, demonstrating the effectiveness of these approaches. This publication highlights the relevance of exploring a diverse set of ML algorithms and scalable approaches suitable for groups of subjects to improve drowsiness detection systems and ultimately reduce the number of accidents caused by driver fatigue. The lessons learned from this study show that not only SVM but also other models not sufficiently explored in the literature are relevant for drowsiness detection. Additionally, scalable approaches are effective in detecting drowsiness, even when new subjects are evaluated. Thus, the proposed framework presents a novel approach for detecting drowsiness in driving scenarios using BCIs and ML.
摘要 驾驶员嗜睡是一个备受关注的问题,也是导致交通事故的主要原因之一。认知神经科学和计算机科学的进步使得利用脑机接口(BCI)和机器学习(ML)检测驾驶员嗜睡成为可能。然而,文献中缺乏对使用异构 ML 算法集进行嗜睡检测性能的全面评估,而且有必要研究适用于受试者群体的可扩展 ML 模型的性能。为了解决这些局限性,本研究提出了一种智能框架,利用基于脑电图的 BCI 和特征来检测驾驶场景中的嗜睡状态。SEED-VIG 数据集用于评估单个受试者和群体的最佳表现模型。结果表明,随机森林(RF)的表现优于文献中使用的其他模型,如支持向量机(SVM),单个模型的 f1 分数为 78%。在可扩展模型方面,RF 的 f1 分数达到了 79%,证明了这些方法的有效性。这篇论文强调了探索适用于受试者群体的多种 ML 算法和可扩展方法对于改进嗜睡检测系统并最终减少因驾驶员疲劳导致的事故数量的意义。从这项研究中汲取的经验教训表明,不仅 SVM,文献中未充分探讨的其他模型也与嗜睡检测相关。此外,可扩展的方法在检测嗜睡时也很有效,即使在评估新的受试者时也是如此。因此,所提出的框架提供了一种利用 BCI 和 ML 检测驾驶场景中嗜睡状态的新方法。
{"title":"Studying Drowsiness Detection Performance While Driving Through Scalable Machine Learning Models Using Electroencephalography","authors":"","doi":"10.1007/s12559-023-10233-5","DOIUrl":"https://doi.org/10.1007/s12559-023-10233-5","url":null,"abstract":"<h3>Abstract</h3> <p>Driver drowsiness is a significant concern and one of the leading causes of traffic accidents. Advances in cognitive neuroscience and computer science have enabled the detection of drivers’ drowsiness using Brain-Computer Interfaces (BCIs) and Machine Learning (ML). However, the literature lacks a comprehensive evaluation of drowsiness detection performance using a heterogeneous set of ML algorithms, being also necessary to study the performance of scalable ML models suitable for groups of subjects. To address these limitations, this work presents an intelligent framework employing BCIs and features based on electroencephalography for detecting drowsiness in driving scenarios. The SEED-VIG dataset is used to evaluate the best-performing models for individual subjects and groups. Results show that Random Forest (RF) outperformed other models used in the literature, such as Support Vector Machine (SVM), with a 78% f1-score for individual models. Regarding scalable models, RF reached a 79% f1-score, demonstrating the effectiveness of these approaches. This publication highlights the relevance of exploring a diverse set of ML algorithms and scalable approaches suitable for groups of subjects to improve drowsiness detection systems and ultimately reduce the number of accidents caused by driver fatigue. The lessons learned from this study show that not only SVM but also other models not sufficiently explored in the literature are relevant for drowsiness detection. Additionally, scalable approaches are effective in detecting drowsiness, even when new subjects are evaluated. Thus, the proposed framework presents a novel approach for detecting drowsiness in driving scenarios using BCIs and ML.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"24 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2024-01-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139460372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-30DOI: 10.1007/s12559-023-10244-2
Amit Chougule, Agneya Bhardwaj, Vinay Chamola, Pratik Narang
Image hazing poses a significant challenge in various computer vision applications, degrading the visual quality and reducing the perceptual clarity of captured scenes. The proposed AGD-Net utilizes a U-Net style architecture with an Attention-Guided Dense Inception encoder-decoder framework. Unlike existing methods that heavily rely on synthetic datasets which are based on CARLA simulation, our model is trained and evaluated exclusively on realistic data, enabling its effectiveness and reliability in practical scenarios. The key innovation of AGD-Net lies in its attention-guided mechanism, which empowers the network to focus on crucial information within hazy images and effectively suppress artifacts during the dehazing process. The dense inception modules further advance the representation capabilities of the model, facilitating the extraction of intricate features from the input images. To assess the performance of AGD-Net, a detailed experimental analysis is conducted on four benchmark haze datasets. The results show that AGD-Net significantly outperforms the state-of-the-art methods in terms of PSNR and SSIM. Moreover, a visual comparison of the dehazing results further validates the superior performance gains achieved by AGD-Net over other methods. By leveraging realistic data exclusively, AGD-Net overcomes the limitations associated with synthetic datasets which are based on CARLA simulation, ensuring its adaptability and effectiveness in real-world circumstances. The proposed AGD-Net offers a robust and reliable solution for single-image dehazing, presenting a significant advancement over existing methods.
{"title":"AGD-Net: Attention-Guided Dense Inception U-Net for Single-Image Dehazing","authors":"Amit Chougule, Agneya Bhardwaj, Vinay Chamola, Pratik Narang","doi":"10.1007/s12559-023-10244-2","DOIUrl":"https://doi.org/10.1007/s12559-023-10244-2","url":null,"abstract":"<p>Image hazing poses a significant challenge in various computer vision applications, degrading the visual quality and reducing the perceptual clarity of captured scenes. The proposed AGD-Net utilizes a U-Net style architecture with an Attention-Guided Dense Inception encoder-decoder framework. Unlike existing methods that heavily rely on synthetic datasets which are based on CARLA simulation, our model is trained and evaluated exclusively on realistic data, enabling its effectiveness and reliability in practical scenarios. The key innovation of AGD-Net lies in its attention-guided mechanism, which empowers the network to focus on crucial information within hazy images and effectively suppress artifacts during the dehazing process. The dense inception modules further advance the representation capabilities of the model, facilitating the extraction of intricate features from the input images. To assess the performance of AGD-Net, a detailed experimental analysis is conducted on four benchmark haze datasets. The results show that AGD-Net significantly outperforms the state-of-the-art methods in terms of PSNR and SSIM. Moreover, a visual comparison of the dehazing results further validates the superior performance gains achieved by AGD-Net over other methods. By leveraging realistic data exclusively, AGD-Net overcomes the limitations associated with synthetic datasets which are based on CARLA simulation, ensuring its adaptability and effectiveness in real-world circumstances. The proposed AGD-Net offers a robust and reliable solution for single-image dehazing, presenting a significant advancement over existing methods.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"7 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139067431","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-28DOI: 10.1007/s12559-023-10234-4
Marta Balagué-Marmaña, Laura Dempere-Marco
Working memory (WM) is a crucial cognitive function required to maintain and manipulate information that is no longer present through the senses. Two key features of WM are its limited capacity and the emergence of serial order effects. This study investigates how synaptic facilitation and diverse display dynamics influence the encoding and retention of multiple items in WM. A biophysically inspired attractor model of WM, endowed with synaptic facilitation, is considered in this study. The investigation delves into the behaviour of the model under both sequential and simultaneous display protocols. Synaptic facilitation plays a crucial role in establishing the response of the WM system by regulating resource allocation during the encoding stage. It boosts WM capacity and is a key mechanism in the emergence of serial order effects. The synaptic facilitation time constant ((tau _F)) is critical in modulating these effects, and its heterogeneity in the prefrontal cortex (PFC) may contribute to the combination of primacy and recency effects observed experimentally. Additionally, we demonstrate that the WM capacity exhibited by the network is heavily influenced by factors such as the stimuli nature, and their display duration. Although the network connectivity determines the WM capacity by regulating the excitation-inhibition balance, the display protocol modulates its effective limit. Our findings shed light on how different stimulation protocol dynamics affect WM, underscoring the importance of synaptic facilitation and experimental protocol design in modulating WM capacity.
{"title":"Synaptic Facilitation: A Key Biological Mechanism for Resource Allocation in Computational Models of Working Memory","authors":"Marta Balagué-Marmaña, Laura Dempere-Marco","doi":"10.1007/s12559-023-10234-4","DOIUrl":"https://doi.org/10.1007/s12559-023-10234-4","url":null,"abstract":"<p>Working memory (WM) is a crucial cognitive function required to maintain and manipulate information that is no longer present through the senses. Two key features of WM are its limited capacity and the emergence of serial order effects. This study investigates how synaptic facilitation and diverse display dynamics influence the encoding and retention of multiple items in WM. A biophysically inspired attractor model of WM, endowed with synaptic facilitation, is considered in this study. The investigation delves into the behaviour of the model under both sequential and simultaneous display protocols. Synaptic facilitation plays a crucial role in establishing the response of the WM system by regulating resource allocation during the encoding stage. It boosts WM capacity and is a key mechanism in the emergence of serial order effects. The synaptic facilitation time constant (<span>(tau _F)</span>) is critical in modulating these effects, and its heterogeneity in the prefrontal cortex (PFC) may contribute to the combination of primacy and recency effects observed experimentally. Additionally, we demonstrate that the WM capacity exhibited by the network is heavily influenced by factors such as the stimuli nature, and their display duration. Although the network connectivity determines the WM capacity by regulating the excitation-inhibition balance, the display protocol modulates its effective limit. Our findings shed light on how different stimulation protocol dynamics affect WM, underscoring the importance of synaptic facilitation and experimental protocol design in modulating WM capacity.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"33 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139067372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-28DOI: 10.1007/s12559-023-10228-2
Yejin Kim, David Camacho, Chang Choi
In recent times, there has been active research on multi-disease classification that aim to diagnose lung diseases and respiratory conditions using respiratory data. Recorded respiratory data can be used to diagnose various chronic diseases, such as asthma and pneumonia by applying different feature extraction methods. Previous studies have primarily focused on respiratory disease classification using 2D image conversion techniques, such as spectrograms and mel frequency cepstral coefficients (MFCC) for respiratory data. However, as the number of respiratory disease classes increased, the classification accuracy tended to decrease. To address this challenge, this study proposes a novel approach that combines 1D and 2D data to enhance the multi-classification performance regarding respiratory disease. We incorporated widely used 2D representations such as spectrograms, gammatone-based spectrograms, and MFCC images, along with raw data. The proposed respiratory disease classification method comprises 2D data conversion, combined data generation, classification model development, and multi-disease classification steps. Our method achieved high classification accuracies of 92.93%, 91.30%, and 88.58% using the TCN, Wavenet, and BiLSTM models, respectively. Compared to using solely 1D data, our approach demonstrated a 4.89% improvement in accuracy and more than 3 times better training speed when using only 2D data. These results confirmed the superiority of the proposed method. This allows us to leverage the advantages of fast learning provided by time-series models, as well as the high classification accuracy demonstrated by 2D image approaches.
{"title":"Real-Time Multi-Class Classification of Respiratory Diseases Through Dimensional Data Combinations","authors":"Yejin Kim, David Camacho, Chang Choi","doi":"10.1007/s12559-023-10228-2","DOIUrl":"https://doi.org/10.1007/s12559-023-10228-2","url":null,"abstract":"<p>In recent times, there has been active research on multi-disease classification that aim to diagnose lung diseases and respiratory conditions using respiratory data. Recorded respiratory data can be used to diagnose various chronic diseases, such as asthma and pneumonia by applying different feature extraction methods. Previous studies have primarily focused on respiratory disease classification using 2D image conversion techniques, such as spectrograms and mel frequency cepstral coefficients (MFCC) for respiratory data. However, as the number of respiratory disease classes increased, the classification accuracy tended to decrease. To address this challenge, this study proposes a novel approach that combines 1D and 2D data to enhance the multi-classification performance regarding respiratory disease. We incorporated widely used 2D representations such as spectrograms, gammatone-based spectrograms, and MFCC images, along with raw data. The proposed respiratory disease classification method comprises 2D data conversion, combined data generation, classification model development, and multi-disease classification steps. Our method achieved high classification accuracies of 92.93%, 91.30%, and 88.58% using the TCN, Wavenet, and BiLSTM models, respectively. Compared to using solely 1D data, our approach demonstrated a 4.89% improvement in accuracy and more than 3 times better training speed when using only 2D data. These results confirmed the superiority of the proposed method. This allows us to leverage the advantages of fast learning provided by time-series models, as well as the high classification accuracy demonstrated by 2D image approaches.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"10 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139067887","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-26DOI: 10.1007/s12559-023-10237-1
Li Gao, Yi Liu, Jianmin Zhu, Zhen Yu
Because the abstracts contain complex information and the labels of abstracts do not contain information about categories, it is difficult for cognitive models to extract comprehensive features to match the corresponding labels. In this paper, a cognitively inspired multi-granularity model incorporating label information (LIMG) is proposed to solve these problems. Firstly, we use information of abstracts to give labels the actual semantics. It can improve the semantic representation of word embeddings. Secondly, the model uses the dual channel pooling convolutional neural network (DCP-CNN) and the timescale shrink gated recurrent units (TSGRU) to extract multi-granularity information of abstracts. One of the channels in DCP-CNN highlights the key content and the other is used for TSGRU to extract context-related features of abstracts. Finally, TSGRU adds a timescale to retain the long-term dependence by recuring the past information and a soft thresholding algorithm to realize the noise reduction. Experiments were carried out on four benchmark datasets: Arxiv Academic Paper Dataset (AAPD), Web of Science (WOS), Amazon Review and Yahoo! Answers. As compared to the baseline models, the accuracy is improved by up to 3.36%. On AAPD (54,840 abstracts) and WOS (46,985 abstracts) datasets, the micro-F1 score reached 75.62% and 81.68%, respectively. The results show that acquiring label semantics from abstracts can enhance text representations and multi-granularity feature extraction can inspire the cognitive system’s understanding of the complex information in abstracts.
{"title":"A Cognitively Inspired Multi-granularity Model Incorporating Label Information for Complex Long Text Classification","authors":"Li Gao, Yi Liu, Jianmin Zhu, Zhen Yu","doi":"10.1007/s12559-023-10237-1","DOIUrl":"https://doi.org/10.1007/s12559-023-10237-1","url":null,"abstract":"<p>Because the abstracts contain complex information and the labels of abstracts do not contain information about categories, it is difficult for cognitive models to extract comprehensive features to match the corresponding labels. In this paper, a cognitively inspired multi-granularity model incorporating label information (LIMG) is proposed to solve these problems. Firstly, we use information of abstracts to give labels the actual semantics. It can improve the semantic representation of word embeddings. Secondly, the model uses the dual channel pooling convolutional neural network (DCP-CNN) and the timescale shrink gated recurrent units (TSGRU) to extract multi-granularity information of abstracts. One of the channels in DCP-CNN highlights the key content and the other is used for TSGRU to extract context-related features of abstracts. Finally, TSGRU adds a timescale to retain the long-term dependence by recuring the past information and a soft thresholding algorithm to realize the noise reduction. Experiments were carried out on four benchmark datasets: Arxiv Academic Paper Dataset (AAPD), Web of Science (WOS), Amazon Review and Yahoo! Answers. As compared to the baseline models, the accuracy is improved by up to 3.36%. On AAPD (54,840 abstracts) and WOS (46,985 abstracts) datasets, the micro-F1 score reached 75.62% and 81.68%, respectively. The results show that acquiring label semantics from abstracts can enhance text representations and multi-granularity feature extraction can inspire the cognitive system’s <i>understanding</i> of the complex information in abstracts.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"28 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139054474","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-19DOI: 10.1007/s12559-023-10229-1
Chenyang Song, Zeshui Xu, Yixin Zhang
The psychological factors of experts play a special role in the process of decision-making, especially in some situations that experts are not completely rational. Traditional decision-making methods always just focus on the aggregation of positive preference information, which do not take the negative attribute information into account at the same time. The probabilistic dual hesitant fuzzy set (PDHFS) is one of the latest fuzzy sets, which can depict experts’ positive and negative preference information with the corresponding probability at the same time. Therefore, to manage the applications with incomplete rationality and two opposite kinds of uncertain preference information, this paper considers the influence of psychological behavior on decision-making results and introduces an interactive method based on the prospect theory. Taking the advantages of PDHFSs in group decision-making problems, we propose the distance measure of PDHFSs, based on which an improved TODIM (TOmada deDecisão Iterativa Multicritério) method under the probabilistic dual hesitant fuzzy environment is also developed. Meanwhile, we provide the specific implementation process of the proposed method. The proposed improved TODIM is applied to the risk evaluation of Arctic geopolitics. We also make a comparison with the traditional aggregation method of PDHFSs. The difference among alternatives obtained by the proposed TODIM method with prospect theory is much greater than the traditional aggregation methods without prospect theory. This paper highlights the benefits and advantages of the proposed TODIM method that is developed based on the prospect theory and probabilistic dual hesitant fuzzy distance measure.
{"title":"An Enhanced Interactive and Multi-criteria Decision-Making (TODIM) Method with Probabilistic Dual Hesitant Fuzzy Sets for Risk Evaluation of Arctic Geopolitics","authors":"Chenyang Song, Zeshui Xu, Yixin Zhang","doi":"10.1007/s12559-023-10229-1","DOIUrl":"https://doi.org/10.1007/s12559-023-10229-1","url":null,"abstract":"<p>The psychological factors of experts play a special role in the process of decision-making, especially in some situations that experts are not completely rational. Traditional decision-making methods always just focus on the aggregation of positive preference information, which do not take the negative attribute information into account at the same time. The probabilistic dual hesitant fuzzy set (PDHFS) is one of the latest fuzzy sets, which can depict experts’ positive and negative preference information with the corresponding probability at the same time. Therefore, to manage the applications with incomplete rationality and two opposite kinds of uncertain preference information, this paper considers the influence of psychological behavior on decision-making results and introduces an interactive method based on the prospect theory. Taking the advantages of PDHFSs in group decision-making problems, we propose the distance measure of PDHFSs, based on which an improved TODIM (TOmada deDecisão Iterativa Multicritério) method under the probabilistic dual hesitant fuzzy environment is also developed. Meanwhile, we provide the specific implementation process of the proposed method. The proposed improved TODIM is applied to the risk evaluation of Arctic geopolitics. We also make a comparison with the traditional aggregation method of PDHFSs. The difference among alternatives obtained by the proposed TODIM method with prospect theory is much greater than the traditional aggregation methods without prospect theory. This paper highlights the benefits and advantages of the proposed TODIM method that is developed based on the prospect theory and probabilistic dual hesitant fuzzy distance measure.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"76 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138742830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-12DOI: 10.1007/s12559-023-10223-7
Ziming Wang, Hui Wang, Xin Wang, Ning Pang, Quan Shi
This paper focuses on the adaptive control issue for a class of uncertain nonlinear systems subject to full state constraints and external disturbance. A novel adaptive nonlinear observer is proposed to compensate for disturbance variables in the transformed system. Combining with radial basis function neural networks (RBFNNs) and nonlinear mapping (NM) mechanism, the constrained system is transformed into an unconstrained form and the system uncertainties are effectively handled. Besides that, an adaptive tracking control approach is formulated by invoking backstepping techniques and the event-sampled scheme is utilized to address the sparsity of resources. The adaptive control problem can be addressed with the proposed algorithm, applying the Lyapunov functions, RBF NNs theory, and inequality techniques. Based on the Lyapunov stability theory, it is proved that the system can never violate the specified state constraints and all the closed-loop signals are semiglobally uniformly ultimately bounded (SGUUB). The validity of the proposed approach is well illustrated by a developed numerical example.
{"title":"Event-Triggered Adaptive Neural Control for Full State-Constrained Nonlinear Systems with Unknown Disturbances","authors":"Ziming Wang, Hui Wang, Xin Wang, Ning Pang, Quan Shi","doi":"10.1007/s12559-023-10223-7","DOIUrl":"https://doi.org/10.1007/s12559-023-10223-7","url":null,"abstract":"<p>This paper focuses on the adaptive control issue for a class of uncertain nonlinear systems subject to full state constraints and external disturbance. A novel adaptive nonlinear observer is proposed to compensate for disturbance variables in the transformed system. Combining with radial basis function neural networks (RBFNNs) and nonlinear mapping (NM) mechanism, the constrained system is transformed into an unconstrained form and the system uncertainties are effectively handled. Besides that, an adaptive tracking control approach is formulated by invoking backstepping techniques and the event-sampled scheme is utilized to address the sparsity of resources. The adaptive control problem can be addressed with the proposed algorithm, applying the Lyapunov functions, RBF NNs theory, and inequality techniques. Based on the Lyapunov stability theory, it is proved that the system can never violate the specified state constraints and all the closed-loop signals are semiglobally uniformly ultimately bounded (SGUUB). The validity of the proposed approach is well illustrated by a developed numerical example.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"7 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138575180","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-07DOI: 10.1007/s12559-023-10226-4
Zhenghongyuan Ni, Ye Jin, Peng Liu, Wei Zhao
In realistic sparse reward tasks, existing theoretical methods cannot be effectively applied due to the low sampling probability ofrewarded episodes. Profound research on methods based on intrinsic rewards has been conducted to address this issue, but exploration with sparse rewards remains a great challenge. This paper describes the loop enhancement effect in exploration processes with sparse rewards. After each fully trained iteration, the execution probability of ineffective actions is higher than thatof other suboptimal actions, which violates biological habitual behavior principles and is not conducive to effective training. This paper proposes corresponding theorems of relieving the loop enhancement effect in the exploration process with sparse rewards and a heuristic exploration method based on action effectiveness constraints (AEC), which improves policy training efficiency by relieving the loop enhancement effect. Inspired by the fact that animals form habitual behaviors and goal-directed behaviors through the dorsolateral striatum and dorsomedial striatum. The function of the dorsolateral striatum is simulated by an action effectiveness evaluation mechanism (A2EM), which aims to reduce the rate of ineffective samples and improve episode reward expectations. The function of the dorsomedial striatum is simulated by an agent policy network, which aims to achieve task goals. The iterative training of A2EM and the policy forms the AEC model structure. A2EM provides effective samples for the agent policy; the agent policy provides training constraints for A2EM. The experimental results show that A2EM can relieve the loop enhancement effect and has good interpretability and generalizability. AEC enables agents to effectively reduce the loop rate in samples, can collect more effective samples, and improve the efficiency of policy training. The performance of AEC demonstrates the effectiveness of a biological heuristic approach that simulates the function of the dorsal striatum. This approach can be used to improve the robustness of agent exploration with sparse rewards.
{"title":"A Novel Heuristic Exploration Method Based on Action Effectiveness Constraints to Relieve Loop Enhancement Effect in Reinforcement Learning with Sparse Rewards","authors":"Zhenghongyuan Ni, Ye Jin, Peng Liu, Wei Zhao","doi":"10.1007/s12559-023-10226-4","DOIUrl":"https://doi.org/10.1007/s12559-023-10226-4","url":null,"abstract":"<p>In realistic sparse reward tasks, existing theoretical methods cannot be effectively applied due to the low sampling probability ofrewarded episodes. Profound research on methods based on intrinsic rewards has been conducted to address this issue, but exploration with sparse rewards remains a great challenge. This paper describes the loop enhancement effect in exploration processes with sparse rewards. After each fully trained iteration, the execution probability of ineffective actions is higher than thatof other suboptimal actions, which violates biological habitual behavior principles and is not conducive to effective training. This paper proposes corresponding theorems of relieving the loop enhancement effect in the exploration process with sparse rewards and a heuristic exploration method based on action effectiveness constraints (AEC), which improves policy training efficiency by relieving the loop enhancement effect. Inspired by the fact that animals form habitual behaviors and goal-directed behaviors through the dorsolateral striatum and dorsomedial striatum. The function of the dorsolateral striatum is simulated by an action effectiveness evaluation mechanism (A2EM), which aims to reduce the rate of ineffective samples and improve episode reward expectations. The function of the dorsomedial striatum is simulated by an agent policy network, which aims to achieve task goals. The iterative training of A2EM and the policy forms the AEC model structure. A2EM provides effective samples for the agent policy; the agent policy provides training constraints for A2EM. The experimental results show that A2EM can relieve the loop enhancement effect and has good interpretability and generalizability. AEC enables agents to effectively reduce the loop rate in samples, can collect more effective samples, and improve the efficiency of policy training. The performance of AEC demonstrates the effectiveness of a biological heuristic approach that simulates the function of the dorsal striatum. This approach can be used to improve the robustness of agent exploration with sparse rewards.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"46 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138548064","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-12-07DOI: 10.1007/s12559-023-10224-6
Ibrahim Salim, A. Ben Hamza
While graph convolution-based methods have become the de-facto standard for graph representation learning, their applications to disease prediction tasks remain quite limited, particularly in the classification of neurodevelopmental and neurodegenerative brain disorders. In this paper, we introduce an aggregator normalization graph convolutional network by leveraging aggregation in graph sampling, as well as skip connections and identity mapping. The proposed model learns discriminative graph node representations by incorporating both imaging and non-imaging features into the graph nodes and edges, respectively, with the aim of augmenting predictive capabilities and providing a holistic perspective on the underlying mechanisms of brain disorders. Skip connections enable the direct flow of information from the input features to later layers of the network, while identity mapping helps maintain the structural information of the graph during feature learning. We benchmark our model against several recent baseline methods on two large datasets, Autism Brain Imaging Data Exchange (ABIDE) and Alzheimer’s Disease Neuroimaging Initiative (ADNI), for the prediction of autism spectrum disorder and Alzheimer’s disease, respectively. Experimental results demonstrate the competitive performance of our approach in comparison with recent baselines in terms of several evaluation metrics, achieving relative improvements of 50% and 13.56% in classification accuracy over graph convolutional networks (GCNs) on ABIDE and ADNI, respectively. Our study involved the development of a graph convolutional aggregation model, which aimed to predict the status of subjects in a population graph. We learned discriminative node representations by utilizing imaging and non-imaging features associated with the graph nodes and edges. Our model outperformed existing graph convolutional-based methods for disease prediction on two large benchmark datasets, as shown through extensive experiments. We achieved significant relative improvements in classification accuracy over GCN and other strong baselines.
{"title":"Classification of Developmental and Brain Disorders via Graph Convolutional Aggregation","authors":"Ibrahim Salim, A. Ben Hamza","doi":"10.1007/s12559-023-10224-6","DOIUrl":"https://doi.org/10.1007/s12559-023-10224-6","url":null,"abstract":"<p>While graph convolution-based methods have become the de-facto standard for graph representation learning, their applications to disease prediction tasks remain quite limited, particularly in the classification of neurodevelopmental and neurodegenerative brain disorders. In this paper, we introduce an aggregator normalization graph convolutional network by leveraging aggregation in graph sampling, as well as skip connections and identity mapping. The proposed model learns discriminative graph node representations by incorporating both imaging and non-imaging features into the graph nodes and edges, respectively, with the aim of augmenting predictive capabilities and providing a holistic perspective on the underlying mechanisms of brain disorders. Skip connections enable the direct flow of information from the input features to later layers of the network, while identity mapping helps maintain the structural information of the graph during feature learning. We benchmark our model against several recent baseline methods on two large datasets, Autism Brain Imaging Data Exchange (ABIDE) and Alzheimer’s Disease Neuroimaging Initiative (ADNI), for the prediction of autism spectrum disorder and Alzheimer’s disease, respectively. Experimental results demonstrate the competitive performance of our approach in comparison with recent baselines in terms of several evaluation metrics, achieving relative improvements of 50% and 13.56% in classification accuracy over graph convolutional networks (GCNs) on ABIDE and ADNI, respectively. Our study involved the development of a graph convolutional aggregation model, which aimed to predict the status of subjects in a population graph. We learned discriminative node representations by utilizing imaging and non-imaging features associated with the graph nodes and edges. Our model outperformed existing graph convolutional-based methods for disease prediction on two large benchmark datasets, as shown through extensive experiments. We achieved significant relative improvements in classification accuracy over GCN and other strong baselines.</p>","PeriodicalId":51243,"journal":{"name":"Cognitive Computation","volume":"17 1","pages":""},"PeriodicalIF":5.4,"publicationDate":"2023-12-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138547890","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}