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

Multiview Subgraph Neural networks: Self-Supervised Learning With Scarce Labeled Data

IEEE Transactions on Neural networks and Learning Systems 2024年第6期36卷 11548-11561页

作者： Zhenzhong Wang Qingyuan Zeng Wanyu Lin Min Jiang Kay Chen Tan Department of Computing The Hong Kong Polytechnic University Hong Kong SAR China Department of Artificial Intelligence Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China Key Laboratory of Digital Protection and Intelligent Processing of Intangible Cultural Heritage of Fujian and Taiwan Ministry of Culture and Tourism School of Informatics Xiamen University Xiamen Fujian China Department of Computing Department of Data Science and Artificial Intelligence The Hong Kong Polytechnic University Hong Kong SAR China Department of Data Science and Artificial Intelligence The Hong Kong Polytechnic University Hong Kong SAR China

While graph neural networks (GNNs) have become the de facto standard for graph-based node classification, they impose a strong assumption on the availability of sufficient labeled samples. This assumption restricts the classification performance of prevailing GNNs on many real-world applications suffering from low-data regimes. Specifically, features extracted from scarce labeled nodes could not provide sufficient supervision for the unlabeled samples, leading to severe overfitting. We point out that leveraging subgraphs to capture long-range dependencies can augment the node representation, thus alleviating the low-data regime. To this end, we present a novel self-supervised learning (SSL) framework, called multiview subgraph neural networks (Muse), for handling the long-range dependencies. In particular, we propose an information theory-based identification mechanism to identify two types of subgraphs from the views of input space and latent space, respectively. The former is to capture the local structure of the graph, while the latter captures the long-range dependencies among nodes. By fusing these two views of subgraphs, the learned representations can preserve the topological properties of the graph at large, including the local structure and long-range dependencies, thus maximizing their expressiveness. Theoretically, we provide the generalization error bound to show the effectiveness of capturing complementary information from multiview subgraphs. Empirically, we show a proof-of-concept of Muse on canonical node classification problems on graph data.

关键词： Manifolds Semantics Feature extraction Laplace equations Data mining Sugar Social networking (online) Skeleton Manifold learning Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Interference Coordination Technology of Ultra Dense Deployment Based on Clustering Algorithm

Interference Coordination Technology of Ultra Dense Deployme...

引用

IEEE International Conference on Power, intelligent computing and Systems (ICPICS)

作者： Haoyuan Wang Yue Tian Wenda Li Fujian Key Laboratory of Communication Network and Information Processing Xiamen University of Technology Xiamen China Department of Security and Crime Science University College London London United Kingdom

A clustering algorithm based Ultra Dense Deployment is proposed to address the problem of establishing a reasonable interference model and allocating ABS reasonably to minimize interference and maximize throughput in Ultra Dense Deployment. By analyzing the distribution pattern of low-power nodes in Ultra Dense Deployment, the interference generated by the cluster center is used to replace the interference of other nodes in the class. According to the principle of interference minimization, a distributed allocation scheme for ABS time slots based on K-means clustering is proposed, and a polling algorithm is used for user scheduling. Simulation results show that compared with the generalized interference model and traditional binary models, the interference calculation is more accurate, The throughput of the system is also higher.

关键词：

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

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

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan 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 Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

AGNN: Alternating Graph-Regularized Neural networks to Alleviate Over-Smoothing

arXiv

引用

arXiv 2023年

作者： Chen, Zhaoliang Wu, Zhihao Lin, Zhenghong Wang, Shiping Plant, Claudia Guo, Wenzhong The College of Computer and Data Science Fuzhou University Fuzhou350116 China The Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China The Faculty of Computer Science Austria The research network Data Science @ Uni Vienna University of Vienna Vienna1090 Austria

