检索结果-内蒙古大学图书馆

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3690-3702页

作者： Xiao, Jiang-Wen Fang, Hongliang Wang, Yan-Wu Huazhong University of Science and Technology Ministry of Education School of Artificial Intelligence and Automation The Key Laboratory of Image Processing and Intelligent Control Wuhan430074 China

Short-term residential load forecasting is essential to demand side response. However, the frequent spikes in the load and the volatile daily load patterns make it difficult to accurately forecast the load. To deal with these problems, this article proposes a smoothing clustering method for daily load clustering and a pooling-ensemble model for one day ahead load forecasting. The whole short-term load forecasting framework in this article contains three steps. Specifically and first, the states of the residents are obtained by clustering the daily load curves with the proposed smoothing clustering method. Second, a weighted mixed Markov model is built to predict the probability distribution of the load state in the next day. Third, multiple predictors in the pooling-ensemble model are selected for different states and the load is forecasted by weighing the results of the multiple predictors based on the predicted states. Results of the case studies and comparison studies on two public datasets verify the advantages of the smoothing clustering method and the pooling-ensemble model. © 2020 IEEE.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Transmission-Constrained Consensus of Multiagent Networks

引用

IEEE Transactions on control of Network Systems 2023年第3期10卷 1484-1495页

作者： Wang, Xiaotian Su, Housheng Huazhong University of Science and Technology School of Artificial Intelligence and Automation Hubei430074 China Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China

This article studies the consensus problem for multiagent systems with transmission constraints. A novel model of multiagent systems is proposed where the information transmissions between agents are disturbed by irregular distortions or interferences (named transmission constraint functions), and this model is universal which can be applied in many cases, such as interval consensus and discarded consensus. In the transmission-constrained consensus problem, we obtain the necessary and sufficient condition that agents can converge to state consensus. Furthermore, a more general case is studied in which the system reaches an equilibrium. Based on some techniques of stability theory, the existence, uniqueness, and stability of the system equilibrium point can be proven, which means the system can reach an asymptotically stable equilibrium. Moreover, the state values of the equilibrium are only decided by the network structure and transmission constraint functions but not the agents' initial states. Finally, numerical simulations are presented to illustrate the proposed theorems and corollaries. © 2014 IEEE.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Bagging and Boosting Fine-Tuning for Ensemble Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第4期5卷 1728-1742页

作者： Zhao, Changming Peng, Ruimin Wu, Dongrui Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and TechnologyWuhan 430074 China and alsowith the ShenzhenHuazhong University of Science and Technology Research Institute Shenzhen 518029 China

Ensemble learning aggregates outputs from multiple base learners for better performance. Bootstrap aggregating (bagging) and boosting are two popular such approaches. They are suitable for integrating unstable base learners with large variance and weak base learners with large bias, respectively, but not base learners with small variance and/or bias, e.g., support vector machine, regularized logistic regression, and ridge regression. This article proposes two novel ensemble-learning-based fine-tuning approaches, boosting fine-tuning (BF) and bagging and boosting fine-tuning (BBF), to fine-tune learners with small variance and/or bias for better performance. BF embeds boosting in a single hidden layer neural network. In each iteration, BF first uses the Newton's method to generate a temporary training set, and then trains a boosting learner on it. BBF combines BF and bagging. It first uses bootstrap to obtain multiple replicas of the training set, and then trains a BF learner on each replica. Extensive experiments on 46 real-world datasets demonstrated that BBF is flexible, robust, and effective, and can fine-tune many popular classifiers to achieve better generalization performance. © 2020 IEEE.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Semisupervised Transfer Boosting (SS-TrBoosting)

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第7期5卷 3431-3444页

作者： Deng, Lingfei Zhao, Changming Du, Zhenbang Xia, Kun Wu, Dongrui Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan 430074 China and also with Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen 518063 China

Semisupervised domain adaptation (SSDA) aims at training a high-performance model for a target domain using few labeled target data, many unlabeled target data, and plenty of auxiliary data from a source domain. Previous works in SSDA mainly focused on learning transferable representations across domains. However, it is difficult to find a feature space where the source and target domains share the same conditional probability distribution. Additionally, there is no flexible and effective strategy extending existing unsupervised domain adaptation (UDA) approaches to SSDA settings. In order to solve the above two challenges, we propose a novel fine-tuning framework, semisupervised transfer boosting (SS-TrBoosting). Given a well-trained deep learning-based UDA or SSDA model, we use it as the initial model, generate additional base learners by boosting, and then use all of them as an ensemble. More specifically, half of the base learners are generated by supervised domain adaptation, and half by semisupervised learning. Furthermore, for more efficient data transmission and better data privacy protection, we propose a source data generation approach to extend SS-TrBoosting to semisupervised source-free domain adaptation (SS-SFDA). Extensive experiments showed that SS-TrBoosting can be applied to a variety of existing UDA, SSDA, and SFDA approaches to further improve their performance. © 2020 IEEE.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

A Dual-branch Model for Early Detection of Alzheimer's Disease Using Resting-state fMRI 7

