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

Text-guided Reconstruction Network for Sentiment Analysis with Uncertain Missing Modalities

IEEE Transactions on Affective Computing 2025年

作者： Shi, Piao Hu, Min Nakagawa, Satoshi Zheng, Xiangming Shi, Xuefeng Ren, Fuji Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Ministry of Education Anhui Province Key Laboratory of Affective Computing and Advanced Intelligent Machine National Smart Eldercare International Science and Technology Cooperation Base School of Computer Science and Information Engineering Anhui Hefei230601 China Bozhou University School of Electronic and Information Engineering Bozhou236800 China University of Tokyo Graduate School of Information Science and Technology Tokyo113-8656 Japan University of Electronic Science and Technology of China College of Computer Science and Engineering Chengdu611731 China University of Electronic Science and Technology of China Shenzhen Institute for Advanced Study Shenzhen518110 China

Multimodal Sentiment Analysis (MSA) is an attractive research that aims to integrate sentiment expressed in textual, visual, and acoustic signals. There are two main problems in the existing methods: 1) the dominant role of the text is underutilization in unaligned multimodal data, and 2) the modality under uncertain missing feature is not sufficiently explored. This paper proposes a Text-guided Reconstruction Network (TgRN) for MSA with uncertain missing modalities in non-aligned sequences. The TgRN network includes three primary modules: Text-guided Extraction Module (TEM), Reconstruction Module (RM) and Text-guided Fusion Module (TFM). First, the TEM consists of the text-guided cross attention units and self-attention units to capture inter-modal features and intra-modal features, respectively. Second, leveraging enhanced attention units and a three-way squeeze-and-excitation block, the RM is designed to learn semantic information from incomplete data and reconstruct missing modality features. Third, the TFM utilizes a progressive modality-mixing adaptation gate to explore the dynamic correlations between nonverbal and verbal modalities, effectively addressing the modality gap issue. Finally, under the supervision of sentiment prediction loss and reconstruction loss, the TgRN effectively processes both uncertain missing-modality conditions and ideal complete modality conditions. Extensive experiments on CMU-MOSI and CH-SIMS demonstrate that our proposed method outperforms state-of-the-art approaches. © 2010-2012 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Modeling the Temporal Dynamics of EEG Signals in Selective Listening

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Cai, Siqi Zhang, Ran Zhu, Hongxu Li, Haizhou National University of Singapore Department of Electrical and Computer Engineering Singapore Singapore South China University of Technology Shien-Ming Wu School of Intelligent Engineering China Fano Hong Kong Hong Kong The Chinese University of Hon g Kong Shenzhen Research Institute of Big Data School of Data Science Shenzhen518172 China University of Bremen Machine Listening Lab Bremen28359 Germany

Human brain possesses an extraordinary ability to attend to a specific sound source in a multi-talk, noisy environment such as a cocktail party. Auditory attention detection (AAD) aims to automatically identify such attentive neural activity from brain signals, such as electroencephalography (EEG). Given the dynamic and nonlinear nature of EEG signals, we propose a spiking long short-term memory (LSTM) network to capture the temporal features from EEG data. Additionally, we introduce a spiking temporal attention mechanism that dynamically assigns differentiated weights, thereby enhancing the representation of EEG features. We evaluate our proposed spiking temporal LSTM model, named ST-LSTM, on a widely used AAD dataset through a wide range of experiments. The experiments demonstrate that ST-LSTM outperforms other competing models, especially in low-latency settings. Moreover, with low power consumption, ST-LSTM offers a practical solution for edge computing implementations such as neuro-steered hearing aids, and other portable brain-computer interfaces. © 1975-2011 IEEE.

关键词： Hearing aids

来源：评论

学校读者我要写书评

暂无评论

Comprehensive Architecture Search for Deep Graph Neural Networks

引用

IEEE Transactions on big data 2025年

