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

Leaving None Behind: data-Free Domain Incremental Learning for Major Depressive Disorder Detection

IEEE Transactions on Affective Computing 2024年第2期16卷 758-770页

作者： Chen, Tao Guo, Yanrong Hao, Shijie Hong, Richang Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data China Hefei University of Technology Ministry of Education and School of Computer Science and Information Engineering Hefei230009 China

While deep learning techniques have shown promising performance in the Major Depressive Disorder (MDD) detection task, they still face limitations in real-world scenarios. Specifically, given the data scarcity, some efforts have resorted to aggregating data from different domains to expand the data volume. However, their effectiveness is currently limited by the domain gap and data privacy. Additionally, the class imbalance issue is particularly severe in our application, leading to biased classifying performance accordingly. To address these challenges, we propose data-Free Domain Incremental Learning for the MDD detection (DIL-MDD) task, accommodating multiple feature distributions by only accessing well-trained models from previous domains and the data in the current domain. Specifically, DIL-MDD consists of two key modules: Adaptive Class-tailored Threshold Learning (ACTL) and data-Free Domain Alignment (DFDA). The first module measures the discrepancy between the outputs of two sequential domains, based on which we learn a class-tailored threshold adaptively. Building on this, we differentiate between samples that either exhibit similarities or dissimilarities with the previous domain, where this similar sample set is identified to investigate the feature distribution of the historical data. The second module imposes an alignment constraint to narrow the gap between these two sample sets, thereby exploring the expertise of the previous domain. To validate the effectiveness of the proposed method, we conduct extensive experiments on the public MDD datasets, i.e., DAIC-WOZ, MODMA, and CMDC. We also apply our method to another mental health condition, Autism Spectrum Disorder (ASD), to further demonstrate its applicability. Finally, the ablation studies validate the superiority of the proposed modules. © 2010-2012 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Dual-stream coupling network with wavelet transform for cross-resolution person re-identification

引用

Journal of Systems engineering and Electronics 2023年第3期34卷 682-695页

作者： SUN Rui YANG Zi ZHAO Zhenghui ZHANG Xudong Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education) Hefei University of TechnologyHefei 230601China School of Computer and Information Hefei University of TechnologyHefei 230601China

Person re-identification is a prevalent technology deployed on intelligent *** have been remarkable achievements in person re-identification methods based on the assumption that all person images have a sufficiently high resolution,yet such models are not applicable to the open *** real world,the changing distance between pedestrians and the camera renders the resolution of pedestrians captured by the camera *** low-resolution(LR)images in the query set are matched with high-resolution(HR)images in the gallery set,it degrades the performance of the pedestrian matching task due to the absent pedestrian critical information in LR *** address the above issues,we present a dualstream coupling network with wavelet transform(DSCWT)for the cross-resolution person re-identification ***,we use the multi-resolution analysis principle of wavelet transform to separately process the low-frequency and high-frequency regions of LR images,which is applied to restore the lost detail information of LR ***,we devise a residual knowledge constrained loss function that transfers knowledge between the two streams of LR images and HR images for accessing pedestrian invariant features at various *** qualitative and quantitative experiments across four benchmark datasets verify the superiority of the proposed approach.

关键词： cross-resolution feature invariant learning person re-identification residual knowledge transfer wavelet transform

来源：评论

学校读者我要写书评

暂无评论

Representation learning: serial-autoencoder for personalized recommendation

引用

Frontiers of computer Science 2024年第4期18卷 61-72页

作者： Yi ZHU Yishuai GENG Yun LI Jipeng QIANG Xindong WU School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of the People’s Republic of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230009China

Nowadays,the personalized recommendation has become a research hotspot for addressing information *** this,generating effective recommendations from sparse data remains a ***,auxiliary information has been widely used to address data sparsity,but most models using auxiliary information are linear and have limited *** to the advantages of feature extraction and no-label requirements,autoencoder-based methods have become quite ***,most existing autoencoder-based methods discard the reconstruction of auxiliary information,which poses huge challenges for better representation learning and model *** address these problems,we propose Serial-Autoencoder for Personalized Recommendation(SAPR),which aims to reduce the loss of critical information and enhance the learning of feature ***,we first combine the original rating matrix and item attribute features and feed them into the first autoencoder for generating a higher-level representation of the ***,we use a second autoencoder to enhance the reconstruction of the data representation of the prediciton rating *** output rating information is used for recommendation *** experiments on the MovieTweetings and MovieLens datasets have verified the effectiveness of SAPR compared to state-of-the-art models.

关键词： personalized recommendation autoencoder representation learning collaborative filtering

来源：评论

学校读者我要写书评

暂无评论

Multi-view Feature Learning for the Over-penalty in Adversarial Domain Adaptation

引用

data Intelligence 2024年第1期6卷 183-200页

