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

arXiv 2025年

作者： Pan, Linchao Gao, Can Zhou, Jie Wang, Jinbao College of Computer Science and Software Engineering Shenzhen University China Guangdong Provincial Key Laboratory of Intelligent Information Processing China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University China

Learning with Noisy Labels (LNL) aims to improve the model generalization when facing data with noisy labels, and existing methods generally assume that noisy labels come from known classes, called closed-set noise. However, in real-world scenarios, noisy labels from similar unknown classes, i.e., open-set noise, may occur during the training and inference stage. Such open-world noisy labels may significantly impact the performance of LNL methods. In this study, we propose a novel dual-space joint learning method to robustly handle the open-world noise. To mitigate model overfitting on closed-set and open-set noises, a dual representation space is constructed by two networks. One is a projection network that learns shared representations in the prototype space, while the other is a One-Vs-All (OVA) network that makes predictions using unique semantic representations in the class-independent space. Then, bi-level contrastive learning and consistency regularization are introduced in two spaces to enhance the detection capability for data with unknown classes. To benefit from the memorization effects across different types of samples, class-independent margin criteria are designed for sample identification, which selects clean samples, weights closed-set noise, and filters open-set noise effectively. Extensive experiments demonstrate that our method outperforms the state-of-the-art methods and achieves an average accuracy improvement of 4.55% and an AUROC improvement of 6.17% on CIFAR80N. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Cross-Chain Privacy-Preserving for BIoMT With Designated Verifier Proxy Signature

引用

IEEE Internet of Things Journal 2025年

作者： Li, Chaoyang Jiang, Bohao Dong, Mianxiong Chen, Yuling Huang, Min Xin, Xiangjun Ota, Kaoru Zhengzhou University of Light Industry College of Software Engineering Zhengzhou450001 China Muroran Institution of Technology Muroran050-8585 Japan Guizhou University State Key Laboratory of Public Big Data Guizhou Guiyang550025 China

Blockchain-enabled Internet of Medical Things (BIoMT) has received extensive attention and in-depth research to solve the centralized, data island problems with the rapid developments of blockchain-related technologies. However, many different chains with different data structures, consensus protocols, and cryptographic algorithms are constructed, which brings a new »data island» problem. Meanwhile, the cryptographic algorithms used in most current BIoMT systems are weak against quantum attacks. In this paper, a cross-chain privacy-preserving (CCPP) model and a designated verifier proxy signature (DVPS) scheme have been proposed. This CCPP model is equipped with the relay chain technology and DVPS to achieve secure cross-chain medical data-sharing among different BIoMT systems. The DVPS scheme is constructed with lattice theory, which can achieve signer proxy, designated user verification, and anti-quantum attack. Then, the security proof shows that the proposed DVPS can capture the security properties of correctness, unforgeability, the signer's anonymity, and non-transferability. The performance evaluations show that the cross-chain transactions are efficient and stable with the transaction number increasing, and the proposed DVPS is efficient about the key size, time consumption, and energy consumption. This work can also improve the privacy security of system users and medical data in BIoMT systems and promote the value play of medical data. © 2014 IEEE.

关键词： Lattice theory

来源：评论

学校读者我要写书评

暂无评论

Multi-view aggregation and multi-relation alignment for few-shot fine-grained recognition

引用

Expert Systems with Applications 2025年 283卷

作者： Chen, Jiale Xu, Feng Lyu, Xin Zeng, Tao Li, Xin Chen, Shangjing College of Computer Science and Software Engineering Hohai University Nanjing210024 China School of Computer Engineering Jiangsu Ocean University Lianyungang222005 China Key Laboratory of Water Big Data Technology of Ministry of Water Resources Hohai University Nanjing211106 China