作者： Dong, Yukang Pan, Fanxing Gui, Yi Jiang, Wenbin Wan, Yao Zheng, Ran Jin, Hai National Engineering Research Center for Big Data Technology Huazhong University of Science and Technology Wuhan430074 China Huazhong University of Science and Technology Service Computing Technology and System Laboratory Wuhan430074 China Huazhong University of Science and Technology Cluster and Grid Computing Laboratory Wuhan430074 China Huazhong University of Science and Technology School of Computer Science and Technology Wuhan430074 China Zhejiang Lab Hangzhou311121 China

In recent years, Neural Architecture Search (NAS) has emerged as a promising approach for automatically discovering superior model architectures for deep Graph Neural Networks (GNNs). Different methods have paid attention to different types of search spaces. However, due to the time-consuming nature of training deep GNNs, existing NAS methods often fail to explore diverse search spaces sufficiently, which constrains their effectiveness. To crack this hard nut, we propose CAS-DGNN, a novel comprehensive architecture search method for deep GNNs. It encompasses four kinds of search spaces that are the composition of aggregate and update operators, different types of aggregate operators, residual connections, and hyper-parameters. To meet the needs of such a complex situation, a phased and hybrid search strategy is proposed to accommodate the diverse characteristics of different search spaces. Specifically, we divide the search process into four phases, utilizing evolutionary algorithms and Bayesian optimization. Meanwhile, we design two distinct search methods for residual connections (All-connected search and Initial Residual search) to streamline the search space, which enhances the scalability of CAS-DGNN. The experimental results show that CAS-DGNN achieves higher accuracy with competitive search costs across ten public datasets compared to existing methods. © 2015 IEEE.

关键词： Neural network models

来源：评论

学校读者我要写书评

暂无评论

Efficient COVID-19 detection using data mining algorithms: a comparison of basic and hybrid approaches

引用

Soft Computing 2025年第3期29卷 1437-1451页

作者： Saidi, Mohammad Gheibi, Mohammad Ghazikhani, Adel Lotfata, Aynaz Chahkandi, Benyamin Familsamavati, Sajad Behzadian, Kourosh Department of Computer Science Imam Reza International University Mashhad Iran MS of Software Engineering Information and Communication Technology Unit Mashhad Municipality Fire and Safety Services Organization Mashhad Iran Big Data Lab Imam Reza International University Mashhad Iran Institute for Nanomaterials Advanced Technologies and Innovation Technical University of Liberec Liberec46117 Czech Republic Tallinn10615 Estonia Department of Pathology Microbiology and Immunology School of Veterinary Medicine University of California Davis95616 United States Department of Urban and Regional Planning San Jose State University San Jose95192 United States Faculty of Civil and Environmental Engineering Gdansk University of Technology Narutowicza Street 11/12 80-233 Gdansk Poland Tecnologico de Monterrey Escuela de Ingeniería y Ciencias Monterrey Mexico School of Computing and Engineering University of West London London United Kingdom

Accurate and efficient diagnosis of COVID-19 remains a significant challenge due to the limitations of current detection methods, such as blood tests and chest scans, which can be time-consuming and error-prone. This study aims to compare the performance of basic and hybrid data mining algorithms in diagnosing COVID-19, using blood test results and clinical information to identify the most effective approach. A dataset of 200 records from suspected and infected COVID-19 patients, with 23 characteristics and one diagnostic class, was analysed. Nine data mining algorithms were tested: four basic algorithms (Naive Bayes, Support Vector Machine, Decision Tree, K-Nearest Neighbor) and five hybrid algorithms (Random Forest, AdaBoost, Majority Voting, XGBoost, Bagging). The study also integrated Response Surface Methodology (RSM) and Adaptive-Network-based Fuzzy Inference System (ANFIS) to enhance model performance. The Bagging algorithm demonstrated superior performance with an accuracy of 88%, sensitivity of 74%, and F-criterion of 78%. The integration of RSM and ANFIS further showed that a smart model could be developed for efficient pandemic crisis management, achieving up to 100% accuracy when considering key factors like AST, Albumin, and CRP. The findings suggest that Bagging and hybrid data mining algorithms can significantly improve COVID-19 detection, reducing time and errors in identifying exposed individuals. The study highlights the potential of combining machine learning techniques with RSM-ANFIS models for effective pandemic management and decision-making in medical settings. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2025.

关键词： Support vector machines

