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

A Vertical Federated Multiview Fuzzy Clustering Method for Incomplete data

IEEE Transactions on Fuzzy Systems 2025年第5期33卷 1510-1524页

作者： Li, Yan Hu, Xingchen Yu, Shengju Ding, Weiping Pedrycz, Witold Kiat, Yeo Chai Liu, Zhong National University of Defense Technology Laboratory for Big Data and Decision Changsha410073 China National University of Defense Technology School of Computer Changsha410073 China Nantong University School of Artificial Intelligence and Computer Science Nantong226019 China Gliwice44-100 Poland University of Alberta Department of Electrical and Computer Engineering EdmontonABT6G 2R3 Canada Istinye University Research Center of Performance and Productivity Analysis Istanbul34010 Turkey Nanyang Technological University College of Computing and Data Science 639798 Singapore

Multiview fuzzy clustering (MVFC) has gained widespread adoption owing to its inherent flexibility in handling ambiguous data. The proliferation of privatization devices has driven the emergence of new challenge in MVFC research works. Federated learning, a technique that can jointly train without directly using raw data, has gain significant attention in decentralized MVFC. However, their applicability depends on the assumptions of data integrity and independence between different views. In fact, while within distributed environments, data typically exhibits two challenging problems: 1) multiple views within a single client;2) incomplete data. Existing methods exhibit limitations in effectively addressing these challenges. Hence, in this study, we aim at achieving the effective clustering for incomplete data by a novel vertical federated MVFC framework. Specifically, a unified clustering framework is designed to capture both local client learning and global server training. For the local client learning, the data reconstruction strategy and prototype alignment strategy are introduced to ensure the preservation of data structure and refinement of clustering relationships, which mitigates the impact of incomplete data. Meanwhile, the global training process implements aggregation based on client-specific information. The whole process is realized based on the unified fuzzy clustering framework, promoting collaborative learning between client-specific and server information. Theoretical analyses and extensive experiments are carefully conducted to validate the effectiveness and efficiency of the proposed method from multiple perspectives. © 1993-2012 IEEE.

关键词： data integrity

来源：评论

学校读者我要写书评

暂无评论

Salix-Leaf: Find Main Veins of Signal Clusters for Practical Parallel Decoding

引用

IEEE Transactions on Mobile Computing 2025年

作者： Li, Yajun Zhao, Jumin Li, Dengao Wu, Hejun Xu, Shuang Bai, Ruiqin Taiyuan University of Technology College of Electronic Information and Optical Engineering Taiyuan China Key Laboratory of Big Data Fusion Analysis and Application of Shanxi Province Taiyuan China Intelligent Perception Engineering Technology Center of Shanxi Taiyuan China Taiyuan University of Technology College of Computer Science and Technology College of Data Science Taiyuan China Sun Yat-sen University Department of Computer Science Guangzhou China

Parallel decoding of backscatter improves communication throughput by enabling concurrent transmission of backscatter tags. In practical applications of parallel decoding, it is extremely difficult to distinguish collided signals in superclusters where multiple signal clusters overlap. Existing methods are usually effective for superclusters with uniformly distributed signals. Nevertheless, there are many more scenarios in which signals in superclusters tend to gather unevenly, and existing methods cannot work. Such uneven clustering of signals occurs due to the following two possible causes: (1) signal-strengthdifferences (SSDs) among tags;or (2) cluster drifting (CD) driven by interferences from other objects within communication environments. This paper proposes a novel scheme called SalixLeaf, which aims to identify the main veins of signal clusters to address this problem of superclusters with unevenly distributed signals. Salix-Leaf identifies the main vein of each signal cluster for fine-grained clustering so that the direction of the main veins can be used to verify the accuracy of clustering. In addition, SalixLeaf employs a supercluster decomposer that divides signals into different segments for clustering analysis, enhancing robustness and practicability. Experimental results show that Salix-Leaf achieves a 1.2-fold increase in throughput and a 25% reduction in bit error rate (BER) compared to the state-of-the-art. © 2002-2012 IEEE.