Few-shot fine-grained recognition (FS-FGR) aims to recognize nuanced categories with a limited number of labeled samples that were not encountered during training. Previous work has made significant progress by enhancing the learning of foreground refined regions and the alignment of consistent semantics. However, the detrimental impact of insufficient background diversity on constructing representative category prototypes has been overlooked. Meanwhile, the alignment of semantically consistent features has been hampered by the reliance on singular metrics, resulting in suboptimal feature extraction. To address the limitations above, a novel framework with multi-view aggregation and multi-relation alignment (MVRA) is proposed. In this framework, we strive to refine category prototypes by generating and consolidating multiple views from limited learnable samples. Specifically, we generate foreground-refined views, pinpointing discriminative regions, and background-obfuscated views, broadening the landscape of background diversity. Further, without relying on the entire prior, a global label assignment module is designed to automatically assign reliable labels to the query set samples. Finally, armed with these credible labels, the multi-relation alignment module harnesses the enriched views and their semantic congruencies, facilitating robust feature extraction. The effectiveness and outstanding performance of MVRA are evaluated through extensive experiments conducted on three fine-grained benchmark datasets. © 2025

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Knowledge-driven prototype refinement for few-shot fine-grained recognition

引用

Knowledge-Based Systems 2025年 318卷

Advancements in deep learning have made image classification rival human performance with sufficient data and supervision. However, in domains with limited visual samples and high labeling costs, enabling AI systems to learn efficiently from few examples is challenging. This challenge is compounded in fine-grained categories, where subtle differences and scarce samples hinder robust representation extraction. To address this, we propose the Knowledge-Driven Prototype Refinement (KDPR) framework, which enhances few-shot fine-grained recognition by integrating prior knowledge from text. KDPR simulates human focus on discriminative foreground regions to extract refined views, forming a dual-branch learning framework alongside original images. It also constructs an unsupervised adjacency graph among visual instances and uses graph neural networks to improve category representation robustness. Additionally, a knowledge transfer-based image recognizer integrates prior text embeddings with global semantics directly into visual recognition, providing extra semantic guidance. To optimize knowledge-to-vision mapping, an auxiliary spatial prototype calibration aligns prototype representations across multiple spaces. Extensive experiments on three fine-grained datasets and two popular backbones demonstrate the effectiveness and state-of-the-art performance of our approach, especially in 1-shot learning. The source code is available at: https://***/HHU-JialeChen/KDPRNet. © 2025

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

Personalized Intelligent Job Recommendation Based on Deep Learning in Elasticsearch Environment

Journal of Network Intelligence

引用

Journal of Network Intelligence 2025年第1期10卷 339-352页

作者： Cui, Xiu-Yan Hwang, David Hebei Software Institute Hebei Province University Intelligent Interconnection Equipment and Multimodal Big Data Application Technology Research and Development Center Baoding071000 China College of Engineering St. Paul University Philippines Tuguegarao3500 Philippines

Aiming at the issue that the jobs predicted by the existing job recommendation methods cannot be precisely matched with the job seekers, this paper designs a personalized intelligent job recommendation method based on deep learning in the Elas-ticsearch environment. Firstly, to deal with the data sparsity and cold start issue of traditional collaborative filtering algorithms, the similarity calculation formula of Pearson’s correlation in the algorithm is modified to enhance the accuracy of similarity calculation. Secondly, on the ground of the history of different job seekers, the keywords of job seekers are constructed in terms of various weights, and input into ElasticSearch to recall the set of jobs that are strongly related to the job seekers. Then adopting Convolutional Neural Network (CNN) to extract the text data features of job seekers and positions, and meanwhile, integrating the attention mechanism to get the auxiliary features of job seekers and positions, and finally, integrating the implicit feedback data with other at-tribute features of job seekers and positions as the input of the improved collaborative filtration algorithm, so that we can realize the intelligent recommendation of jobs for job seekers. Simulation outcome indicates that the Mean Absolute Error (MAE), Mean Absolute Percentage Error (MAPE), Root Mean Squared Error (RMSE) and Root Mean Square Percentage Error (RMSPE) of the suggested method are 0.0681, 0.0519, 0.0834 and 0.0628 respectively, which are lower than those of the comparison method, and the accuracy of the recommendation is effectively enhanced. © 2025, Taiwan Ubiquitous Information CO LTD. All rights reserved.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

A Trust-Based Personalized Differential Privacy Guarantees for Online Social Networks

引用

IEEE Transactions on Network and Service Management 2025年