来源：评论

学校读者我要写书评

暂无评论

Decoupled Prototype Learning for Reliable Test-Time Adaptation

引用

IEEE Transactions on Multimedia 2025年

作者： Wang, Guowei Ding, Changxing Tan, Wentao Tan, Mingkui South China University of Technology School of Electronic and Information Engineering 381 Wushan Road Tianhe District Guangzhou510000 China Pazhou Lab Guangzhou510330 China South China University of Technology School of Future Technology 381 Wushan Road Tianhe District Guangzhou510000 China South China University of Technology School of Software Engineering Key Laboratory of Big Data and Intelligent Robot Ministry of Education Guangzhou510006 China

Test-time adaptation (TTA) is a task that continually adapts a pre-trained source model to the target domain during inference. One popular approach involves fine-tuning model with cross-entropy loss according to estimated pseudo-labels. However, its performance is significantly affected by noisy pseudo-labels. This study reveals that minimizing the classification error of each sample causes the cross-entropy loss's vulnerability to label noise. To address this issue, we propose a novel Decoupled Prototype Learning (DPL) method that features prototype-centric loss computation. First, we decouple the optimization of class prototypes. For each class prototype, we reduce its distance with positive samples and enlarge its distance with negative samples in a contrastive manner. This strategy prevents the model from overfitting to noisy pseudo-labels. Second, we propose a memory-based strategy to enhance DPL's robustness for the small batch sizes often encountered in TTA. We update each class's pseudo-feature from a memory in a momentum manner and insert an additional DPL loss. Finally, we introduce a consistency regularization-based approach to leverage samples with unconfident pseudo-labels. This approach transfers feature styles of samples with unconfident pseudo-labels to those with confident pseudo-labels. Thus, more reliable samples for TTA are created. The experimental results demonstrate that our methods achieve state-of-the-art performance on domain generalization benchmarks, and reliably improve the performance of self-training-based methods on image corruption benchmarks. The code will be released. © 1999-2012 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

PPFPL: Cross-silo Privacy-preserving Federated Prototype Learning Against data Poisoning Attacks on Non-IID data

arXiv

引用

arXiv 2025年

作者： Zhang, Hongliang Yu, Jiguo Xu, Fenghua Hu, Chunqiang Zhang, Yongzhao Wang, Xiaofen Yu, Zhongyuan Zhang, Xiaosong School of Computer Science and Technology Qilu University of Technology Shandong Jinan250353 China School of Information and Software Engineering University of Electronic Science and Technology of China Sichuan Chengdu610054 China Cyber Security Institute University of Science and Technology of China Anhui Hefei230026 China School of Big Data and Software Engineering Chongqing University Chongqing400044 China College of Computer Science and Technology China University of Petroleum Shandong Qingdao266580 China

Privacy-Preserving Federated Learning (PPFL) allows multiple clients to collaboratively train a deep learning model by submitting hidden model updates. Nonetheless, PPFL is vulnerable to data poisoning attacks due to the distributed training nature of clients. Existing solutions have struggled to improve the performance of cross-silo PPFL in poisoned Non-IID data. To address the issues, this paper proposes a privacy-preserving federated prototype learning framework, named PPFPL, which enhances the cross-silo FL performance in poisoned Non-IID data while effectively resisting data poisoning attacks. Specifically, we adopt prototypes as client-submitted model updates to eliminate the impact of tampered data distribution on federated learning. Moreover, we utilize two servers to achieve Byzantine-robust aggregation by secure aggregation protocol, which greatly reduces the impact of malicious clients. Theoretical analyses confirm the convergence of PPFPL, and experimental results on publicly available datasets show that PPFPL is effective for resisting data poisoning attacks with Non-IID conditions. © 2025, CC BY.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Towards high-throughput and low-latency billion-scale vector search via CPU/GPU collaborative filtering and re-ranking 25

Towards high-throughput and low-latency billion-scale vector...

引用

Proceedings of the 23rd USENIX Conference on File and Storage Technologies

