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

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

来源：评论

学校读者我要写书评

暂无评论

Community Evolution Tracking Based on High-Order Neighbor Consideration and Node Change Identification 19th

Community Evolution Tracking Based on High-Order Neighbor C...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Explainable Application Intent for Zero-Touch Networking: An Incorporation of Hypergraph and Transformer

引用

IEEE Transactions on Communications 2025年

作者： Wu, Bing Zou, Sai Liwang, Minghui Ni, Wei Wang, Xianbin Guizhou University College of Big Data and Information Engineering China National Key Laboratory of Autonomous Intelligent Unmanned Systems Department of Control Science and Engineering China Tongji University Frontiers Science Center for Intelligent Autonomous Systems Ministry of Education Shanghai China Data61 CSIRO Australia Department of Electrical and Computer Engineering Western University Canada

The autonomous interpretation of application intent (APPI) represents the primary step towards achieving closed-loop autonomy in zero-touch networking (ZTN) and also a prerequisite for intent-based networking (IBN). However, understanding APPIs and invoking the corresponding network resources require network professionals with extensive technical expertise to customize network service requests (NSRs), which presents significant challenges for the large-scale deployment of ZTN. This paper investigates an interesting problem of autonomous interpretation of APPIs for ZTN, where a novel mechanism integrating hypergraph and transformer with completeness assurance (HyperTrans-CA) is proposed. In particular, we first involve the Bayesian theory to model APPIs interpretability as maximizing the correct transition probability, where hypergraph is used to describe the complex relationship between application characteristics (e.g., scenario function, and performance) and NSRs, including network devices, virtual network functions (VNFs), and resources. Then, the hypergraph is integrated into the encoder, decoder, and attention mechanisms of Transformer, and a completeness assurance mechanism is designed to improve the prediction accuracy. The convergence of HyperTrans-CA and the corresponding convergence speed of the hypergraph-boosted Transformer in the graph search process are also analyzed. Comprehensive simulations and empirical measurements regarding industrial internet demonstrate that HyperTrans-CA can effectively explain/understand APPIs. Compared to the state-of-the-art Transformer and ChatGPT3.5 models, HyperTrans-CA improves the prediction accuracy of APPIs mapped to VNFs by 23% and 46%, respectively, while raising the prediction accuracy of VNF locations by 8.6 and 17.3 times. © 2025 IEEE.

关键词： Bayesian networks

来源：评论

学校读者我要写书评

暂无评论

AdvMap: Crafting Adversarial Maps to Counter AI Aimbot in First-Person Shooter Games

引用

IEEE Transactions on Games 2025年

作者： Yan, Kai Chen, Xianyi Cui, Qi Yuan, Haoqin Tan, Zhenshan Nanjing University of Information Science and Technology Engineering Research Center of Digital Forensics Ministry of Education the School of Computer Science Nanjing210044 China Beijing Jiaotong University Key Laboratory of Transport Industry of Big Data Application Technologies for Comprehensive Transport Beijing100044 China

AI-based automatic aiming cheats (a.k.a., AI aimbots) have proliferated in first-person shooter (FPS) games, which grant malicious users an unfair gameplay advantage. Since AI aimbots operate independently of game data and are developed using object detection algorithms, they are difficult to detect with traditional anti-cheating methods. To actively counter AI aimbots, we propose AdvMap, which introduces invisible adversarial perturbations into game scene elements. In optimizing these adversarial perturbations, we design a mixture-of-misleading loss function that increases the total target confidence score within each misleading bounding box. It mitigates the risk of segment missing even when AdvMap is obscured, thereby enhancing the robustness. Besides, an L1-norm constraint with a small scale is employed during each update of the adversarial perturbations, which preserves the fidelity of the game scene. Additionally, to enable effective adaptation to interact with various elements within game environments, we introduce an Image-Subspace-Based Multi-Directional (ISMD) optimization strategy. It enables the adversarial perturbations to adaptively fit into each element by leveraging the mapping relationship between the game's 3D scenes and its corresponding 2D images. Furthermore, we construct a comprehensive benchmark, which includes various FPS games with different graphics styles and perspectives. Extensive experimental results demonstrate the efficacy of our method in countering various AI aimbot tools on different state-of-the-art object detection methods. © 2021 IEEE.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Medical Image Segmentation Based on Frequency Domain Aware Stable Consistency Regularization

