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

Robust federated contrastive recommender system against targeted model poisoning attack

science China(Information sciences) 2025年第4期68卷 50-65页

作者： Wei YUAN Chaoqun YANG Liang QU Guanhua YE Quoc Viet Hung NGUYEN Hongzhi YIN School of Electrical Engineering and Computer Science The University of Queensland School of Information and Communication Technology Griffith University Deep Neural Computing Company Limited

Federated recommender systems(FedRecs) have garnered increasing attention recently, thanks to their privacypreserving benefits. However, the decentralized and open characteristics of current FedRecs present at least two ***, the performance of FedRecs is compromised due to highly sparse on-device data for each client. Second, the system's robustness is undermined by the vulnerability to model poisoning attacks launched by malicious users. In this paper, we introduce a novel contrastive learning framework designed to fully leverage the client's sparse data through embedding augmentation, referred to as CL4FedRec. Unlike previous contrastive learning approaches in FedRecs that necessitate clients to share their private parameters, our CL4FedRec aligns with the basic FedRec learning protocol, ensuring compatibility with most existing FedRec implementations. We then evaluate the robustness of FedRecs equipped with CL4FedRec by subjecting it to several state-of-the-art model poisoning attacks. Surprisingly, our observations reveal that contrastive learning tends to exacerbate the vulnerability of FedRecs to these attacks. This is attributed to the enhanced embedding uniformity, making the polluted target item embedding easily proximate to popular items. Based on this insight, we propose an enhanced and robust version of CL4FedRec(rCL4FedRec) by introducing a regularizer to maintain the distance among item embeddings with different popularity levels. Extensive experiments conducted on four commonly used recommendation datasets demonstrate that rCL4FedRec significantly enhances both the model's performance and the robustness of FedRecs.

关键词： federated recommender system contrastive learning model poisoning attack and defense

来源：评论

学校读者我要写书评

暂无评论

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

引用

