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

SpreadFGL: Edge-Client Collaborative Federated Graph Learning with Adaptive Neighbor Generation

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhong, Luying Pi, Yueyang Chen, Zheyi Yu, Zhengxin Miao, Wang Chen, Xing Min, Geyong College of Computer and Data Science Fuzhou University China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China School of Computing and Communications University of Lancaster United Kingdom School of Engineering Computing and Mathematics University of Plymouth United Kingdom Department of Computer Science University of Exeter United Kingdom

Federated Graph Learning (FGL) has garnered widespread attention by enabling collaborative training on multiple clients for semi-supervised classification tasks. However, most existing FGL studies do not well consider the missing inter-client topology information in real-world scenarios, causing insufficient feature aggregation of multi-hop neighbor clients during model training. Moreover, the classic FGL commonly adopts the FedAvg but neglects the high training costs when the number of clients expands, resulting in the overload of a single edge server. To address these important challenges, we propose a novel FGL framework, named SpreadFGL, to promote the information flow in edge-client collaboration and extract more generalized potential relationships between clients. In SpreadFGL, an adaptive graph imputation generator incorporated with a versatile assessor is first designed to exploit the potential links between subgraphs, without sharing raw data. Next, a new negative sampling mechanism is developed to make SpreadFGL concentrate on more refined information in downstream tasks. To facilitate load balancing at the edge layer, SpreadFGL follows a distributed training manner that enables fast model convergence. Using real-world testbed and benchmark graph datasets, extensive experiments demonstrate the effectiveness of the proposed SpreadFGL. The results show that SpreadFGL achieves higher accuracy and faster convergence against state-of-the-art algorithms. Copyright © 2024, The Authors. All rights reserved.

关键词： Graph algorithms

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mec...

International Conference on Computer Supported Cooperative Work in Design

作者： Yuejia Wu Jian-Tao Zhou College of Computer Science Inner Mongolia University National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models.

关键词：

Consensus Disturbance Rejection of Nonlinear Multi-Agent Systems Over Cooperation-Competition Networks

学校读者我要写书评

暂无评论

Consensus Disturbance Rejection of Nonlinear Multi-Agent Sys...

Chinese Automation Congress (CAC)

作者： Qiang Wang Wangli He Dayu Tan Weimin Zhong Key Laboratory of Smart Manufacturing in Energy Chemical Process Ministry of Education East China University of Science and Technology Shanghai China Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education Anhui University Hefei China

ISBN: (纸本)9781665426480

This study addresses the consensus problem for nonlinear multi-agent systems (MASs) under the exogenous disturbances over cooperation-competition networks. Firstly, for judging the disturbances produced by the exogenous environment, a disturbance observer-based approach is developed and incorporated into the controller. Secondly, two novel nonlinear control protocols depended on state feedback and output feedback control are constructed to guarantee consensus for MASs over the signed directed graph, respectively. Thirdly, theoretical guarantees on the effectiveness of the proposed controller in steering the system to a bipartite leader-following consensus with exogenous disturbances are derived. Finally, numerical simulations inspired by a real-world physical MAS are provided to illustrate the effectiveness of the proposed controllers.

关键词： State feedback Protocols Automation Directed graphs Numerical simulation Disturbance observers Output feedback

Using Rough Sets to Improve the High-dimensional Data Anomaly Detection Method Based on Extended Isolation Forest

学校读者我要写书评

暂无评论

Using Rough Sets to Improve the High-dimensional Data Anomal...

International Conference on Computer Supported Cooperative Work in Design

作者： Hanlin Liu Jiantao Zhou Hua Li College of Computer Science Inner Mongolia University Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Ministry of Education Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China

Anomaly detection refers to the identification of data objects that deviate from the general data distribution. One of the important challenges in anomaly detection is handling high-dimensional data, especially when it contains a large number of redundant attributes. Although traditional Isolation Forest (iForest) and Extended Isolation Forest (EIF) have performed well in anomaly detection, the detection accuracy is still extremely influenced by redundant attributes. In this paper, we propose a two-tier architecture named RS-EIF, to alleviate the negative impact of redundant attributes. Specifically, the RS-EIF combines the rough set theory and EIF algorithm and provides an effective basis for the EIF-based anomaly detection method by removing redundant attributes with rough set theory. Experimental results show that the RS-EIF algorithm performs better than the iForest and EIF algorithms in terms of anomaly detection rate, and the results of the combination of rough set theory and EIF are more prominent compared to the other combination methods.

关键词：

ACCURATELY RECOVER GLOBAL QUASIPERIODIC SYSTEMS BY FINITE POINTS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Kai Zhou, Qi Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

Quasiperiodic systems, related to irrational numbers, are space-filling structures without decay nor translation invariance. How to accurately recover these systems, especially for non-smooth cases, presents a big challenge in numerical computation. In this paper, we propose a new algorithm, finite points recovery (FPR) method, which is available for both smooth and non-smooth cases, to address this challenge. The FPR method first establishes a homomorphism between the lower-dimensional definition domain of the quasiperiodic function and the higher-dimensional torus, then recovers the global quasiperiodic system by employing interpolation technique with finite points in the definition domain without dimensional lifting. Furthermore, we develop accurate and efficient strategies of selecting finite points according to the arithmetic properties of irrational numbers. The corresponding mathematical theory, convergence analysis, and computational complexity analysis on choosing finite points are presented. Numerical experiments demonstrate the effectiveness and superiority of FPR approach in recovering both smooth quasiperiodic functions and piecewise constant Fibonacci quasicrystals. While existing spectral methods encounter difficulties in accurately recovering non-smooth quasiperiodic *** Codes 11J68, 65D05, 65D15, 68W25 © 2023, CC BY-NC-ND.