Graph Convolutional network (GCN) with the powerful capacity to explore graph-structural data has gained noticeable success in recent years. Nonetheless, most of the existing GCN-based models suffer from the notorious over-smoothing issue, owing to which shallow networks are extensively adopted. This may be problematic for complex graph datasets because a deeper GCN should be beneficial to propagating information across remote neighbors. Recent works have devoted effort to addressing over-smoothing problems, including establishing residual connection structure or fusing predictions from multi-layer models. Because of the indistinguishable embeddings from deep layers, it is reasonable to generate more reliable predictions before conducting the combination of outputs from various layers. In light of this, we propose an Alternating Graph-regularized Neural network (AGNN) composed of Graph Convolutional Layer (GCL) and Graph Embedding Layer (GEL). GEL is derived from the graph-regularized optimization containing Laplacian embedding term, which can alleviate the over-smoothing problem by periodic projection from the low-order feature space onto the high-order space. With more distinguishable features of distinct layers, an improved Adaboost strategy is utilized to aggregate outputs from each layer, which explores integrated embeddings of multi-hop neighbors. The proposed model is evaluated via a large number of experiments including performance comparison with some multi-layer or multi-order graph neural networks, which reveals the superior performance improvement of AGNN compared with state-of-the-art models. Copyright © 2023, The Authors. All rights reserved.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

Automatic Segmentation of Nasopharyngeal Carcinoma in CT Images Using Dual Attention and Edge Detection 48

Automatic Segmentation of Nasopharyngeal Carcinoma in CT Ima...

引用

48th IEEE International Conference on Acoustics, Speech and Signal processing, ICASSP 2023

作者： Wang, Qizhi Huang, Wei Zhang, Yuan Li, Xuanya Ye, Xiongjun Hu, Kai Xiangtan University Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan411105 China The First Hospital of Changsha Department of Radiology Changsha410005 China Baidu Inc. Beijing100085 China Chinese Academy of Medical Sciences Peking Union Medical College National Cancer Center Cancer Hospital Beijing100021 China

ISBN: (纸本)9781728163277

Nasopharyngeal carcinoma (NPC) is a malignant tumor with a high incidence. Accurate segmentation of the tumor region in Computed Tomography (CT) images of NPC is the key to treatment. However, the features of uneven grayscale values and hazy boundaries of NPC regions make accurate NPC segmentation particularly challenging. To address these problems, we propose an accurate and effective NPC segmentation method using Dual Attention and Edge Detection Convolutional Neural network (DAED-Net). Firstly, we combine a 2.5D convolutional neural network with UNet++ and propose a new backbone called Dual-dimension Dense UNet (DD-UNet), which can extract more beneficial features from 3D images. Secondly, a Dual Attention Module (DAM) is proposed to help the model better segment the target region of NPC by efficiently collecting spatial and channel attention information from feature maps. Moreover, an Edge Detection Module (EDM) is introduced in the network to enhance the segmentation of the target contours. Finally, we evaluate the proposed DAED-Net on the public MICCAI 2019 StructSeg NPC dataset from different perspectives. Numerical and visual results show that the proposed method outperforms nine state-of-the-art segmentation methods and yields more accurate NPC segmentation results. © 2023 IEEE.

关键词： Convolutional neural network Dual attention Edge detection Nasopharyngeal carcinoma segmentation

来源：评论

学校读者我要写书评

暂无评论

MOAL: Multi-view Out-of-distribution Awareness Learning

引用

Neural networks : the official journal of the International Neural network Society 2025年 190卷 107581页

作者： Xuzheng Wang Zihan Fang Shide Du Wenzhong Guo Shiping Wang College of Computer and Data Science Fuzhou University Fuzhou 350108 China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China. Electronic address: wangxuzheng@***. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China. Electronic address: fzihan11@***. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China. Electronic address: dushidems@***. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China. Electronic address: guowenzhong@***. Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou 350108 China. Electronic address: shipingwangphd@***.