作者： Yuhong Zhang Jianqing Wu Qi Zhang Xuegang Hu School of Computer and Information Engineering Hefei University of TechnologyHefei 230601China Key Laboratory of Knowledge Engineering with Big Data(Hefei University of Technology) The Ministry of Education of ChinaHefei 230009China

Domain adaptation aims to transfer knowledge from the labeled source domain to an unlabeled target domain that follows a similar but different ***,adversarial-based methods have achieved remarkable success due to the excellent performance of domain-invariant feature presentation ***,the adversarial methods learn the transferability at the expense of the discriminability in feature representation,leading to low generalization to the target *** this end,we propose a Multi-view Feature Learning method for the Over-penalty in Adversarial Domain ***,multi-view representation learning is proposed to enrich the discriminative information contained in domain-invariant feature representation,which will counter the over-penalty for discriminability in adversarial ***,the class distribution in the intra-domain is proposed to replace that in the inter-domain to capture more discriminative information in the learning of transferrable *** experiments show that our method can improve the discriminability while maintaining transferability and exceeds the most advanced methods in the domain adaptation benchmark datasets.

关键词： domain adaptation adversarial learning multi-view learning

来源：评论

学校读者我要写书评

暂无评论

Layer-Wise Learning Rate Optimization for Task-Dependent Fine-Tuning of Pre-Trained Models: An Evolutionary Approach

引用

ACM Transactions on Evolutionary Learning and Optimization 2024年第4期4卷 1-23页

作者： Bu, Chenyang Liu, Yuxin Huang, Manzong Shao, Jianxuan Ji, Shengwei Luo, Wenjian Wu, Xindong Key Laboratory of Knowledge Engineering with Big Data Ministry of Education and School of Computer Science and Information Engineering Hefei University of Technology Hefei China School of Artificial Intelligence and Big Data Hefei University Hefei China Guangdong Provincial Key Laboratory of Novel Security Intelligence Technologies School of Computer Science and Technology Harbin Institute of Technology Shenzhen China

The superior performance of large-scale pre-Trained models, such as Bidirectional Encoder Representations from Transformers (BERT) and Generative Pre-Trained Transformer (GPT), has received increasing attention in both academic and industrial research and has become one of the current research hotspots. A pre-Trained model refers to a model trained on large-scale unlabeled data, whose purpose is to learn general language representation or features for fine-Tuning or transfer learning in subsequent tasks. After pre-Training is complete, a small amount of labeled data can be used to fine-Tune the model for a specific task or domain. This two-stage method of "pre-Training+fine-Tuning"has achieved advanced results in natural language processing (NLP) tasks. Despite widespread adoption, existing fixed fine-Tuning schemes that adapt well to one NLP task may perform inconsistently on other NLP tasks given that different tasks have different latent semantic structures. In this article, we explore the effectiveness of automatic fine-Tuning pattern search for layer-wise learning rates from an evolutionary optimization perspective. Our goal is to use evolutionary algorithms to search for better task-dependent fine-Tuning patterns for specific NLP tasks than typical fixed fine-Tuning patterns. Experimental results on two real-world language benchmarks and three advanced pre-Training language models show the effectiveness and generality of the proposed framework. © 2024 held by the owner/author(s).

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

ViGT: proposal-free video grounding with a learnable token in the transformer

引用

Science China(information Sciences) 2023年第10期66卷 196-212页

作者： Kun LI Dan GUO Meng WANG School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Intelligent Interconnected Systems Laboratory of Anhui Province Institute of Artificial Intelligence Hefei Comprehensive National Science Center

The video grounding(VG) task aims to locate the queried action or event in an untrimmed video based on rich linguistic descriptions. Existing proposal-free methods are trapped in the complex interaction between video and query, overemphasizing cross-modal feature fusion and feature correlation for VG. In this paper, we propose a novel boundary regression paradigm that performs regression token learning in a transformer. Particularly, we present a simple but effective proposal-free framework, namely video grounding transformer(ViGT), which predicts the temporal boundary using a learnable regression token rather than multi-modal or cross-modal features. In ViGT, the benefits of a learnable token are manifested as follows.(1) The token is unrelated to the video or the query and avoids data bias toward the original video and query.(2) The token simultaneously performs global context aggregation from video and query ***, we employed a sharing feature encoder to project both video and query into a joint feature space before performing cross-modal co-attention(i.e., video-to-query attention and query-to-video attention) to highlight discriminative features in each modality. Furthermore, we concatenated a learnable regression token [REG] with the video and query features as the input of a vision-language transformer. Finally, we utilized the token [REG] to predict the target moment and visual features to constrain the foreground and background probabilities at each timestamp. The proposed ViGT performed well on three public datasets:ANet-Captions, TACoS, and YouCookⅡ. Extensive ablation studies and qualitative analysis further validated the interpretability of ViGT.

关键词： video grounding temporal sentence grounding boundary regression token learning proposal-free

来源：评论

学校读者我要写书评

暂无评论

Representation learning via an integrated autoencoder for unsupervised domain adaptation

引用