关键词： Interpolation

ON THE APPROXIMATION OF QUASIPERIODIC FUNCTIONS WITH DIOPHANTINE FREQUENCIES BY PERIODIC FUNCTIONS

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Kai Li, Shifeng Zhang, Pingwen Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education School of Mathematics and Computational Science Xiangtan University Hunan Xiangtan411105 China School of Mathematics and Statistics Wuhan University Wuhan430072 China School of Mathematical Sciences Peking University Beijing100871 China

We present an analysis of the approximation error for a d-dimensional quasiperiodic function f with Diophantine frequencies, approximated by a periodic function with the fundamental domain [0, L1) × [0, L2) × · · · × [0, Ld). When f has a certain regularity, its global behavior can be described by a finite number of Fourier components and has a polynomial decay at infinity. The dominant part of periodic approximation error is bounded by (formula presented), where Lj belongs to the best simultaneous approximation sequence and sj is the number of different irrational elements in j-th dimension component of Fourier frequencies, respectively. Meanwhile, we discuss the approximation rate. Finally, these analytical results are verified by some examples. Copyright © 2023, The Authors. All rights reserved.

关键词： Natural frequencies

Variational Clustering and Denoising of Spatial Transcriptomics

学校读者我要写书评

暂无评论

Variational Clustering and Denoising of Spatial Transcriptom...

IEEE International Conference on Bioinformatics and Biomedicine (BIBM)

作者： Cuiyuan Li Fa Zhang Kai Hu Xuefeng Cui School of Computer Science and Technology Shandong University Qingdao China School of Medical Technology Beijing Institute of Technology Beijing China Key Laboratory of Intelligent Computing and Information Processing of Ministry of Education Xiangtan University Xiangtan China Key Laboratory of Medical Imaging and Artificial Intelligence of Hunan Province Xiangnan University Chenzhou China

Spatial transcriptomics data provides a unique opportunity to investigate both gene expression and spatial structure in tissues at the same time. However, incorporating spatial information to accurately identify spatial domains is difficult due to factors such as high-dimensionality, sparsity, noise, and dropout events. To address these issues, we introduce vGraphST, a novel graph-based deep learning approach tailored for spatial transcriptomics data. Our method combines auto-encoder and contrastive learning techniques to process high-dimensional data and generate meaningful low-dimensional embeddings. Additionally, we use continuous distributions instead of discrete values in both the latent space and the denoised gene expression space. Specifically, Gaussian distributions are used to model the latent space, while zero-inflated Poisson distributions are used to model the denoised gene expression space. Experimental results demonstrate the effectiveness of vGraphST in accurately representing and analyzing spatial transcriptomics data. When compared to other methods using the DLPFC dataset, vGraphST achieves an average Adjusted Rand Index (ARI) of 0.58, demonstrating its superiority in segmenting spatial domains and recognizing biologically relevant spatiotemporal patterns.

关键词：

Some bounds on the cardinality of the b-symbol weight spectrum of codes

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Zhu, Hongwei Li, Shitao Shi, Minjia Xia, Shu-Tao Solé, Patrick Tsinghua Shenzhen International Graduate School Tsinghua University Shenzhen518055 China School of Mathematical Sciences Anhui University Hefei230601 China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education School of Mathematical Sciences Anhui University Hefei230601 China Centrale Marseille CNRS I2M Aix Marseille University Marseille13009 France State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

The size of the Hamming distance spectrum of a code has received great attention in recent research. The main objective of this paper is to extend these significant theories to the b-symbol distance spectrum. We examine this question for various types of codes, including unrestricted codes, additive codes, linear codes, and cyclic codes, successively. For the first three cases, we determine the maximum size of the b-symbol distance spectra of these codes smoothly. For the case of cyclic codes, we introduce three approaches to characterize the upper bound for the cardinality of the b-symbol weight spectrum of cyclic codes, namely the period distribution approach, the primitive idempotent approach, and the b-symbol weight formula approach. As two by-products of this paper, the maximum number of symplectic weights of linear codes is determined, and a basic inequality among the parameters [n, k, dH(C)]q of cyclic codes is provided. © 2024, CC0.

关键词： Hamming distance

Investigation on ULA Fitting Promoting Low Coupling Sparse Arrays

学校读者我要写书评

暂无评论

Investigation on ULA Fitting Promoting Low Coupling Sparse A...

International Applied Computational Electromagnetics Society Symposium (ACES)

作者： Yichang Yao Wanlu Shi Yingsong Li Zhixiang Huang Guohui Yang Kuang Zhang College of Information and Communication Engineering Harbin Engineering University Harbin China Anhui Province Key Laboratory of Target Recognition and Feature Extraction LuAn China Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui University China School of Electronics and Information Engineering Harbin Institute of Technology Harbin China

A low coupling sparse array (LCSA) is presented, analyzed and discussed on the basis of the recent proposed uniform linear array (ULA) fitting scheme with close-expressions, and its performance with different uniform subarrays in the basic layer is investigated via parameter estimation like direction-of-arrival(DOA). The results gives a superior performance for the presented LCSA.

关键词： Couplings Mutual coupling Direction-of-arrival estimation Fitting Estimation Computational electromagnetics