作者： Bing Tian Haikun Liu Yuhang Tang Shihai Xiao Zhuohui Duan Xiaofei Liao Hai Jin Xuecang Zhang Junhua Zhu Yu Zhang National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China Huawei Technologies Co. Ltd Towards high-throughput and low-latency billion-scale vector search via CPU/GPU collaborative filtering and re-ranking

ISBN: (纸本)9781939133458

Approximate nearest neighbor search (ANNS) has emerged as a crucial component of database and AI infrastructure. Ever-increasing vector datasets pose significant challenges in terms of performance, cost, and accuracy for ANNS services. None of modern ANNS systems can address these issues simultaneously. In this paper, we present Fusion-ANNS, a high-throughput, low-latency, cost-efficient, and high-accuracy ANNS system for billion-scale datasets using SSDs and only one entry-level GPU. The key idea of Fusion-ANNS lies in CPU/GPU collaborative filtering and reranking mechanisms, which significantly reduce I/O operations across CPUs, GPU, and SSDs to break through the I/O performance bottleneck. Specifically, we propose three novel designs: (1) multi-tiered indexing to avoid data swapping between CPUs and GPU, (2) heuristic re-ranking to eliminate unnecessary I/Os and computations while guaranteeing high accuracy, and (3) redundant-aware I/O deduplication to further improve I/O efficiency. We implement FusionANNS and compare it with the state-of-the-art SSD-based ANNS system-SPANN and GPU-accelerated in-memory ANNS system-RUMMY. Experimental results show that FusionANNS achieves 1) 9.4-13.1× higher query per second (QPS) and 5.7-8.8× higher cost efficiency compared with SPANN; 2) and 2-4.9× higher QPS and 2.3-6.8× higher cost efficiency compared with RUMMY, while guaranteeing low latency and high accuracy.

关键词：

来源：评论

学校读者我要写书评

暂无评论

MeHyper: Accelerating Hypergraph Neural Networks by Exploring Implicit dataflows

MeHyper: Accelerating Hypergraph Neural Networks by Explorin...

引用

IEEE Symposium on High-Performance Computer Architecture

作者： Wenju Zhao Pengcheng Yao Dan Chen Long Zheng Xiaofei Liao Qinggang Wang Shaobo Ma Yu Li Haifeng Liu Wenjing Xiao Yufei Sun Bing Zhu Hai Jin Jingling Xue National Engineering Research Center for Big Data Technology and System/Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Computing National University of Singapore Singapore School of Computer Electronics and Information Guangxi University NanNing China School of Computer Science and Engineering University of New South Wales Sydney NSW Australia

ISBN: (数字)9798331506476

ISBN: (纸本)9798331506483

Hypergraph Neural Networks (HGNNs) are increasingly utilized to analyze complex inter-entity relationships. Traditional HGNN systems, based on a hyperedge-centric dataflow model, independently process aggregation tasks for hyperedges and vertices, leading to significant computational redundancy. This redundancy arises from recalculating shared information across different tasks. For the first time, we identify and harness implicit dataflows (i.e., dependencies) within HGNNs, introducing the microedge concept to effectively capture and reuse intricate shared information among aggregation tasks, thereby minimizing redundant computations. We have developed a new microedge-centric dataflow model that processes shared information as fine-grained microedge aggregation tasks. This dataflow model is supported by the Read-Process-Activate-Generate execution model, which aims to optimize parallelism among these tasks. Furthermore, our newly developed MeHyper, a microedge-centric HGNN accelerator, incorporates a decoupled pipeline for improved computational parallelism and a hierarchical feature management strategy to reduce off-chip memory accesses for large volumes of intermediate feature vectors generated. Our evaluation demonstrates that MeHyper substantially outperforms the leading CPUbased system PyG-CPU and the GPU-based system HyperGef, delivering performance improvements of $1,032.23 \times$ and $10.51 \times$, and energy efficiencies of $1,169.03 \times$ and $9.96 \times$, respectively.

关键词： Computational modeling Neural networks Redundancy Pipelines Memory management Parallel processing Vectors Energy efficiency Hardware acceleration

来源：评论

学校读者我要写书评

暂无评论

Semantic and Emotional Dual Channel for Emotion Recognition in Conversation