关键词： Backscattering

来源：评论

学校读者我要写书评

暂无评论

Crystalline Silagermenides: Unraveling π-Bonding and Lone Pair Effects in the Multiple Bonds of Heavier Vinyl Anion Analogs

Research Square

引用

Research Square 2025年

作者： He, Xue-Yi Liang, Qiuming Mei, Yanbo Liu, Liu Leo Department of Chemistry Research Center for Chemical Biology and Omics Analysis College of Science Southern University of Science and Technology Shenzhen518055 China Department of Chemistry Dongguan Key Laboratory for Data Science and Intelligent Medicine Great Bay University Dongguan523000 China

Compared to vinyl anions, their heavier heteronuclear analogs silagermenides in the form of [R2Si=GeR]̅ remain exceedingly rare. Herein, we present a systematic investigation of silagermenides, synthesized via a straightforward desilylation route. We delve into the bonding characteristics, revealing a weak, polarized Si–Ge π bond with a significant nonbonded lone pair character at the β-Si position. This β-Si exhibits predominantly nucleophilic behavior, while the α-Ge position demonstrates subtly electrophilic tendencies, despite the presence of a vinylic, formally anionic Ge atom. This behavior leads to the formation of silagermenide complexes in an unprecedented η2 coordination mode, as well as various silagermenes and a germylene with unconventional substituents. Cleavage of the Si=Ge double bond was also revealed. Our findings expand the understanding of heavier vinyl anion analogs, with important implications for their synthesis and reactivity. © 2025, CC BY.

关键词： Coordination reactions

来源：评论

学校读者我要写书评

暂无评论

Robust Indoor Person Re-Identification with Multimodal Training

引用

IEEE Internet of Things Journal 2025年

作者： Su, Can Xue, Xinlei Ma, Lei Zhang, Xiaolong Yan, Wei Bian, Kaigui Peking University School of Computer Science AI Innovation Center National Engineering Laboratory for Big Data Analysis and Applications Beijing100871 China Peking University School of Computer Science Beijing100871 China Peking University Beijing Academy of Artificial Intelligence National Biomedical Imaging Center College of Future Technology National Key Laboratory for Multimedia Information Processing Beijing100871 China Beihang University Beijing100191 China

Existing person re-identification (ReID) methods mainly rely on images and videos to match persons across cameras, yet visual data captured by cameras are vulnerable to environmental interferences (e.g. illumination and occlusion) or personal appearance changes, leading to performance degradation under such scenes. Meanwhile, the popularization of Wi-Fi networks has allowed probe requests to be captured for mobile sensing applications such as crowd counting and trajectory estimation. However, the MAC address randomization technique adopted by modern devices breaks the association of probe requests and adversely affects the functionality of these applications. In this paper, we propose MaRPA, the first multimodal training approach that incorporates both videos and Wi-Fi probe requests to simultaneously promote tasks of probe requests association and person ReID. MaRPA first distinguishes among pairwise probe request frames through a contrastive learning model. It then matches video and probe request sequences by exploring their similarities from the position and the vision aspects. Matched videos and probe requests provide complementary information and generate more robust features for both tasks. To evaluate MaRPA, we contribute a new dataset containing synchronous videos and probe requests data for probe requests association and person ReID. Experimental results demonstrate the effectiveness of our approach. For probe requests association, it achieves > 85% discrimination accuracy and > 0.90 V-measure score;for person ReID, it achieves 75.8% mAP and 90.6% Rank-1, improving state-of-the-art video-based ReID methods by over 40% © 2014 IEEE.

关键词： Wi-Fi

来源：评论

学校读者我要写书评

暂无评论

Proximal gradient-type method with generalized distance and convergence analysis without global descent lemma

arXiv

引用

arXiv 2025年

