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

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Hierarchical Clustering Combination Method Using Intuitionistic Fuzzy Similarity in Software Module Clustering

Hierarchical Clustering Combination Method Using Intuitionis...

引用

2023 International Conference on Networking and Network Applications, NaNA 2023

作者： Xia, Hong Wang, Bo Zhang, Yongkang Chen, Yanping School of Computer Science and Technology Xi'an University of Posts and Telecommunications China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing China Xi 'An Key Laboratory of Big Data and Intelligent Computing Shaanxi Xi'an710121 China

ISBN: (纸本)9798350327380

In order to solve the problem that the similarity method used in software module clustering can produce arbitrary decision, and the description matrix of dendrogram generated by base clustering in hierarchical clustering combination does not consider more characteristics of entities, a hierarchical clustering combination method based on intuitionistic fuzzy similarity (HCC-IFS) was proposed. In the process of entity similarity calculation, the intuitionistic fuzzy set theory and similarity calculation method are used to provide membership and non-membership attributes for each entity, so as to improve the merging efficiency and solve arbitrary decision problems. In the description matrix representation of base clustering, the absolute and relative features obtained from the dendrogram are used to construct the description matrix, and the generated description matrix is combined. Finally, the proposed algorithm is verified by experiments. Experimental results show that HCC-IFS can produce better clustering results and improve the recovery quality of software architecture. © 2023 IEEE.

关键词： Fuzzy set theory

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

DFGR: Deep Feature Graph Representation for Predicting Knee Osteoarthritis 4

DFGR: Deep Feature Graph Representation for Predicting Knee ...

引用

4th International Conference on Neural Networks, Information and Communication Engineering, NNICE 2024

作者： Xu, Tao Dai, Dawei Wang, Yuqi Li, Gen Chongqing University of Posts and Telecommunications Key Laboratory of Big Data Intelligent Computing Chongqing China Shanghai Jiaotong University School of Medicine Department of Orthopedics Ruijin Hospital Shanghai China

ISBN: (纸本)9798350394375

Knee osteoarthritis (KOA) is a common joint disease that severely affects the normal lives of patients. In clinical practice, the severity of KOA is evaluated by observing the X-ray images of the knee joint, which is highly dependent on the subjective experience of the doctor. In this study, we developed a novel deep CNN model that integrates structural information processing to predict KOA severity automatically. Specifically, (1) The knee joint regions of the original X-ray images are segmented using automatic detection;(2) We employed a pre-trained deep CNN models to extract deep features of key regions, and construct their corresponding graph representations;(3) A graph attention network (GAT) was designed as a fine-tuning module to build a KOA prediction model. Experiments demonstrate that our method significantly improves the performance in multiple aspects. In addition, our method demonstrates good interpretability. Codes are available at https://***/ddw2AIGROUP2CQUPT/DFGR © 2024 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Model Predictive Current Control for Asymmetric Six-phase Permanent Magnet Motors with Less Computation and Optimized Voltage Vector Magnitude

Model Predictive Current Control for Asymmetric Six-phase Pe...

引用

2022 International Conference on Smart Energy and Electrical Engineering, SEEE 2022

作者： Sun, Jinyu Chen, Fubing Huai'An Key Laboratory of Big Data Intelligent Computing and Analysis China The School of Computer Science and Technology Huaiyin Normal University Huaian223001 China

For the sake of the fixed magnitude of candidate control sets, the conventional model predictive current control (MPCC) for asymmetric six-phase permanent magnet motors suffers from huge harmonic currents. This article designs a novel MPCC that aims to improve operational performance. First, virtual-voltage vector (VV) sets are synthesized as the new candidate vectors to restrain harmonic currents. Then, a simplified method for evaluating voltage vectors is used to alleviate the computation in the enumeration process. Moreover, the duty cycle modulation with the deadbeat solution is introduced to optimize the magnitude of the VV. The modulation range can be expanded by utilizing null vectors, which will significantly reduce the torque fluctuations and flux ripples. The experiments are conducted to verify the designed control strategy. © Published under licence by IOP Publishing Ltd.

关键词： Vectors

来源：评论

学校读者我要写书评

暂无评论

On RNN-Based k-WTA Models With Time-Dependent Inputs

引用

IEEE/CAA Journal of Automatica Sinica 2022年第11期9卷 2034-2036页

作者： Mei Liu Mingsheng Shang the Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Institute of Green and Intelligent TechnologyChinese Academy of SciencesChongqing 400714 the Chongqing School University of Chinese Academy of SciencesChongqing 400714China

Dear editor,This letter identifies two weaknesses of state-of-the-art k-winnerstake-all(k-WTA)models based on recurrent neural networks(RNNs)when considering time-dependent inputs,i.e.,the lagging error and the infeas... 详细信息

关键词： letter convergence finite

来源：评论

学校读者我要写书评

暂无评论

Task Separation and Knowledge Sharing for Class Incremental Learning 5