science China(Information sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

An Adaptive Scalable Data Pipeline for Multiclass Attack Classification in Large-Scale IoT Networks

引用

Big Data Mining and Analytics 2024年第2期7卷 500-511页

作者： Selvam Saravanan Uma Maheswari Balasubramanian Department of Computer Science and Engineering Amrita School of ComputingAmrita Vishwa VidyapeethamBengaluru 560035India

The current large-scale Internet of Things(IoT)networks typically generate high-velocity network traffic *** use IoT devices to create botnets and launch attacks,such as DDoS,Spamming,Cryptocurrency mining,Phishing,*** service providers of large-scale IoT networks need to set up a data pipeline to collect the vast network traffic data from the IoT devices,store it,analyze it,and report the malicious IoT devices and types of ***,the attacks originating from IoT devices are dynamic,as attackers launch one kind of attack at one time and another kind of attack at another *** number of attacks and benign instances also vary from time to *** phenomenon of change in attack patterns is called concept ***,the attack detection system must learn continuously from the ever-changing real-time attack patterns in large-scale IoT network *** meet this requirement,in this work,we propose a data pipeline with Apache Kafka,Apache Spark structured streaming,and MongoDB that can adapt to the ever-changing attack patterns in real time and classify attacks in large-scale IoT *** concept drift is detected,the proposed system retrains the classifier with the instances that cause the drift and a representative subsample instances from the previous training of the *** proposed approach is evaluated with the latest dataset,IoT23,which consists of benign and several attack instances from various IoT *** classification accuracy is improved from 97.8%to 99.46%by the proposed *** training time of distributed random forest algorithm is also studied by varying the number of cores in Apache Spark environment.

关键词： Internet of Things(IoT) concept drift Apache Spark MongoDB Apache Kafka streaming

来源：评论

学校读者我要写书评

暂无评论

CLIP-Flow:Decoding images encoded in CLIP space

引用

Computational Visual Media 2024年第6期10卷 1157-1168页

作者： Hao Ma Ming Li Jingyuan Yang Or Patashnik Dani Lischinski Daniel Cohen-Or Hui Huang Visual Computing Research Center College of Computer Science and Software EngineeringShenzhen UniversityShenzhen 518060China Department of Computer Science Tel Aviv UniversityTel Aviv 6997801Israel School of Computer Science and Engineering the Hebrew University of JerusalemJerusalem 91904Israel

This study introduces CLIP-Flow,a novel network for generating images from a given image or *** effectively utilize the rich semantics contained in both modalities,we designed a semantics-guided methodology for image-and text-to-image *** particular,we adopted Contrastive Language-Image Pretraining(CLIP)as an encoder to extract semantics and StyleGAN as a decoder to generate images from such ***,to bridge the embedding space of CLIP and latent space of StyleGAN,real NVP is employed and modified with activation normalization and invertible *** the images and text in CLIP share the same representation space,text prompts can be fed directly into CLIP-Flow to achieve text-to-image *** conducted extensive experiments on several datasets to validate the effectiveness of the proposed image-to-image synthesis *** addition,we tested on the public dataset Multi-Modal CelebA-HQ,for text-to-image *** validated that our approach can generate high-quality text-matching images,and is comparable with state-of-the-art methods,both qualitatively and quantitatively.

关键词： image-to-image text-to-image contrastive language-image pretraining(CLIP) flow StyleGAN

来源：评论

学校读者我要写书评

暂无评论

Manhattan-based k-member clustering and enhanced rabbit optimization algorithm for k-anonymization in social network

引用

Multimedia Tools and Applications 2024年第30期83卷 74739-74756页

作者： Sivasankari, K. Maheswari, K. M. Uma Department of computer science and engineering SRM Institute of Science and Technology Ramapuram Chennai India Department of computing technologies School of Computing College of Engineering and Technology SRM Institute of Science and Technology Kattankulathur India

Online social networks are becoming more and more popular, according to recent trends. The user's primary concern is the secure preservation of their data and privacy. A well-known method for preventing individual identity in publicly accessible datasets is K-anonymization. Existing anonymity techniques' primary drawback is that they're susceptible to similarity and attribute disclosure attacks. Furthermore, a large amount of data has been lost in the given database. To address this limitation, the proposed model integrated an anonymizing algorithm with Manhattan-based k-member clustering and an enhanced rabbit optimization algorithm (MKCAEROA). The Manhattan distance-based k member (MKCA) clustering algorithm is employed in this case to cluster the initial database. The resulting clusters are then further optimized, and the original database is made anonymous, using the enhanced rabbit optimization algorithm (EROA). In the suggested model, EROA is included to satisfy the specified anonymity constraints while concurrently minimizing the clustering error rate and the generated information loss. When compared to existing approaches, the experimental results demonstrate that the suggested method provides the highest clustering accuracy with the least amount of information loss. The MATLAB workbench will be used to implement the suggested model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Database systems

来源：评论

学校读者我要写书评

暂无评论

CALTM:A Context-Aware Long-Term Time-Series Forecasting Model

引用

computer Modeling in engineering & sciences 2024年第4期139卷 873-891页

作者： Canghong Jin Jiapeng Chen Shuyu Wu Hao Wu Shuoping Wang Jing Ying School of Computer and Computing Science Hangzhou City UniversityHangzhou310015China School of Computer Science and Engineering Macao University of Science and TechnologyMacao999078China College of Computer Science and Technology Zhejiang UniversityHangzhou310058China

Time series data plays a crucial role in intelligent transportation *** flow forecasting represents a precise estimation of future traffic flow within a specific region and time *** approaches,including sequence periodic,regression,and deep learning models,have shown promising results in short-term series ***,forecasting scenarios specifically focused on holiday traffic flow present unique challenges,such as distinct traffic patterns during vacations and the increased demand for long-term ***,the effectiveness of existing methods diminishes in such ***,we propose a novel longterm forecasting model based on scene matching and embedding fusion representation to forecast long-term holiday traffic *** model comprises three components:the similar scene matching module,responsible for extracting Similar Scene Features;the long-short term representation fusion module,which integrates scenario embeddings;and a simple fully connected layer at the head for making the final *** results on real datasets demonstrate that our model outperforms other methods,particularly in medium and long-term forecasting scenarios.

关键词： Traffic volume forecasting scene matching multi module fusion

来源：评论

学校读者我要写书评

暂无评论

A Transfer Function Design for Medical Volume Data Using a Knowledge Database Based on Deep Image and Primitive Intensity Profile Features Retrieval

引用

Journal of computer science & Technology 2024年第2期39卷 320-335页

作者： Younhyun Jung Jim Kong 盛斌 Jinman Kim School of Computing Gachon UniversitySeongnam 13120Korea School of Computer Science The University of SydneySydney 2006Australia Department of Computer Science and Engineering Shanghai Jiao Tong UniversityShanghai 200240China

Direct volume rendering(DVR)is a technique that emphasizes structures of interest(SOIs)within a volume visually,while simultaneously depicting adjacent regional information,e.g.,the spatial location of a structure concerning its *** DVR,transfer function(TF)plays a key role by enabling accurate identification of SOIs interactively as well as ensuring appropriate visibility of *** generation typically involves non-intuitive trial-and-error optimization of rendering parameters,which is time-consuming and *** at mitigating this manual process have led to approaches that make use of a knowledge database consisting of pre-designed TFs by domain *** these approaches,a user navigates the knowledge database to find the most suitable pre-designed TF for their input volume to visualize the *** these approaches potentially reduce the workload to generate the TFs,they,however,require manual TF navigation of the knowledge database,as well as the likely fine tuning of the selected TF to suit the *** this work,we propose a TF design approach,CBR-TF,where we introduce a new content-based retrieval(CBR)method to automatically navigate the knowledge *** of pre-designed TFs,our knowledge database contains volumes with SOI *** an input volume,our CBR-TF approach retrieves relevant volumes(with SOI labels)from the knowledge database;the retrieved labels are then used to generate and optimize TFs of the *** approach largely reduces manual TF navigation and fine *** our CBR-TF approach,we introduce a novel volumetric image feature which includes both a local primitive intensity profile along the SOIs and regional spatial semantics available from the co-planar images to the *** the regional spatial semantics,we adopt a convolutional neural network to obtain high-level image feature *** the intensity profile,we extend the dynamic time warping technique to address subtle alignment

关键词： data retrieval direct volume rendering ray analysis transfer function

来源：评论

学校读者我要写书评

暂无评论

Minimal Context-Switching Data Race Detection with Dataflow Tracking

引用

Journal of computer science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

Music genre classification using convolution temporal pooling network

引用

Multimedia Tools and Applications 2024年 1-16页

作者： T. M, Vijayameenakshi T. R, Swapna Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Coimbatore India

Music genre classification is one of the most interesting topics in digital music. Classifying genres is basically subjective, and different listeners may perceive genres in various ways. Furthermore, it might be difficult to classify some songs accurately since they belong to numerous genres. Genres are incredibly wide and ill-defined categories, which makes them problematic. Thus, genre-based measures are inherently inaccurate and coarse. Moreover, not every piece of music cleanly fits into a particular genre. Many papers based on deep neural networks perform sound recognition and classification with input images of audio, which do not affect the time–frequency representation of a signal. The traditional method adds waveform augmentation to the audio signal, thereby increasing the network's training speed. This paper considers music genre classification with the convolution temporal pooling framework and explores the impact of adding the SpecAugment method to augment the spectrogram itself. The augmented spectrogram is then fed into a convolutional temporal pooling network. In this model, the temporal and pooling layers identify the genre pattern and classify the songs based on the genre. It also predicts these duplication that will occur in the given sample. We apply this model to the GTZAN dataset, a widely used dataset for music genre classification. This method improves the identification of Rock and Pop song and also eliminates the replication of the songs. The trained model reports an accuracy of 0.75 for training a 30-s audio file. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Convolutional temporal pooling network Genre classification Music genre classification SpecAugment Spectrogram

来源：评论

学校读者我要写书评

暂无评论

Real-Time Speech Enhancement Based on Convolutional Recurrent Neural Network

引用

Intelligent Automation & Soft computing 2023年第2期35卷 1987-2001页

作者： S.Girirajan A.Pandian Department of Computer Science and Engineering School of ComputingSRM Institute of Science and EngineeringKattankulathurTamil NaduIndia

Speech enhancement is the task of taking a noisy speech input and pro-ducing an enhanced speech *** recent years,the need for speech enhance-ment has been increased due to challenges that occurred in various applications such as hearing aids,Automatic Speech Recognition(ASR),and mobile speech communication *** of the Speech Enhancement research work has been carried out for English,Chinese,and other European *** a few research works involve speech enhancement in Indian regional *** this paper,we propose a two-fold architecture to perform speech enhancement for Tamil speech signal based on convolutional recurrent neural network(CRN)that addresses the speech enhancement in a real-time single channel or track of sound created by the *** theﬁrst stage mask based long short-term mem-ory(LSTM)is used for noise suppression along with loss function and in the sec-ond stage,Convolutional Encoder-Decoder(CED)is used for speech *** proposed model is evaluated on various speaker and noisy environments like Babble noise,car noise,and white Gaussian *** proposed CRN model improves speech quality by 0.1 points when compared with the LSTM base model and also CRN requires fewer parameters for *** performance of the pro-posed model is outstanding even in low Signal to Noise Ratio(SNR).

关键词： Speech enhancement convolutional encoder-decoder long short-term memory noise suppression speech restoration

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：