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

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Zhang, Yunan Wang, Chaohui Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Community evolution tracking is widely used in complex network analysis, which analyzes and identifies how communities evolve over time based on dynamic community detection. However, the current incremental dynamic community detection method has the phenomenon of ’concept drift’, which leads to inaccurate tracking of community evolution. Although some studies on dynamic community detection have proposed to perform global community detection on the network by timing or when the error information accumulates to a certain extent, this method will lead to a sudden change in community division, which will interrupt the evolution sequence of some communities and bring great difficulties to the continuous tracking of community evolution. In addition, the current community evolution tracking methods match the communities of two adjacent snapshots, and it is difficult to capture the fine-grained evolution process within the community. This paper proposes a community evolution tracking algorithm based on high-order neighbor consideration and node change identification. Firstly, based on an incremental update strategy that considers high-order neighbors, we adaptively expand the scope of incremental updates to reduce the accumulation of error information. Secondly, through the node change identification strategy to mine fine-grained community evolution events. Experiments show that our method can effectively track the evolution of communities in dynamic networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Community evolution Complex network Dynamic network Evolution tracking

来源：评论

学校读者我要写书评

暂无评论

Community-Aware Heterogeneous Graph Contrastive Learning 19th

Community-Aware Heterogeneous Graph Contrastive Learning

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Xinying Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Recently, heterogeneous graph contrastive learning, which can mine supervision signals from the data, has attracted widespread attention. However, most existing methods employ random data augmentation strategies to construct contrastive views, which may destroy the semantic information in heterogeneous graphs. Moreover, they often select positive and negative samples based solely on node-level proximity and overlook hard samples that are difficult to distinguish from anchors. To solve the above problems, we propose a Community-Aware Heterogeneous Graph Contrastive Learning model called CAHGCL. In particular, we design an adaptive data augmentation strategy to construct views, including feature augmentation and topology augmentation. To improve the quality of samples, we propose a dynamic sample weighting strategy based on node similarity and community information, capable of identifying both hard positive samples and hard negative samples. Finally, we introduce community-level contrast to improve community cohesion. Extensive experiments and analyses demonstrate that CAHGCL consistently outperforms state-of-the-art baselines on three datasets. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

MNN: Mixed Nearest-Neighbors for Self-Supervised Learning

arXiv

引用

arXiv 2023年

作者： Long, Xianzhong Peng, Chen Li, Yun School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Jiangsu Key Laboratory of Big Data Security and Intelligent Processing Nanjing210023 China

In contrastive self-supervised learning, positive samples are typically drawn from the same image but in different augmented views, resulting in a relatively limited source of positive samples. An effective way to alleviate this problem is to incorporate the relationship between samples, which involves including the top-K nearest neighbors of positive samples. However, the problem of false neighbors (i.e., neighbors that do not belong to the same category as the positive sample) is an objective but often overlooked challenge due to the query of neighbor samples without supervision information. In this paper, we present a simple self-supervised learning framework called Mixed Nearest-Neighbors for Self-Supervised Learning (MNN). MNN optimizes the influence of neighbor samples on the semantics of positive samples through an intuitive weighting approach and image mixture operations. The results demonstrate that MNN exhibits exceptional generalization performance and training efficiency on four benchmark datasets. © 2023, CC BY.

关键词： Supervised learning

来源：评论

学校读者我要写书评

暂无评论

LogPal: A Generic Anomaly Detection Scheme of Heterogeneous Logs for Network Systems

引用

Security and Communication Networks 2023年第1期2023卷

作者： Sun, Lei Xu, Xiaolong Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications Nanjing210023 China School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China

As a key resource for diagnosing and identifying problems, network syslog contains vast quantities of information. And it is the main source of data for anomaly detection of systems. Syslog presents the characteristics of large scale, diverse types and sources, data noise, and quick evolvement, which makes the detection methods not generic enough. To effectively address problem of log anomaly labelling caused by massive heterogeneous logs, we propose LogPal, a generic anomaly detection scheme of heterogeneous logs for network systems, which innovatively combines template sequences and raw log sequences to construct and generate log pattern events. By improving the self-attention mechanism of transformer, LogPal proactively synthesizes self-attention and handles log pattern events in a unique way. The model can make full use of log template and sequence semantic information, by automatically becoming aware of the pattern of logs. We implemented experiments to evaluate the performance of LogPal on publicly available datasets, and the outcome of the experiments shows that LogPal automatically adapts to log type changes and improves precision, recall, and F1 score to 99% on publicly available datasets. © 2023 Lei Sun and Xiaolong Xu.

