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

SSRN 2024年

作者： Zhang, Xiongtao Yin, Zezong Jiang, Yunliang Jiang, Yizhang Sun, Danfeng Liu, Yong School of Information Engineering Huzhou University Huzhou31300 China Zhejiang Key Laboratory of Intelligent Education Technology and Application Zhejiang Normal University Jinhua321004 China School of Computer Science and Technology Zhejiang Normal University Jinhua321004 China School of Artificial Intelligence and Computer Science Jiangnan University Wuxi 214122 China Key Laboratory of Image Processing and Intelligent Control Huazhong University of Science and Technology Ministry of Education Wuhan430074 China School of Computer Science Hangzhou Dianzi University Hangzhou310018 China College of Control Science and Engineering Zhejiang University Hangzhou310027 China

In order to enpower the hight performance as well as interpretability of low-order TSK fuzzy classifier, a born-again TSK fuzzy classier embedded with decoupled fuzzy dark knowledge distillation called HTSK-LLM-DKD is proposed in this study. HTSK-LLM DKD achieves the following distinctive characteristics: 1) It takes high-order TSK as teacher model and low-order TSK fuzzy classifier as student model, and leverages the proposed Least Learning Machine based Decoupling Knowledge Distillation to distill the fuzzy dark knowledge from high-order TSK fuzzy classifier to low-order TSK fuzzy classifier, which resulting in low-order TSK fuzzy classifier endowed with enhanced performance surpassing or at least comparable to high-order TSK fuzzy classifier;specifically 2) The Negative Euclidean distance between the output of teacher model and each class is employed to obtain the teacher logits, and then it computes teacher/student soft lab.ls by the softmax function with distilling temperature parameter;3) By reformulating the Kullback Leibler divergence, it decouples fuzzy dark knowledge into target class knowledge and non-target class knowledge, and transfers them to student model, which taking HTSK-LLM-DKD with outstanding performance and relatively fast running speed. Extensive experiment results on UCI benchmarking datasets and real-world dataset Cleveland Heart Disease demonstrate the effectiveness of the proposed HTSK-LLM-DKD. © 2024, The Authors. All rights reserved.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Joint Observer Gain and Input Design for Asymptotic Active Fault Diagnosis

arXiv

引用

arXiv 2024年

作者： Xu, Feng Wan, Yiming Wang, Ye Puig, Vicenç Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education China Wuhan430074 China Department of Electrical and Electronic Engineering The University of Melbourne ParkvilleVIC3010 Australia Universitat Politècnica de Catalunya Barcelona08028 Spain

This paper proposes a joint gain and input design method for observer-based asymptotic active fault diagnosis, which is based on a newly-defined notion named the excluding degree of the origin from a zonotope. Using the excluding degree, a quantitative specification is obtained to characterize the performance of set-based robust fault diagnosis. Furthermore, a single gain design method and a joint gain and input design method are proposed, respectively. This is the first work to achieve a joint observer gain and input design for set-based active fault diagnosis. Compared with the existing methods that design gains and input separately, the proposed joint gain and input design method has advantages to exploit the fault diagnosis potential of observer-based schemes. Finally, several examples are used to illustrate the effectiveness of the proposed methods. Copyright © 2024, The Authors. All rights reserved.

关键词： Design

来源：评论

学校读者我要写书评

暂无评论

Weakly supervised person search with region siamese networks

arXiv

引用

arXiv 2021年

作者： Han, Chuchu Su, Kai Yu, Dongdong Yuan, Zehuan Gao, Changxin Sang, Nong Yang, Yi Wang, Changhu Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology ByteDance University of Technology Sydney