引用

Journal of imaging informatics in medicine 2025年 2025 Jan 22页

作者： Yihao Ouyang Peipei Li Haixiang Zhang Xuegang Hu Key Laboratory of Knowledge Engineering with Big Data (the Ministry of Education of China) Hefei University of Technology Hefei 230009 Anhui China. School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 Anhui China. School of Computer Science and Information Engineering Hefei University of Technology Hefei 230009 Anhui China. peipeili@***. Center for Big Data and Population Health of IHM Anhui Medical University Hefei Anhui China. peipeili@***. Center for Big Data and Population Health of IHM Anhui Medical University Hefei Anhui China. Computer Centre The Second People's Hospital of Hefei Hefei 230011 Anhui China. Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei University of Technology Hefei 230009 Anhui China.

With the advancement of deep learning models nowadays, they have successfully applied in the semi-supervised medical image segmentation where there are few annotated medical images and a large number of unlabeled ones. A representative approach in this regard is the semi-supervised method based on consistency regularization, which improves model training by imposing consistency constraints (perturbations) on unlabeled data. However, the perturbations in this kind of methods are often artificially designed, which may introduce biases unfavorable to the model learning in the handling of medical image segmentation. On the other hand, the majority of such methods often overlook the supervision in the Encoder stage of training and primarily focus on the outcomes in the later stages, potentially leading to chaotic learning in the initial phase and subsequently impacting the learning process of the model in the later stages. At the meanwhile, they miss the intrinsic spatial-frequency information of the images. Therefore, in this study, we propose a new semi-supervised medical image segmentation approach based on frequency domain aware stable consistency regularization. Specifically, to avoid the bias introduced by artificially setting perturbations, we first utilize the inherent frequency domain information of images, including both high and low frequencies, as the consistency constraint. Secondly, we incorporate supervision in the Encoder stage of model training to ensure that the model does not fail to learn due to the disruption of the original feature space caused by strong augmentation. Finally, extensive experimentation validates the effectiveness of our semi-supervised approach.

关键词： Consistency regularization Frequency domain Medical image segmentation Semi-supervision

来源：评论

学校读者我要写书评

暂无评论

Rotation-Adaptive Point Cloud Domain Generalization via Intricate Orientation Learning

arXiv

引用

arXiv 2025年

作者： Liu, Bangzhen Zheng, Chenxi Xu, Xuemiao Xu, Cheng Zhang, Huaidong He, Shengfeng South China University of Technology Guangzhou China Guangdong Engineering Center for Large Model and GenAI Technology The State Key Laboratory of Subtropical Building and Urban Science The Ministry of Education Key Laboratory of Big Data and Intelligent Robot The Guangdong Provincial Key Lab of Computational Intelligence and Cyberspace Information China Singapore Management University Singapore

The vulnerability of 3D point cloud analysis to unpredictable rotations poses an open yet challenging problem: orientation-aware 3D domain generalization. Cross-domain robustness and adaptability of 3D representations are crucial but not easily achieved through rotation augmentation. Motivated by the inherent advantages of intricate orientations in enhancing generalizability, we propose an innovative rotation-adaptive domain generalization framework for 3D point cloud analysis. Our approach aims to alleviate orientational shifts by leveraging intricate samples in an iterative learning process. Specifically, we identify the most challenging rotation for each point cloud and construct an intricate orientation set by optimizing intricate orientations. Subsequently, we employ an orientation-aware contrastive learning framework that incorporates an orientation consistency loss and a margin separation loss, enabling effective learning of categorically discriminative and generalizable features with rotation consistency. Extensive experiments and ablations conducted on 3D cross-domain benchmarks firmly establish the state-of-the-art performance of our proposed approach in the context of orientation-aware 3D domain generalization. © 2025, CC BY-NC-SA.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Incorporating edge sharpening and covariance attention for named entity recognition