作者： Chen, Jiajun Hu, Chunqiang Sheng, Weihong Li, Ruinian Zhao, Ruifeng Yu, Jiguo Chongqing University College of Computer Science Chongqing401331 China Chongqing University School of Big Data and Software Engineering Chongqing401331 China Bowling Green State University Computer Science Department United States Electric Power Dispatching and Control Center of Guangdong Power Grid Co. Ltd Guangzhou China University of Electronic Science and Technology of China School of Information and Software Engineering Chengdu611731 China Qilu University of Technology Big Data Institute Jinan250353 China

Online social networks have emerged as a significant data source, but the extensive collection and utilization of personal information have given rise to profound concerns regarding privacy. From a legislative and policy perspective, and in alignment with the concept of privacy as control, users have the right to control their personal privacy information. However, users often encounter challenges in terms of understanding and effectively managing their privacy settings to align with their specific privacy requirements. To address this issue, in this paper, we incorporate the concept of trust and propose a trust-based personalized differential privacy model for online social networks, denoted as TPDP, which relies on a trusted central server to facilitate its operation. Specifically, when a user requests access to another user's personal information, the TPDP mechanism provides a privacy response, where the privacy level is determined based on the direct and indirect trust values among users, calculated automatically by the trusted central server. Furthermore, the proposed TPDP model offers user-to-user personalized differential privacy protection from the perspectives of network structures, trust-related factors, and trust propagation patterns. Finally, we validate the model's feasibility and assess the privacy-utility trade-off, as well as its robustness against attacks, through theoretical analysis and performance evaluation. © 2004-2012 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

FedVC: Virtual Clients for Federated Autonomous Driving With Imbalanced Label Distribution

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Zhang, Yongquan Chen, Hongda Wang, Zhihui Kumar, Rahul Wang, Changmiao Zhejiang University of Finance and Economics School of Data Science Hangzhou310018 China Xi'an Jiaotong University School of Software Engineering Xi'an710049 China Shandong University of Science and Technology College of Computer Science and Engineering Qingdao266510 China Ssv Pg College Department Of Mathematics Hapur245101 India Shenzhen Research Institute of Big Data Shenzhen518172 China

Federated learning in autonomous driving safeguards the privacy of individual vehicles during collaborative training by avoiding the exchange of raw data. These vehicles often suffer from imbalanced label distribution, making the federated learning model developed from them critical for safety. Most current solutions addressing label imbalance in federated learning are oriented towards classification tasks. However, there is limited research focused on prediction tasks involving imbalanced datasets relevant to autonomous driving. To address the identified gap, we introduce an innovative peer-to-peer federated learning framework called FedVC. This framework includes the use of virtual clients to enhance the ability of the collaborative training process to recognize the global data distribution effectively. It strategically samples relevant segments of local data from various clients for each training round and controls the execution time for backpropagation associated with each virtual client. Importantly, FedVC constructs a global perspective by utilizing metadata from each client, thereby maintaining data privacy while overcoming the challenge of label imbalance in autonomous driving prediction tasks, all without the need to share any raw datasets. Experimental results demonstrate that FedVC outperforms classical FedAvg and the most recent methods at three steering angle prediction datasets with different levels of imbalanced label distribution. The source code is publicly available at https://***/aikedaerC/FedVC. © 1975-2011 IEEE.

关键词： Autonomous Driving data Imbalance Federated Learning Virtual Clients

来源：评论

学校读者我要写书评

暂无评论

An Encoder-Decoder Model Based On Spiking Neural Networks For Address Event Representation Object Recognition

引用

IEEE Transactions on Cognitive and Developmental Systems 2025年

作者： Du, Sichun Zhu, Haodi Zhang, Yang Hong, Qinghui Hunan University College of Computer Science and Electronic Engineering Changsha418002 China Shenzhen University Computer Vision Institute School of Computer Science and Software Engineering National Engineering Laboratory for Big Data System Computing Technology Guangdong Key Laboratory of Intelligent Information Processing Shenzhen518060 China