Multi-view learning integrates data from multiple sources to enhance task performance by improving data quality. However, existing approaches primarily focus on intra-distribution data learning and consequently fail to identify out-of-distribution instances effectively. This paper introduces a method to improve the perception of out-of-distribution data in multi-view situations. First, we employ multi-view consistency and complementarity principles to develop sub-view complementarity representation learning and multi-view consistency fusion layers, thereby enhancing the model's perception ability to typical intra-distribution features. Additionally, we introduce a specialized multi-view training loss and an agent mechanism tailored for out-of-distribution scenarios, facilitating the ability to differentiate between known and new or anomalous instances effectively. The proposed approach enhances the recognition of out-of-distribution data by improving intra-distribution feature representations and minimizing the entropy associated with out-of-distribution instances. Experimental results on multiple multi-view datasets simulating out-of-distribution scenarios confirm the effectiveness of MOLA, which consistently outperforms all baselines with average accuracy improvements of over 5%.

关键词： Anomaly detection Deep learning Multi-view learning Out-of-distribution learning

来源：评论

学校读者我要写书评

暂无评论

Cross-Modality Perturbation Synergy Attack for Person Re-identification

arXiv

引用

arXiv 2024年

作者： Gong, Yunpeng Zhong, Zhun Qu, Yansong Luo, Zhiming Ji, Rongrong Jiang, Min School of Informatics Xiamen University China School of Computer Science and Information Engineering Hefei University of Technology China Department of Artificial Intelligence Key Laboratory of Multimedia Trusted Perception and Efficient Computing Ministry of Education of China School of Informatics Key Laboratory of Digital Protection and Intelligent Processing of Intangible CulturalHeritage of Fujian and Taiwan Ministry of Culture and Tourism Xiamen University Fujian Xiamen361005 China

In recent years, there has been significant research focusing on addressing security concerns in single-modal person re-identification (ReID) systems that are based on RGB images. However, the safety of cross-modality scenarios, which are more commonly encountered in practical applications involving images captured by infrared cameras, has not received adequate attention. The main challenge in cross-modality ReID lies in effectively dealing with visual differences between different modalities. For instance, infrared images are typically grayscale, unlike visible images that contain color information. Existing attack methods have primarily focused on the characteristics of the visible image modality, overlooking the features of other modalities and the variations in data distribution among different modalities. This oversight can potentially undermine the effectiveness of these methods in image retrieval across diverse modalities. This study represents the first exploration into the security of cross-modality ReID models and proposes a universal perturbation attack specifically designed for cross-modality ReID. This attack optimizes perturbations by leveraging gradients from diverse modality data, thereby disrupting the discriminator and reinforcing the differences between modalities. We conducted experiments on three widely used cross-modality datasets, namely RegDB, SYSU, and LLCM. The results not only demonstrate the effectiveness of our method but also provide insights for future improvements in the robustness of cross-modality ReID systems. © 2024, CC BY-NC-ND.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

Towards High-resolution 3D Anomaly Detection via Group-Level Feature Contrastive Learning 24

Towards High-resolution 3D Anomaly Detection via Group-Level...

引用

32nd ACM International Conference on Multimedia, MM 2024

作者： Zhu, Hongze Xie, Guoyang Hou, Chengbin Dai, Tao Gao, Can Wang, Jinbao Shen, Linlin National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China Department of Computer Science City University of Hong Kong Hong Kong Hong Kong Department of Intelligent Manufacturing CATL Ningde China Fuzhou Fuyao Institute for Advanced Study Fuyao University of Science and Technology Fuzhou China College of Computer Science and Software Engineering Shenzhen University Shenzhen China Guangdong Provincial Key Laboratory of Intelligent Information Processing Shenzhen China Shenzhen University Shenzhen China Shenzhen Institute of Artificial Intelligence and Robotics for Society Shenzhen China

ISBN: (纸本)9798400706868