关键词： Anomaly detection

来源：评论

学校读者我要写书评

暂无评论

A Novel DDoS Detection Model for SDN Using Single-Class Cluster Oversampling and Weighted Ensemble Method

A Novel DDoS Detection Model for SDN Using Single-Class Clus...

引用

International Conference on Network Protocols

作者： Hao Zhang Shuqi Wu Jie Pan Zhi Wang Xiaolong Sun College of Computer and Data Science Fuzhou University Fuzhou China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou China

ISBN: (数字)9798350351712

ISBN: (纸本)9798350351729

The centralized control plane characteristic of Software Defined Networking (SDN) makes it a prime target for Distributed Denial of Service (DDoS) attacks. A significant issue in network traffic data is the severe imbalance between background traffic and various types of DDoS attack traffic. To address this challenge, we propose a novel DDoS detection model based on single-class cluster oversampling and weighted ensemble method. Initially, we design a multi-strategy feature selection using variance inflation factor and recursive feature elimination. Next, we construct a single-class cluster model based on the spatial distribution of samples, and create minority class samples independently within each cluster. Finally, detection results are determined using the weight vector of each base classifier in ensemble learning. The proposed DDoS detection model's performance is validated through simulations of various DDoS attack scenarios in an SDN environment. Experimental results indicate that the proposed strategy exhibits superior performance, showing improvements in precision, recall, and F1 score compared to state-of-the-art techniques.

关键词： Interpolation Protocols Telecommunication traffic Denial-of-service attack Feature extraction Vectors data models Ensemble learning Computer crime Software defined networking

来源：评论

学校读者我要写书评

暂无评论

A Region Enhanced Discrete Multi-Objective Fireworks Algorithm for Low-Carbon Vehicle Routing Problem

引用

Complex System Modeling and Simulation 2022年第2期2卷 142-155页

作者： Xiaoning Shen Jiaqi Lu Xuan You Liyan Song Zhongpei Ge Collaborative Innovation Center of Atmospheric Environment and Equipment Technology Jiangsu Key Laboratory of Big Data Analysis TechnologySchool of AutomationNanjing University of Information Science and TechnologyNanjing 210044China School of Automation Nanjing University of Information Science and TechnologyNanjing 210044China Institute of Trustworthy Autonomous Systems and also with the Guangdong Provincial Key Laboratory of Brain-Inspired Intelligent ComputationDepartment of Computer Science and EngineeringSouthern University of Science and TechnologyShenzhen 518055China

A constrained multi-objective optimization model for the low-carbon vehicle routing problem(VRP)is established.A carbon emission measurement method considering various practical factors is *** minimizes both the total carbon emissions and the longest time consumed by the sub-tours,subject to the limited number of available *** to the characteristics of the model,a region enhanced discrete multi-objective fireworks algorithm is proposed.A partial mapping explosion operator,a hybrid mutation for adjusting the sub-tours,and an objective-driven extending search are designed,which aim to improve the convergence,diversity,and spread of the non-dominated solutions produced by the algorithm,*** low-carbon VRP instances with different scales are used to verify the effectiveness of the new ***,comparison results with four state-of-the-art algorithms indicate that the proposed algorithm has better performance of convergence and distribution on the low-carbon *** provides a promising scalability to the problem size.

关键词： vehicle routing problem carbon emission multi-objective optimization fireworks algorithm region enhanced

来源：评论

学校读者我要写书评

暂无评论

D-FGNAE: Decentralized Federated Graph Normalized AutoEncoder 19th