A Dual-branch Model for Early Detection of Alzheimer's Disea...

引用

7th IEEE Advanced Information Technology, Electronic and Automation control Conference, IAEAC 2024

作者： Wang, Yixuan Li, Wei Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan China Image Processing and Intelligent Control Key Laboratory of the Education Ministry of China Wuhan China

ISBN: (纸本)9798350339161

Alzheimer's disease (AD) is the most prevalent form of dementia, and early diagnosis is crucial for delaying and treating AD. Resting-state functional magnetic resonance imaging (rs-fMRI), a widely used medical imaging technique, offers rich temporal and spatial data, which has led researchers to explore various feature extraction methods based on rs-fMRI images for AD identification. However, the related work still suffers from insufficient utilization of temporal and spatial information which leads to unsatisfactory early diagnosis. In this study, we propose a dual-branch fusion model to extract spatial-temporal features from rs-fMRI images. Our proposed model can extract temporal features at different levels. We developed a Class Activation Sequence (CAS) branch, which is a structure that emphasizes the function of each temporal node throughout the whole time series. Additionally, we created a time-domain local branch for local feature extraction. Further, we designed a fusion module for the model to describe temporal contextual relationships and fuse features at various levels. We tested the performance of the model on the ADNI dataset, and the experimental results show that compared with other algorithms, the dual-branch fusion model achieves higher classification accuracy on several classification tasks including early diagnosis, which proves the advantage of the dual-branch fusion model in temporal and spatial feature extraction for rs-fMRI images, and our work also provides a foundation for the temporal domain characterization of rs-fMRI images. © 2024 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Enhancing Resilience of Microgrid-Integrated Power Systems in Disaster Events Using Reinforcement Learning 1

引用

Chinese intelligent Automation Conference, CIAC 2023

作者： Zha, Zhongyi Wang, Bo Liu, Lei Fan, Huijin Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Artificial Intelligence and Automation School Huazhong University of Science and Technology Wuhan430074 China

ISBN: (数字)9789819961870

ISBN: (纸本)9789819961863

Enhancing the resilience of power systems has become increasingly important to mitigate the negative impact of risk attacks. Integrating microgrids, which are small-scale power grids that can operate independently or in conjunction with the main grid, has emerged as an effective energy source for emergency situations and can avoid power outages. Typhoons, which are inevitable and relatively easy to predict risk attacks, have become one of the contexts to examine power system resilience. In this paper, we propose a reinforcement learning algorithm that combines graph theory knowledge to make decisions for optimizing power system resilience with microgrids under the Typhoon event. The algorithm effectively utilizes graph theory knowledge and reduces the number of decisions required in the optimization process. Numerical experimental results show that compared to traditional methods, the reinforcement learning algorithm can more effectively respond to typhoon changes, achieve flexible economic control, and enhance the resilience of power systems with microgrids. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2023.

关键词： Numerical methods

来源：评论

学校读者我要写书评

暂无评论

RBP-Former: Joint Prediction of RNA-protein Binding Sites on Full-length RNA Transcripts for Multiple RBPs

RBP-Former: Joint Prediction of RNA-protein Binding Sites on...

引用

2024 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2024

作者： Li, Yichong Liu, Xiaojian Cheng, Fan Pan, Xiaoyong Yang, Yang Shanghai Jiao Tong University Department of Computer Science and Engineering Shanghai200240 China Shanghai Jiao Tong University Institute of Image Processing and Pattern Recognition Shanghai200240 China Ministry of Education of China Key Laboratory of System Control and Information Processing Shanghai200240 China Key Laboratory of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Shanghai200240 China

ISBN: (纸本)9798350386226

RNA-binding proteins (RBPs) are essential for gene expression, and the complex RNA-protein interaction mechanisms require analysis of global RNA information. Therefore, accurate prediction of RBP binding sites on full-length RNA transcripts is crucial for understanding these mechanisms and their roles in diseases. While machine learning methods can predict RBP binding to RNA fragments, extending this to full-length transcripts presents challenges due to sequence length and data imbalance. In this paper, we introduce RBP-Former, a binding site joint prediction model designed specifically for full-length RNA transcripts that can be used for multiple RBPs. This model processes information at both coarse and fine-grained levels to fully exploit sequence data and its interactions with multiple RBPs. We develop multi-level imbalance learning strategies, achieving favorable results on imbalanced data. Our method outperforms existing methods in predicting binding sites on full-length RNA transcripts for multiple RBPs, demonstrating its effectiveness in handling imbalanced label and sample distributions. © 2024 IEEE.

关键词： Binding sites

来源：评论

学校读者我要写书评

暂无评论

Emotion Prediction in Conversation Based on Relationship Extraction

Emotion Prediction in Conversation Based on Relationship Ext...

引用

2022 IEEE International Conference on Cyborg and Bionic Systems, CBS 2022

作者： Yingjian, Liu Xiaoping, Wang Shanglin, Lei Huazhong University of Science and Technology School of Artificial Intelligence and Automation Key Laboratory of Image Processing and Intelligent Control of Education Ministry of China Wuhan430074 China