Task Separation and Knowledge Sharing for Class Incremental ...

引用

5th International Conference on intelligent computing and Human-Computer Interaction, ICHCI 2024

作者： Zhang, Jiali Qiao, Xiaoyan School of Computer Science and Technology Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China School of Mathematics and Information Science Shandong Technology and Business University Yantai Key Laboratory of Big Data Modeling and Intelligent Computing Immersion Technology and Evaluation Shandong Engineering Research Center Shandong Yantai China

ISBN: (纸本)9798350368284

Methods based on dynamically expanding architectures can effectively mitigate catastrophic forgetting in class incremental learning (CIL), but they often overlook information sharing and integration between subnetworks, leading to performance degradation and increased parameter count and memory consumption as the network expands. To address these complex issues, we introduce a new method called Task Separation and Knowledge Sharing (TSKS), which transfers knowledge at both the logical and feature levels through Hybrid Knowledge Distillation (HKD). In logical distillation, we combine Global Knowledge Distillation (GKD) and Task Knowledge Distillation (TKD) to establish connections between tasks. To prevent the model from favoring new classes, we design an Attention- Based Feature Fusion (ABFF) mechanism to capture important features. Additionally, we introduce a Soft-Margin Auxiliary Loss (SMAL) to help the model learn new concepts. Extensive experiments show that TSKS outperforms existing models on CIFAR100 and ImageNet100, regardless of whether memory samples are used. Notably, TSKS demonstrates superior performance in memory-free settings, indicating a reduced reliance on rehearsal memory. © 2024 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

A Local Regression-Based SLA-Aware Energy-Efficient Virtual Machine Consolidation Algorithm in data Centers 9

A Local Regression-Based SLA-Aware Energy-Efficient Virtual ...

引用

9th International Conference on big data computing and Communications, bigCom 2023

作者： Wu, Xiaodong Wang, Ronghai Lin, Guoxin Quanzhou Normal University School of Mathmatics and Computer Science China Fujian Province University Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian China Provincial Big Data Research Institute of Intelligent Manufacturing Quanzhou China

ISBN: (纸本)9798350331240

Virtual Machine Consolidation (VMC) is an effective means to improve the resource utilization and reduce energy consumption of data centers. However, the VMC optimization that only considers energy consumption may lead to SLA (Service-Level Agreements) violations and thus fail to guarantee the QoS (Quality of Service) provided. Therefore, it is necessary to consider both energy saving and SLA violations in the process of VMC. In this paper, we propose an energy and SLA-aware VMC algorithm that considers both energy saving and SLA violation optimization in data centers. The proposed algorithm uses the local regression method to predict the utilization of virtual machines, based on which it determines whether the host will be overloaded, so as to make the decision of virtual machine migrations. The proposed VMC algorithm is evaluated with CloudSim toolkit. Simulation results demonstrate that our algorithm has good energy saving performance and can effectively reduce SLA violation in cloud data center. Considering energy consumption and SLA violation, the ESV can be reduced by 7.57% on average and 16.36% at most compared with other algorithms. © 2023 IEEE.

关键词： Virtual machine

来源：评论

学校读者我要写书评

暂无评论

Inductive Relation Prediction by Disentangled Subgraph Structure

引用

Tsinghua Science and Technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised PolSAR image classification method based on contrastive learning 6

Semi-supervised PolSAR image classification method based on ...

引用

6th International Conference on Artificial Intelligence and Pattern Recognition, AIPR 2023

作者： Hua, Wenqiang Sun, Nan Liu, Lin The Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an Key Laboratory of Big Data and Intelligent Computing School of Computer Science and Technology Xi'an University of Posts and Telecommunications Xi'an China School of Computer Technology Xi'an University of Posts and Telecommunications Xi'an China

ISBN: (纸本)9798400707674

Polarimetric synthetic aperture radar (PolSAR) image classification has important application value and a wide range of application scenarios in many fields. Supervised classification methods, which need to use a large amount of labeled data to improve classification accuracy, have achieved satisfactory classification performance. However, it is difficult and expensive to obtain sufficient labeled data for PolSAR images. The problem to be solved is how to obtain high classification accuracy with a limited number of labeled samples. Semi-supervised PolSAR image classification method based on contrastive learning is proposed. Firstly, a supervised PolSAR image classification method based on meta-learning is introduced. Prototypical network based on meta-learning ideas is used as the basic classification model, and a prototypical representation is created for each category. Classification is performed by computing the similarity between the prototypical representation and samples to be classified. Secondly, a method of training feature extractor based on contrastive learning is designed. By maintaining the consistency of features between the same data and distinguishing the differences between different data after data augmentation, the method enables the feature extractor to obtain accurate feature representation. By co-training with meta-learning, so as to improve the classification performance. Finally, experiments on real PolSAR data prove the effectiveness of the proposed method. © 2023 ACM.

关键词： Image classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：