Supervised learning is dominant in person search, but it requires elab.rate lab.ling of bounding boxes and identities. Large-scale lab.led training data is often difficult to collect, especially for person identities. A natural question is whether a good person search model can be trained without the need of identity supervision. In this paper, we present a weakly supervised setting where only bounding box annotations are availab.e. Based on this new setting, we provide an effective baseline model termed Region Siamese Networks (R-SiamNets). Towards learning useful representations for recognition in the absence of identity lab.ls, we supervise the R-SiamNet with instance-level consistency loss and cluster-level contrastive loss. For instance-level consistency learning, the R-SiamNet is constrained to extract consistent features from each person region with or without out-of-region context. For cluster-level contrastive learning, we enforce the aggregation of closest instances and the separation of dissimilar ones in feature space. Extensive experiments validate the utility of our weakly supervised method. Our model achieves the rank-1 of 87.1% and mAP of 86.0% on CUHK-SYSU benchmark, which surpasses several fully supervised methods, such as OIM [36] and MGTS [4], by a clear margin. More promising performance can be reached by incorporating extra training data. We hope this work could encourage the future research in this field. Copyright © 2021, The Authors. All rights reserved.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

Computationally Expensive High-Dimensional Multiobjective Optimization via Surrogate-Assisted Reformulation and Decomposition

引用

IEEE Transactions on Evolutionary Computation 2024年 1-1页

作者： Pan, Linqiang Lin, Jianqing Wang, Handing He, Cheng Tan, Kay Chen Jin, Yaochu School of Artificial Intelligence and Automation Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China Huazhong University of Science and Technology Wuhan China School of Artificial Intelligence Xidian University Xi’an China School of Electrical and Electronic Engineering Huazhong University of Science and Technology Wuhan China Department of Computing The Hong Kong Polytechnic University Hong Kong Hong Kong School of Engineering Trustworth and General Artificial Intelligence Laboratory Westlake University Hangzhou China

In recent decades, various surrogate-assisted evolutionary algorithms (SAEAs) have been proposed to solve computationally expensive multiobjective optimization problems (EMOPs). Nevertheless, designing an SAEA to handle high-dimensional EMOPs and balance convergence, diversity, and computational complexity remains challenging. Here, we propose a two-phase SAEA (TP-SAEA), which follows the idea of convergence first and diversity second, for solving high-dimensional EMOPs. In Phase I, a surrogate-assisted problem reformulation method is proposed to fast-track the Pareto optimal set in association with some reference solutions. Specifically, the high-dimensional EMOP is reformulated into an expensive single-objective one with low-dimensional decision space. Then, the surrogate-assisted optimization is utilized to obtain well-converged solutions. In Phase II, the high-dimensional EMOP is decomposed into two subproblems to explore subregions of the decision space that can effectively promote the diversity of the solutions. The two subproblems are optimized independently via surrogate-assisted optimization, aiming to push the population towards different regions of the Pareto optimal front. Experiments are conducted on EMOPs with 100 to 500 decision variables compared with four state-of-the-art SAEAs. The proposed TP-SAEA obtains well-converged and diverse solutions with only 509 real function evaluations. Moreover, its superiority is examined in six real-world instances with up to 12,000 decision variables. IEEE

关键词： Iron

来源：评论

学校读者我要写书评

暂无评论

Weakly Supervised Person Search with Region Siamese Networks

Weakly Supervised Person Search with Region Siamese Networks

引用

International Conference on Computer Vision (ICCV)

作者： Chuchu Han Kai Su Dongdong Yu Zehuan Yuan Changxin Gao Nong Sang Yi Yang Changhu Wang Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology ByteDance University of Technology Sydney

ISBN: (纸本)9781665428132

关键词： Training Computer vision Annotations Supervised learning Training data Benchmark testing Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Multi-Centroid Representation Network for Domain Adaptive Person Re-ID

arXiv

引用

arXiv 2021年

作者： Wu, Yuhang Huang, Tengteng Yao, Haotian Zhang, Chi Shao, Yuanjie Han, Chuchu Gao, Changxin Sang, Nong Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology China Megvii Technology China