D-FGNAE: Decentralized Federated Graph Normalized AutoEncode...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Liang, Yuting Cai, Weixin Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Graphs widely exist in real-world, and Graph Neural Networks (GNNs) have exhibited exceptional efficacy in graph learning in diverse fields. With the strengthening of data privacy protection worldwide in recent years, Federated graph neural networks (FedGNNs) have gained increasing attention in academia and industry owing to their ability to train the model in a collaborative manner while complying with the privacy protection regulations. However, in federated learning, the non-independent and identically distributed (non-IID) problem of local data possessed by multiple participants can significantly undermine model accuracy. We propose a new Decentralized Federated Graph Normalized AutoEncoder (D-FGNAE). First, the model is designed as a decentralized federated learning framework with dynamically assigned tripartite roles. This design eliminates the fixed server role found in traditional federated learning, enhances system fault tolerance, avoids single points of failure, and protects model privacy. Second, the splitting and correcting of calculation by layer in the model, along with the special design of the normalization layer, effectively tackle the non-IID problem in both the structural and attribute aspects. Experimental results on real-world networks demonstrate the effectiveness of D-FGNAE, which can achieve nearly the same accuracy as the centralized model. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

UGCM-LU: A Unified Stream and Batch Graph Computing Model with Local Update for Community Detection 19th

UGCM-LU: A Unified Stream and Batch Graph Computing Model w...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social Computing, ChineseCSCW 2024

作者： Li, Hong Wu, Ling Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China

ISBN: (纸本)9789819623723

Unified stream and batch computing (USBC) aims to incorporate stream and batch computation into a unified framework, thereby enabling the development of a one-stop solution for stream and batch data processing and enhancing the generalization of the framework. However, research on unified graph computing models (UGCMs) faces several challenges. First, existing UGCMs need to consider all graph information in the cache during the incremental update phase, thus leading to decreased execution efficiency. Second, existing UGCMs use fixed bytes to store nodes without considering the actual space occupied by nodes resulting in wasted memory when dealing with large graphs. This paper proposes a UGCM with Local Updates for community detection (UGCM-LU). We first implement a local update strategy to consider partial information of the graph to achieve incremental updates. Secondly, we also designed a byte-compression-based module to store graph data according to the space occupied by nodes. The experimental results show the effectiveness and efficiency of the model in real-world and artificial networks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Lutetium alloys

来源：评论

学校读者我要写书评

暂无评论

DFGET: Displacement-Field Assisted Graph Energy Transmitter for Gland Instance Segmentation

DFGET: Displacement-Field Assisted Graph Energy Transmitter ...

引用

International Conference on Signal Processing Proceedings (ICSP)

作者： Caiqing Jian Yongbin Qin Lihui Wang Chen Ye Xinyu Cheng GState Key Laboratory of Public Big Data College of Computer Science and Technology Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province Guizhou University Guiyang China

ISBN: (数字)9798350387384

ISBN: (纸本)9798350387391

Gland instance segmentation is an essential but challenging task in the diagnosis of adenocarcinoma. The existing models usually achieve gland instance segmentation through multi-task learning and boundary loss constraint. However, how to deal with the problems of gland adhesion and inaccurate boundary in segmenting the complex samples remains a challenge. In this work, we propose a novel geometric feature named displacement field (DF), which can represent the geometric information such as shape, size, and orientation of the glands. Based on the explicit constraint of DF, a displacement-field assisted graph energy transmitter (DFGET) framework is proposed for solving the above problems. Using such graph framework, the gland semantic segmentation map and the displacement field of the graph nodes are estimated with two graph network branches. With the constraint of DF, a graph cluster module is presented to improve the intra-class feature consistency and inter-class feature discrepancy, as well as to separate the adherent glands. Extensive comparison and ablation experiments on the GlaS dataset demonstrate the effectiveness of the displacement field and the superiority of DFGET. Compared to the best comparative model, DFGET increases the object-Dice and object-F1 score by 2.27% and 3.11% respectively, while decreases the object-HD by 15.58, achieving state-of-the-art performance, which indicates that DFGET can serve as an auxiliary tool for the diagnosis of adenocarcinoma.

关键词： Instance segmentation Measurement Visualization Adhesives Shape Semantic segmentation Glands Signal processing algorithms Signal processing Market research

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：