引用

IEEE Transactions on Affective Computing 2025年

作者： Yang, Zhenyu Zhang, Zhibo Cheng, Yuhu Zhang, Tong Wang, Xuesong Jinan250353 China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan250353 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250353 China China University of Mining and Technology Engineering Research Center of Intelligent Control for Underground Space Ministry of Education Xuzhou Key Laboratory of Artificial Intelligence and Big Data School of Information and Control Engineering Xuzhou221116 China South China University of Technology Guangdong Provincial Key Laboratory of Computational Intelligence and Cyberspace Information School of Computer Science and Engineering Guangzhou510006 China Pazhou Lab Guangzhou510335 China Engineering Research Center Ministry of Education on Health Intelligent Perception and Paralleled Digital-Human Guangzhou China

Emotion recognition in conversation (ERC) aims at accurately identifying emotional states expressed in conversational content. Existing ERC methods, although relying on semantic understanding, often encounter challenges when confronted with incomplete or misleading semantic information. In addition, when dealing with the interaction between emotional and semantic information, existing methods are often difficult to effectively distinguish the complex relationship between the two, which affects the accuracy of emotion recognition. To address the problems of semantic misdirection and emotional cross-talk encountered by traditional models when confronted with complex conversational data, we propose a semantic and emotional dual channel (SEDC) strategy for emotion recognition in conversations to process emotional and semantic information independently. Under this strategy, emotion information provides an auxiliary recognition function when the semantics are unclear or lacking, enhancing the accuracy of the model. Our model consists of two modules: the emotion processing module accurately captures the emotional features of each utterance through contrastive learning, and then constructs a dialogue emotion propagation map to simulate the emotional information conveyed in the dialogue;the semantic processing module combines an external knowledge base to enhance the semantic expression of the dialogue through knowledge enhancement strategies. This divide-and-conquer approach allows us to more deeply analyze the emotional and semantic dimensions of complex dialogues. Experimental results on the IEMOCAP, EmoryNLP, MELD, and DailyDialog datasets show that our approach significantly outperforms existing techniques and effectively improves the accuracy of dialogue emotion recognition. Our code is available at https://***/r/SEDC-FCF1. © 2010-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

FedPHE: A Secure and Efficient Federated Learning via Packed Homomorphic Encryption

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Li, Yuqing Yan, Nan Chen, Jing Wang, Xiong Hong, Jianan He, Kun Wang, Wei Li, Bo Wuhan University Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan430072 China Wuhan University RiZhao Information Technology Institute Rizhao276800 China Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Wuhan430074 China Shanghai Jiao Tong University School of Cyber Science and Engineering Shanghai200240 China Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong

Cross-silo federated learning (FL) enables multiple institutions (clients) to collaboratively build a global model without sharing private data. To prevent privacy leakage during aggregation, homomorphic encryption (HE) is widely used to encrypt model updates, yet incurs high computation and communication overheads. To reduce these overheads, packed HE (PHE) has been proposed to encrypt multiple plaintexts into a single ciphertext. However, the original design of PHE assumes all clients share a single private key, making the system vulnerable to security threats of ciphertexts being intercepted and decrypted by honest-but-curious clients. Also, it does not consider the heterogeneity among different clients, resulting in undermined training efficiency with slow convergence and stragglers. To address these challenges, we propose FedPHE, a secure and efficient FL framework with PHE by jointly exploiting contribution-aware secure aggregation and straggler-resistant client selection. Using CKKS with sparsification and blinding, FedPHE achieves efficient secure aggregation that allows clients to only provide obscured encrypted updates while the server can perform aggregation by accounting for contributions of local updates. To mitigate the straggler effect, we devise a perturbed sketch-based selection to cherry-pick representative clients with heterogeneous models and computing capabilities in a communication-efficient and privacy-preserving manner. We show, through rigorous security analysis and extensive experiments, that FedPHE can efficiently safeguard clients' privacy, achieve 2.45-6.56× training speedup, cut the communication overhead by 1.32-24.85×, and reduce straggler effects by 1.89-2.78×. © 2004-2012 IEEE.

关键词： Privacy by design

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：