Recently, many approaches tackle the Unsupervised Domain Adaptive person re-identification (UDA re-ID) problem through pseudo-lab.l-based contrastive learning. During training, a uni-centroid representation is obtained by simply averaging all the instance features from a cluster with the same pseudo lab.l. However, a cluster may contain images with different identities (lab.l noises) due to the imperfect clustering results, which makes the uni-centroid representation inappropriate. In this paper, we present a novel Multi-Centroid Memory (MCM) to adaptively capture different identity information within the cluster. MCM can effectively alleviate the issue of lab.l noises by selecting proper positive/negative centroids for the query image. Moreover, we further propose two strategies to improve the contrastive learning process. First, we present a Domain-Specific Contrastive Learning (DSCL) mechanism to fully explore intra-domain information by comparing samples only from the same domain. Second, we propose Second-Order Nearest Interpolation (SONI) to obtain abundant and informative negative samples. We integrate MCM, DSCL, and SONI into a unified framework named Multi-Centroid Representation Network (MCRN). Extensive experiments demonstrate the superiority of MCRN over state-of-the-art approaches on multiple UDA re-ID tasks and fully unsupervised re-ID tasks. Copyright © 2021, The Authors. All rights reserved.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Closer to pre-trained network transfer better 9

Closer to pre-trained network transfer better

引用

9th IEEE Joint International Information Technology and Artificial Intelligence Conference, ITAIC 2020

作者： Chen, Siyu Li, Wei Huazhong University of Science and Technology School of Artificial Intelligence and Automation Wuhan430074 China Image Processing and Intelligent Control Key Laboratory Education Ministry of China Wuhan430074 China

In recent years, Deep Neural Network (DNN) has been widely used in the domain of computer vision, but its further development is restricted because of the lack of train samples. Fine-tuning is one of deep transfer learning methods to solve this problem. Nowdays, some existing Fine-tuning approaches assume that if the fine-tuned network could be as close to the pre-trained network as possible, the source knowledge would be fully utilized to improve the study effect. Although these approaches work pretty well, the assumptions on which they are based have not been systematically proved. Due to the complexity of DNNs, offering a reasonable and accurate explanation of the performance of the network is significant for designing new algorithms. In this paper, we design a series of experiments with or without transfer learning respectively, to characterize the relationship between network differences and network performance. The results show that there is an obvious negative correlation between them under certain circumstances. This conclusion can not only provide a more reasonable explanation for the relevant transfer learning algorithm, but also provide support and in-spiration for the future work. © 2020 IEEE.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

T-TIME: Test-Time Information Maximization Ensemble for Plug-and-Play BCIs

arXiv

引用

arXiv 2024年

作者： Li, Siyang Wang, Ziwei Luo, Hanbin Ding, Lieyun Wu, Dongrui Ministry of Education Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen China Henan Key Laboratory of Brain Science and Brain Computer Interface Technology School of Electrical and Information Engineering Zhengzhou University China School of Civil and Hydraulic Engineering Huazhong University of Science and Technology Wuhan430074 China

Objective: An electroencephalogram (EEG)-based brain-computer interface (BCI) enables direct communication between the human brain and a computer. Due to individual differences and non-stationarity of EEG signals, such BCIs usually require a subject-specific calibration session before each use, which is time-consuming and user-unfriendly. Transfer learning (TL) has been proposed to shorten or eliminate this calibration, but existing TL approaches mainly consider offline settings, where all unlab.led EEG trials from the new user are availab.e. Methods: This paper proposes Test-Time Information Maximization Ensemble (T-TIME) to accommodate the most challenging online TL scenario, where unlab.led EEG data from the new user arrive in a stream, and immediate classification is performed. T-TIME initializes multiple classifiers from the aligned source data. When an unlab.led test EEG trial arrives, T-TIME first predicts its lab.ls using ensemble learning, and then updates each classifier by conditional entropy minimization and adaptive marginal distribution regularization. Our code is publicized. Results: Extensive experiments on three public motor imagery based BCI datasets demonstrated that T-TIME outperformed about 20 classical and state-of-the-art TL approaches. Significance: To our knowledge, this is the first work on test time adaptation for calibration-free EEG-based BCIs, making plug-and-play BCIs possible. © 2024, CC BY.

关键词： Calibration

来源：评论