作者： Yagishita, Shotaro Ito, Masaru Risk Analysis Research Center The Institute of Statistical Mathematics Japan Center for Social Data Structuring Joint Support-Center for Data Science Research Japan Department of Mathematics College of Science and Technology Nihon University Japan

We consider solving nonconvex composite optimization problems in which the sum of a smooth function and a nonsmooth function is minimized. Many of convergence analyses of proximal gradient-type methods rely on global descent property between the smooth term and its proximal term. On the other hand, the ability to efficiently solve the subproblem depends on the compatibility between the nonsmooth term and the proximal term. Selecting an appropriate proximal term by considering both factors simultaneously is generally difficult. We overcome this issue by providing convergence analyses for proximal gradient-type methods with general proximal terms, without requiring global descent property of the smooth term. As a byproduct, new convergence results of the interior gradient methods for conic optimization are also provided. Copyright © 2025, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Broad Learning System With Quantized and Censored Communications

Distributed Broad Learning System With Quantized and Censore...

引用

2021 China Automation Congress, CAC 2021

作者： Liang, Jinyan Ai, Wu College of Science Guilin University of Technology Guilin China Center for Data Analysis and Algorithm Technology Guilin University of Technology Guilin China

ISBN: (纸本)9781665426473

As a novel neural network model, the broad learning system (BLS) has been used extensively due to its simple structure and few model hyperparameters. This paper presents a distributed BLS algorithm with quantized and censored communications (DQC-BLS). The DQC-BLS algorithm is based on the alternating direction method of multipliers (ADMM). In order to reduce the high communication cost, the DQC-BLS algorithm improves the communication mechanism between the in-networks agents by introducing quantization and communication-censoring strategies. Quantization reduces the number of bits for each transmission whereas communication censoring reduces the number of communications. The experimental results verify that the DQC-BLS algorithm can reduce communication costs while maintaining similar performance on the test set. © 2021 IEEE

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A Decentralized algorithm for Deep Echo State Networks

A Decentralized Algorithm for Deep Echo State Networks

引用

2021 China Automation Congress, CAC 2021

作者： Qiu, Wenqi Ai, Wu College of Science Guilin University of Technology Guilin China Center for Data Analysis and Algorithm Technology Guilin University of Technology Guilin China

ISBN: (纸本)9781665426473

As a class of recurrent neural networks (RNNs), echo state networks (ESNs) have been studied extensively in recent years, particularly in time-series prediction and non-linear system identification. It is well-known that deep learning (DL) has been applied to ESNs and shows more outstanding performance than conventional ESNs. However, due to the large-scale dataset and complexity required to train deep learning models, the time required to train deep ESNs based on traditional centralized algorithms is highly extended. Hence, a decentralized training algorithm combining DL and ESNs is presented in this paper to aim at multiple time scales processing of temporal data. We propose this algorithm based on an optimization program called the alternating direction method of multipliers (ADMM) and decentralized average consensus (DAC) procedure. The results based on a large-scale artificial dataset prove that it has more advantages in generalization accuracy and training time than the centralized experimental scheme. © 2021 IEEE

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

Distributed Reduced Kernel Extreme Learning Machine

Distributed Reduced Kernel Extreme Learning Machine

引用

2021 China Automation Congress, CAC 2021

作者： Zhou, Manrui Ai, Wu College of Science Guilin University of Technology Guilin China Center for Data Analysis and Algorithm Technology Guilin University of Technology Guilin China

ISBN: (纸本)9781665426473