High-resolution point clouds (HRPCD) anomaly detection (AD) plays a critical role in precision machining and high-end equipment manufacturing. Despite considerable 3D-AD methods that have been proposed recently, they still cannot meet the requirements of the HRPCD-AD task. There are several challenges: i) It is difficult to directly capture HRPCD information due to large amounts of points at the sample level;ii) The advanced transformer-based methods usually obtain anisotropic features, leading to degradation of the representation;iii) The proportion of abnormal areas is very small, which makes it difficult to characterize. To address these challenges, we propose a novel group-level feature-based network, called Group3AD, which has a significantly efficient representation ability. First, we design an Intercluster Uniformity network (IUN) to present the mapping of different groups in the feature space as several clusters, and obtain a more uniform distribution between clusters representing different parts of the point clouds in the feature space. Then, an Intracluster Alignment network (IAN) is designed to encourage groups within the cluster to be distributed tightly in the feature space. In addition, we propose an Adaptive Group-Center Selection (AGCS) based on geometric information to improve the pixel density of potential anomalous regions during inference. The experimental results verify the effectiveness of our proposed Group3AD, which surpasses Reg3D-AD by the margin of 5% in terms of object-level AUROC on Real3D-AD. We provide the code and supplementary information on our website: https://***/M-3LAB/Group3AD. © 2024 ACM.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

AR-CNN: an attention ranking network for learning urban perception

引用

Science China(information Sciences) 2022年第1期65卷 164-174页

作者： Zhetao LI Ziwen CHEN Wei-Shi ZHENG Sangyoon OH Kien NGUYEN Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Key Laboratory of Intelligent Computing & Information Processing of Ministry of Education Xiangtan University School of Data and Computer Science Sun Yat-sen University Department of Computer and Information Engineering Ajou University Graduate School of Engineering Chiba University

An increasing number of deep learning methods is being applied to quantify the perception of urban environments, study the relationship between urban appearance and resident safety, and improve urban appearance. Most advanced methods extract image feature representations from street-level images through conventional visual computation algorithms or deep convolutional neural networks and then directly predict the results using features. Unfortunately, these methods take color and texture information together during processing. Color and texture are prime image features, and they affect human perception and judgment differently. We argue that color and texture should be operated differently; therefore, we formulate an end-to-end learning methodology to process input images according to color and texture information before inputting it into the neural network. The processed images and the original image constitute three input streams for the triad attention ranking convolutional neural network(AR-CNN) model proposed in this *** accordance with the aspects of color and texture, an improved attention mechanism in the convolution layer is proposed. Our objective is to obtain the scores of humans on urban appearance in accordance with the prediction results computed from pairwise comparisons generated by the AR-CNN model.

关键词： ranking network urban perception attribute learning attention network colour and texture

来源：评论

学校读者我要写书评

暂无评论

A New network Intrusion Detection based on Semi-supervised Dimensionality Reduction and Tri-LightGBM 1

A New Network Intrusion Detection based on Semi-supervised D...

引用

1st International Conference on Pervasive Artificial Intelligence, ICPAI 2020

作者： Zhang, Hao Li, Jieling Fuzhou University College of Mathematics and Computer Science Fuzhou University Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou China

ISBN: (纸本)9781665404839

With the development of technology and threat forms, network intrusion detection has become a challenging task. The intrusion detection algorithm based on supervised learning requires a lot of manpower and material resources to obtain a large amount of labeled data. Besides, the accuracy of unsupervised learning can not meet the requirements of intrusion detection systems. We propose a semi-supervised network intrusion detection method in this paper. information Gain is employed to filter redundancy features. Then, we combine labeled samples with unlabeled samples and adopt Principal Component Analysis (PCA) to convert multiple features into comprehensive features. Finally, an Tri-Training strategy is adopted to integrate the basic LightGBM classifier, and make full use of unlabeled data to generate pseudo labels, thereby optimizing the basic LightGBM classifier. To verify the effectiveness of the proposed approach, a large number of experiments are performed on the UNSW-NB15 dataset. The experimental results fully show that the method is superior in improving detection efficiency and reducing label dependence, and has a lower false alarm rate and a higher detection rate. © 2020 IEEE.

关键词： Principal component analysis

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：