ISBN: (纸本)9781665490283

With the development of human-computer interaction systems, emotion recognition in conversation (ERC) has attracted increasing interest in recent years. Motivated by recent studies which have proven that generating emotional conversation responses can effectively improve the performance of the ERC model. However, accurate emotional response is complicated due to the limited number of dialogue samples. Therefore, we propose a simple and effective framework for emotion prediction in conversation based on relationship extraction (DiaRP), consisting of two curricula: (1) Dialogue Relationship Capture (DRC);and (2) Next Emotion Prediction (NEP). In DRC, we capture the current emotional self-dependence and interpersonal dependence according to the influence of self and others on the current moment emotion in the conversation. We integrate self-dependence and interpersonal dependence for NEP to predict their emotional state without current utterance. We also measure the similarity between recognized emotion distribution and predicted emotion distribution by the KL divergence. With the proposed model-agnostic DiaRP strategy, we observe a significant performance improvement over a wide range of existing ERC models and achieve new state-of-the-art results on three public ERC datasets. © 2023 IEEE.

关键词： Emotion Recognition

来源：评论

学校读者我要写书评

暂无评论

Surrogate-Assisted Multiobjective Gene Selection for Cell Classification from Large-Scale Single-Cell RNA Sequencing Data

引用

IEEE Transactions on Evolutionary Computation 2025年第3期29卷 601-615页

作者： Lin, Jianqing He, Cheng Jiang, Hanjing Huang, Yabing Jin, Yaochu Huazhong University of Science and Technology Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Wuhan430074 China Huazhong University of Science and Technology State Key Laboratory of Advanced Electromagnetic Technology School of Electrical and Electronic Engineering Wuhan430074 China Renmin Hospital Department of Pathology Wuhan University Wuhan430060 China Westlake University Trustworth and General Artificial Intelligence Laboratory School of Engineering Hangzhou310030 China

Accurate cell classification is crucial but expensive for large-scale single-cell RNA sequencing (scRNA-seq) analysis. Gene selection (GS) emerges as a pivotal technique in identifying gene subsets of scRNA-seq for classification accuracy improvement and gene scale reduction. Nevertheless, the rising scale of scRNA-seq data presents challenges to existing GS methods regarding performance and computational time. Thus, we propose a surrogate-assisted evolutionary algorithm for multiobjective GS to address these deficiencies. An innovative two-phase initialization method is proposed to select sparse solutions to provide preliminary insights into gene contributions. Then, a binary competitive swarm optimizer is proposed for effective global search, where a local search method is embedded to eliminate irrelevant genes for efficiency consideration. Additionally, a surrogate model is adopted to forecast classification accuracy efficiently and substitutes part of the computationally expensive classification process. Experiments are conducted on eight large-scale scRNA-seq datasets with more than 20,000 genes. The effectiveness of the proposed GS method for scRNA-seq cell classification compared with eight state-of-the-art methods is validated. Gene expression analysis results of selected genes further validated the significance of the genes selected by the proposed method in the classification of scRNA-seq data. © 1997-2012 IEEE.

关键词： Gene expression

来源：评论

学校读者我要写书评

暂无评论

Learning Probabilistic Coordinate Fields for Robust Correspondences

引用

IEEE Transactions on Pattern Analysis and Machine Intelligence 2023年第10期45卷 12004-12021页

作者： Zhao, Weiyue Lu, Hao Ye, Xinyi Cao, Zhiguo Li, Xin Huazhong University of Science and Technology The Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Wuhan430074 China West Virginia University The Lane Department of Computer Science and Electrical Engineering MorgantownWV26506-6109 United States

We introduce Probabilistic Coordinate Fields (PCFs), a novel geometric-invariant coordinate representation for image correspondence problems. In contrast to standard Cartesian coordinates, PCFs encode coordinates in correspondence-specific barycentric coordinate systems (BCS) with affine invariance. To know when and where to trust the encoded coordinates, we implement PCFs in a probabilistic network termed PCF-Net, which parameterizes the distribution of coordinate fields as Gaussian mixture models. By jointly optimizing coordinate fields and their confidence conditioned on dense flows, PCF-Net can work with various feature descriptors when quantifying the reliability of PCFs by confidence maps. An interesting observation of this work is that the learned confidence map converges to geometrically coherent and semantically consistent regions, which facilitates robust coordinate representation. By delivering the confident coordinates to keypoint/feature descriptors, we show that PCF-Net can be used as a plug-in to existing correspondence-dependent approaches. Extensive experiments on both indoor and outdoor datasets suggest that accurate geometric invariant coordinates help to achieve the state of the art in several correspondence problems, such as sparse feature matching, dense image registration, camera pose estimation, and consistency filtering. Further, the interpretable confidence map predicted by PCF-Net can also be leveraged to other novel applications from texture transfer to multi-homography classification. © 1979-2012 IEEE.

关键词： image registration

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：