Address event representation (AER) object recognition task has attracted extensive attention in neuromorphic vision processing. The spike-based and event-driven computation inherent in the spiking neural network (SNN) provides an energy-saving solution for AER object recognition. However, SNN with spike timing dependent plasticity (STDP) learning rule has not achieved satisfying AER object recognition performance. This work proposes an SNN-based encoder-decoder model to improve the recognition performance of AER objects. An STDP-based locally connected spiking neural network (LC-SNN) is proposed as an encoder to extract rich spatiotemporal features from AER event flows more flexibly. After the encoder extracts and learns primary features, we propose a fully connected spiking neural network (FC-SNN) based on the reward-modulated spike-timing-dependent plasticity (R-STDP) learning rule as a decoder to learn higher-level features for classification. In addition, we improved the winner-take-all (WTA) mechanisms and R-STDP learning rule in the decoder based on the reward and punish decision, enabling the network to perform better. The experiments are performed on the N-MNIST, MNIST-DVS, and the DVS Gesture datasets, improving the accuracy of the best existing plasticity-based SNN by 0.19%, 0.27% and 1.35%, respectively. © 2016 IEEE.

关键词： Decoding

来源：评论

学校读者我要写书评

暂无评论

DBSSL: A Scheme to Detect Backdoor Attacks in Self-Supervised Learning Models

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Huang, Yuxian Yang, Geng Yuan, Dong Yu, Shui Nanjing University of Posts and Telecommunication College of Computer Science and Software China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing China University of Sydney School of Electrical and Information Engineering Australia University of Technology Sydney School of Computer Science Australia

Recently, self-supervised learning has garnered significant attention for its ability to extract high-quality features from unlabeled data. However, existing research indicates that backdoor attacks can pose significant threats to self-supervised learning. Additionally, due to the substantial training overhead, traditional backdoor detection methods in supervised learning, such as meta-learning, are not well-suited for self-supervised learning. Current backdoor detection methods for self-supervised learning can only defend against backdoor attacks triggered by patch. To address this challenge, we proposes DBSSL, a scheme that can efficiently detect backdoor attacks in self-supervised learning models. In DBSSL, we connect backdoor attacks with adversarial attacks and use adversarial perturbations for detection. Specifically, we first conduct targeted adversarial attacks on the samples, classifying them into different classes. Then, we employ the Z-Score method to analyze these adversarial perturbations. If outliers are present, we can infer that the self-supervised learning model has been backdoored. Unlike previous works, our scheme is better suited for downstream users with constrained computation resources and exhibits excellent detection capabilities for backdoor attacks caused by patch -type or global triggers. Abundant theoretical analysis has demonstrated the feasibility of our scheme. Moreover, extensive experiments show that our method performs well in detecting prevalent backdoor attacks in self-supervised learning, achieving detection accuracy exceeding 95%. © 2004-2012 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Preserving Location Privacy of IoT Devices in Heterogeneous Edge Computing Architecture Through Deniability-Based Authentication

引用

IEEE Transactions on Consumer Electronics 2025年

作者： Ali, Ikram Li, Jianqiang Chen, Jie Chen, Yong Ullah, Shamsher Wakeel, Abdul Shenzhen University National Engineering Laboratory of Big Data System Computing Technology Shenzhen518060 China Shenzhen University College of Computer Science and Software Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Automation Engineering Chengdu611731 China National University of Sciences and Technology Military College of Signals Department of Electrical Engineering Islamabad Pakistan

Edge computing moves cloud services closer to consumer Internet of Things (IoT) devices, reducing latency and bandwidth usage. This setup enables faster responses but also introduces new security challenges, particularly concerning location privacy when sender and receiver use different security techniques. The authentication process in such architectures can expose the location of IoT devices. To address this issue, researchers have proposed various privacy-preserving schemes. However, these are computationally heavy for IoT devices. To tackle this issue, we propose two novel heterogeneous deniable authentication schemes: HDA-IoT-I and HDA-IoT-II. These schemes use public-key infrastructure and identity-based cryptography to protect the location privacy of IoT devices in heterogeneous edge computing environments. Our schemes enable the designated edge device to verify the source of a message without being able to prove its origin to a third party, thus preserving privacy. Additionally, they incorporate a batch verification method, which speeds up the verification of multiple deniable authenticators. The proposed schemes are formally proven secure in the random oracle model based on the hardness assumption of elliptic curve inverse computational Diffie-Hellman problem. The performance evaluation demonstrate that our schemes significantly enhance computational and communication efficiency, making them suitable for IoT devices. © 2025 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：