Frontiers of computer Science 2023年第5期17卷 75-87页

作者： Yi ZHU Xindong WU Jipeng QIANG Yunhao YUAN Yun LI School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230601China

The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target *** key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain ***,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain ***,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain *** address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called *** capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature *** higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain *** addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local *** results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.

关键词： unsupervised domain adaptation representation learning marginalized autoencoder convolutional autoen-coder sparse autoencoder

来源：评论

学校读者我要写书评

暂无评论

Bootstrap-Based Layerwise Refining for Causal Structure Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第6期5卷 2708-2722页

作者： Xiang, Guodu Wang, Hao Yu, Kui Guo, Xianjie Cao, Fuyuan Song, Yukun Hefei University of Technology Key Laboratory of Knowledge Engineering with the Big Data of Ministry of Education Hefei230601 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China Shanxi University School of Computer and Information Technology Taiyuan030006 China

Learning causal structures from observational data is critical for causal discovery and many machine learning tasks. Traditional constraint-based methods first adopt conditional independence (CI) tests to learn a global skeleton layer by layer and then orient the undirected edges to obtain a causal structure. However, the reliability of these statistical tests largely depends on the quality of data samples. In real-life scenarios, the presence of data noise or limited samples often makes many CI tests unreliable at each layer in the skeleton learning phase, leading to an inaccurate skeleton. As the number of layers increases, the inaccurate skeleton will continue to impair the skeleton construction of subsequent layers. Furthermore, an unreliable skeleton hampers the skeleton orientation procedure, resulting in an unsatisfactory causal structure. In this article, we propose a Bootstrap-based layerwise refining (BLR) algorithm for causal structure learning, which includes two new procedures to solve the above problems. First, BLR utilizes a novel layerwise skeleton refining procedure to construct the global skeleton layer by layer based on the bootstrap sampling. Second, BLR employs a collective skeleton orientation procedure that incorporates scoring techniques to collectively orient the global skeleton. The experimental results show that BLR outperforms the state-of-the-art methods on the benchmark Bayesian Network datasets. © 2020 IEEE.

关键词： Refining

来源：评论

学校读者我要写书评

暂无评论

Fine-Grained Cross-Modal Fusion Based Refinement for Text-to-Image Synthesis

引用

Chinese Journal of Electronics 2023年第6期32卷 1329-1340页

作者： SUN Haoran WANG Yang LIU Haipeng QIAN Biao Department of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of EducationHefei University of Technology

Text-to-image synthesis refers to generating visual-realistic and semantically consistent images from given textual descriptions. Previous approaches generate an initial low-resolution image and then refine it to be high-resolution. Despite the remarkable progress, these methods are limited in fully utilizing the given texts and could generate text-mismatched images, especially when the text description is complex. We propose a novel finegrained text-image fusion based generative adversarial networks(FF-GAN), which consists of two modules: Finegrained text-image fusion block(FF-Block) and global semantic refinement(GSR). The proposed FF-Block integrates an attention block and several convolution layers to effectively fuse the fine-grained word-context features into the corresponding visual features, in which the text information is fully used to refine the initial image with more details. And the GSR is proposed to improve the global semantic consistency between linguistic and visual features during the refinement process. Extensive experiments on CUB-200 and COCO datasets demonstrate the superiority of FF-GAN over other state-of-the-art approaches in generating images with semantic consistency to the given texts.

关键词： Visualization Fuses Convolution Semantics Linguistics Benchmark testing Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Joint Double Auction-Based Channel Selection in Wireless Monitoring Networks

引用

IEEE Transactions on Network and Service Management 2025年第3期22卷 2412-2426页

作者： Xia, Na Chen, Lei Li, Meng Yin, Yutao Zhang, Ke Ministry of Education School of Computer Science and Information Engineering Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data China State Grid Electric Power Research Institute Co. Ltd Hefei230088 China

In wireless networks, utilizing sniffers for fault analysis, traffic traceback, and resource optimization is a crucial task. However, existing centralized algorithms cannot be applied to high-density wireless networks. Therefore, distributed optimization of channel selection to maximize the monitoring rate of sensors in Wireless Monitoring Networks (WMNs) is a challenge. This paper proposes a joint double auction-based distributed channel selection algorithm (J2A-CS) to maximize overall quality of monitoring (QoM). First, sniffers are redundantly deployed in WMNs, and an initial channel allocation strategy is formulated. Subsequently, sniffers collectively act as buyers and sellers at different stages. Finally, buyers bid asynchronously, and sellers settle synchronously to maximize the seller's marginal revenue and update the channel selection scheme. As a distributed channel selection algorithm, J2A-CS addresses the highest overall QoM issue in WMNs, demonstrating high scalability and fault tolerance. Simulation results show that J2A-CS significantly improves QoM compared to existing distributed algorithms and outperforms centralized algorithms in high-density scenarios. © 2004-2012 IEEE.

关键词： Sales

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：