学校读者我要写书评

暂无评论

Locating and Sizing Charging Station in Multi-Period to Promote Electric Vehicles Adoption in Urban Areas

SSRN

引用

SSRN 2023年

作者： Hu, Dandan Huang, Liu Liu, Chen Liu, Zhi-Wei The School of Management South-central Minzu University Wuhan430074 China The School of Engineering RMIT University MelbourneVIC3001 Australia The School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China The Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

The layout of public fast charging stations often fails to meet the charging demand of electric vehicle (EV) users, resulting in charging anxiety. To address this issue and promote the widespread use of EVs in urban areas, this paper presents a multiperiod locating and sizing optimization model under dynamic demand. The model incorporates GPS trajectory extraction data to identify potential charging demand points and considers the mobile load characteristics of EVs for fusion modeling. A multiperiod change formula is proposed to reflect the interaction between public fast charging stations and EV market penetration, incorporating charging opportunity and waiting time satisfaction as measures of charging service quality. To solve the model, a heuristic algorithm combining genetic algorithm (GA) and k-medoids clustering algorithm is designed. We apply the model to an actual case of Shenzhen and find that increasing investment in charging infrastructure can boost EV market penetration in the later planning period. Moreover, the gap between charging opportunity and waiting time satisfaction tends to narrow as the planning progresses. Our findings highlight the importance of optimizing the location and size of public fast charging stations to improve the charging service quality and promote the adoption of EVs. © 2023, The Authors. All rights reserved.

关键词： Location

来源：评论

学校读者我要写书评

暂无评论

Causal Invariant Hierarchical Molecular Representation for Out-of-distribution Molecular Property Prediction

Causal Invariant Hierarchical Molecular Representation for O...

引用

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Xinlong Wen Yifei Guo Shuoying Wei Wenhan Long Lida Zhu Rongbo Zhu Huazhong Agricultural University Wuhan China College of Informatics Huazhong Agricultural University Wuhan China Shenzhen Institute of Nutrition and Health Huazhong Agricultural University Shenzhen China Shenzhen Branch Guangdong Laboratory for Lingnan Modern Agriculture Genome Analysis Laboratory of the Ministry of Agriculture and Agricultural Genomics Institute at Shenzhen Chinese Academy of Agricultural Sciences Shenzhen China Engineering Research Center of Intelligent Technology for Agriculture Ministry of Education Wuhan China Huazhong University of Science and Technology Wuhan China Key Laboratory of Ministry of Education for Image Processing and Intelligent Control School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China

ISBN: (数字)9798350386226

ISBN: (纸本)9798350386233

Molecular representation learning is widely used in the field of drug discovery, due to its ability to accurately capture the complex features of compounds in high-dimensional space. However, existing molecular representation learning models are prone to be influenced by spurious parts during distribution shifts (also known as out-of-distribution, or OOD), which results in models mistakenly treating these spurious parts as crucial features of molecules, thereby limiting the generalization capability of the models. To tackle this issue, a novel invariant molecular representation learning model, called Causal Invariant Hierarchical Molecular Representation Graph Neural Networks (CHiMoGNN), is proposed for OOD molecular property prediction. In CHiMoGNN, a Feature Enhancement (FE) module is designed to leverage the multi-level molecular parts to enhance the expression of invariant features, thereby enhancing the model’s capability to capture key molecular information. In addition, a Cartesian Product based Environmental Impact (EI) module is adopted to generate counterfactual samples with environmental diversity. Consequently, these samples are utilized to train a classifier that maintains consistent performance across various environments. Extensive experiments on seven real-world datasets demonstrate that CHiMoGNN outperforms 9 state-of-the-art models, achieving a 5.73% increase in average ROC-AUC, and the results also show that CHiMoGNN can effectively maintain generalization in various distribution shifts. Code and datasets are availab.e at https://***/Chertuion/CHiMoGNN.

关键词： Representation learning Limiting Codes Predictive models Feature extraction Iron Graph neural networks Drug discovery Data mining Compounds

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：