引用

Neurocomputing 2025年 643卷

作者： Yang, Caiwei Chen, Yanping Yu, Shuai Huang, Ruizhang Qin, Yongbin Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Guizhou University Guizhou Guiyang550025 China State Key Laboratory of Public Big Data Guizhou university Guizhou Guiyang550025 China College of Computer Science and Technology Guizhou University Guiyang550025 China

Named Entity Recognition (NER) is a key application in the field of Artificial Intelligence and Natural Language Processing, which automatically identifies and categorizes entities in text by intelligent algorithms. In NER, all spans of a sentence can be organized into a two-dimensional representation. The semantic plane has the advantage to represent the semantic structure of a sentence and to learn the interaction between spans. One of an important phenomenon of this representation is that neighboring elements of the semantic plane are spans denoted to overlapped subsequences in a sentence. Because they share the same contextual features and semantic dependencies, it is difficult to distinguish true entities from the backgrounds. Therefore, refining span representations and building the semantic dependency between spans is helpful for the entity recognition task. In this paper, we propose an Edge Sharpening and Covariance Attention (ES&CA) model to support recognizing named entities from the semantic plane representation. The edge sharpening (ES) module adopts a differential convolution to sharpen the semantic gradients in the semantic plane, which has the ability to gather semantic information from neighborhoods. In the covariance attention (CA) module, the covariance between spans are applied to weight the attention of spans relevant to task-relevant learning objective. Establishing semantic relationships across spans is a highly successful approach. The ES&CA model is assessed on five public datasets for nested and flattened named entity recognition. The evaluation results demonstrate the effectiveness of our strategy in distinguishing entity spans from the backgrounds, hence significantly enhancing the final performance. © 2025 Elsevier B.V.

关键词： Natural language processing systems

来源：评论

学校读者我要写书评

暂无评论

Out-of-Distribution Generalization on Graphs via Progressive Inference

arXiv

引用

arXiv 2025年

作者： Xu, Yiming Shi, Bin Peng, Zhen Liu, Huixiang Dong, Bo Chen, Chen School of Computer Science and Technology Xi’an Jiaotong University China Shaanxi Provincial Key Laboratory of Big Data Knowledge Engineering Xi’an Jiaotong University China School of Distance Education Xi’an Jiaotong University China University of Virginia CharlottesvilleVA United States

The development and evaluation of graph neural networks (GNNs) generally follow the independent and identically distributed (i.i.d.) assumption. Yet this assumption is often untenable in practice due to the uncontrollable data generation mechanism. In particular, when the data distribution shows a significant shift, most GNNs would fail to produce reliable predictions and may even make decisions randomly. One of the most promising solutions to improve the model generalization is to pick out causal invariant parts in the input graph. Nonetheless, we observe a significant distribution gap between the causal parts learned by existing methods and the ground-truth, leading to undesirable performance. In response to the above issues, this paper presents GPro, a model that learns graph causal invariance with progressive inference. Specifically, the complicated graph causal invariant learning is decomposed into multiple intermediate inference steps from easy to hard, and the perception of GPro is continuously strengthened through a progressive inference process to extract causal features that are stable to distribution shifts. We also enlarge the training distribution by creating counterfactual samples to enhance the capability of the GPro in capturing the causal invariant parts. Extensive experiments demonstrate that our proposed GPro outperforms the state-of-the-art methods by 4.91% on average. For datasets with more severe distribution shifts, the performance improvement can be up to 6.86%. 1 © 2025, CC BY.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：