Extreme learning machines (ELM) are popular in the field of pattern recognition and machine learning. The kernel extension of ELM (KELM) presents a better performance than traditional ELM. Although the KELM is able to solve complex nonlinear problems, it is time-consuming and memory-demanding when dealing with a large-size kernel matrix. Introducing reduced kernel technique can dramatically cut down the computational load and memory usage. However, as the amount of training data grows exponentially, it is not effective for a single worker to store the kernel matrix, making it infeasible for data mining in a centralized manner. In this paper, a distributed reduced kernel method for training ELM over decentralized data (DRKELM) is proposed. In the DRKELM, we randomly assign data to different nodes. The communication between nodes is fixed and does not depend on the size of the training data on each node, but on the network topology. Different from the existing reduced kernel ELM, the DRKELM is a fully distributed training algorithm based on the method of alternating direction method of multiplier (ADMM). Experiment with the large scale data set finds that the distributed method can achieve almost the same results as the centralized algorithm and even takes less time to a large extent. It greatly reduces the computation time consumption. © 2021 IEEE

关键词： Network topology

来源：评论

学校读者我要写书评

暂无评论

A Causal Adversarial Graph Neural Network for Multi-center Autism Spectrum Disorder Identification

SSRN

引用

SSRN 2025年

作者： Zhang, Zhuan Wang, Lihui Chen, Qijian Wang, Li Jian, Caiqing Zhu, Yue-Min Wei, Hongjiang Engineering Research Center of Text Computing & Cognitive Intelligence Ministry of Education Key Laboratory of Intelligent Medical Image Analysis and Precise Diagnosis of Guizhou Province State Key Laboratory of Public Big Data College of Computer Science and Technology Guizhou University Guiyang550025 China University Lyon INSA Lyon CNRS Inserm IRP Metislab CREATIS UMR5220 U1206 Lyon69621 France

Due to the heterogeneous distributions of multi-center rs-fMRI data, currently it is still challenging to identify accurately autism spectrum disorder (ASD) patients from these heterogenous data. To deal with the influence of heterogeneous distributions on multi-center ASD diagnosis, a novel causal adversarial graph neural network (CAG) for multi-center ASD prediction is proposed in this work. CAG mainly consists of a graph filtering (GF) module and a learnable causal graph predictor (CGP). Specifically, the brain connection graph is first constructed from rs-fMRI data, after passing a GF module, the filtered graph is further divided by a causal subgraph and causally irrelevant subgraph. The ground-truth environmental labels and ASD labels are predicted from causal subgraph by a clustering method and a classification block, respectively. In addition, from the filtered graph and causally irrelevant subgraph, the environmental labels are predicted, while from the causally irrelevant subgraph the ASD labels are predicted. Assuming that the predicted environmental labels are independent to causal subgraph, while the predicted ASD labels are independent to causally irrelevant subgraph, accordingly, several adversarial losses are implemented by reversing the gradient. Through this adversarial learning strategy, the derived causal graph can predict multi-center ASD. The comparison experiments on both ABIDE-I and ABIDE-II datasets demonstrate that, the ACC and AUC of CAG has been improved by 3.78\% and 7.38\% at least comparing against the existing methods. Moreover, some abnormal functional connectivities in ASD group are identified from the causal subgraph which may provide useful imaging biomarkers for the early diagnosis of ASD. © 2025, The Authors. All rights reserved.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

A Fixed-Time Distributed algorithm for Least Square Solutions of Linear Equations 31

A Fixed-Time Distributed Algorithm for Least Square Solution...

引用

第31届中国控制与决策会议

作者： Wu Ai Shuling Li Jian Wu Quanxi Feng College of Science Guilin University of Technology Center for Data analysis and Algorithm Technology Guilin University of Technology School of Computer and Information Anqing Normal University University Key Laboratory of Intelligent Perception and Computing of Anhui Province

ISBN: (纸本)9781728101071;9781728101064

In this paper, we presents a fixed-time convergent distributed algorithm to achieve least square solutions of networked linear equations. Each agent in the network only knows a subset of the equations and can only exchange messages with its nearest neighbors. Compared with the finite-time algorithm, it is shown that the settling time is independent to the initial states of the algorithm and can be preassign according to requirements of the task. A numerical example is provided to illustrate the effectiveness of the theoretical result.

关键词： Fixed-time stability Distributed algorithms Least Squares Linear Equations

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：