Recommender systems play crucial roles in addressing the issue of information overload, but traditional centralized storage in recommendation poses significant privacy concerns. In recent years, federated learning has been successfully introduced into a recommendation, while these algorithms still encounter several challenges. First, real-world recommendation scenarios often suffer from sparse data, making it difficult for models to learn reliable representations. Second, data heterogeneity necessitates the design of personalized models to enhance recommendation performance. To address these challenges, we propose a federated recommendation approach based on graph neural networks, named federated personalized contrastive learning for recommendation. On the client side, we propose a contrastive learning approach to enhance the embedding quality of nodes (users or items) by maximizing positive similarities. Specifically, we formulate the concept of structural neighbors based on the graph structure and devise a contrastive learning objective. We treat nodes and their structural neighbors as positive pairs to better learn node representations. On the server side, we group users based on the learned representations and compute cluster-level federated models and a global model. Each user learns a personalized model by combining these two models. Extensive experiments on five real-world datasets demonstrate that the proposed algorithm outperforms existing methods in terms of performance.
31 January 2025 in IEEE Transactions on Geoscience and Remote Sensing
Remote sensing scenarios usually involve sensitive geographic information on national security and regional development. In the commonly used centralized machine learning paradigm, data dispersed in various locations are concentrated and processed on a single server, which is prone to privacy leakage and data security concerns. Besides, it is difficult to solve the high heterogeneity of remote sensing images by simply applying federated learning algorithms to scene classification. In this paper, we formulate a federated remote sensing scene classification (FedSC) framework, and design a customized neural architecture search (CNAS) to achieve both global generality for multi-party collaborative distributed training and local specificity for personalized remote sensing scene customization. The proposed FedSC is generalizable to be implemented in any mannually designed networks, network pruning strategies, or NAS methods related to remote sensing scene classification. While the designed CNAS not only achieves collaborative distributed training in protecting participant data privacy to obtain a generalized global model, but also provides a customized local model for each participant that is more in line with the characteristics of private remote sensing scenarios. Overall, the proposed FedSCCNAS provides a novel federated collaborative training paradigm for remote sensing scene classification in terms of data privacy, data heterogeneity, and personalized customization. Extensive analytical and comparative experiments on three benchmark remote sensing scene classification datasets validate the versatility and effectiveness of our methods, the proposed FedSCCNAS exhibits superior competitiveness compared to state-of-the-art methods.
Recently, the multiobjective evolutionary algorithms (MOEAs) have been designed to cope with the sparse unmixing problem. Due to the excellent performance of MOEAs in solving the NP hard optimization problems, they have also achieved good results for the sparse unmixing problems. However, most of these MOEA-based methods only deal with a single pixel for unmixing and are subjected to low efficiency and are time-consuming. In fact, sparse unmixing can naturally be seen as a multitasking problem when the hyperspectral imagery is clustered into several homogeneous regions, so that evolutionary multitasking can be employed to take advantage of the implicit parallelism from different regions. In this paper, a novel evolutionary multitasking multipopulation particle swarm optimization framework is proposed to solve the hyperspectral sparse unmixing problem. First, we resort to evolutionary multitasking optimization to cluster the hyperspectral image into multiple homogeneous regions, and directly process the entire spectral matrix in multiple regions to avoid dimensional disasters. In addition, we design a novel multipopulation particle swarm optimization method for major evolutionary exploration. Furthermore, an intra-task and inter-task transfer and a local exploration strategy are designed for balancing the exchange of useful information in the multitasking evolutionary process. Experimental results on two benchmark hyperspectral datasets demonstrate the effectiveness of the proposed method compared with the state-of-the-art sparse unmixing algorithms.
The Near Space Communication System is a promising and burgeoning alternative solution to the modern world's increasing communication demand. The deployment of the airships is important to the performance of the Near Space Communication System, of which the coverage and speed are conflictive. In a real world application, this system is also usually faced with regular changes of the user distribution. In this paper, we present a Tide User Model which simulates those changes of the user distribution. To optimize the deployment of the airships on the Tide User Model, a memetic algorithm based on MOEA/D with particularly designed operators is proposed aiming at providing a set of solutions as good as possible for the decision maker. We carry out the experiments on which the proposed algorithm and MOEA/D with two regular operators are compared for different settings. The results show that the proposed memetic algorithm based on MOEA/D achieves satisfying results and has better performance on the Tide User Model.
14 March 2025 in IEEE Transactions on Emerging Topics in Computational Intelligence
Heterogeneous Graph Neural Networks (HetGNN) have garnered significant attention and demonstrated success in tackling various tasks. However, most existing HetGNNs face challenges in effectively addressing unreliable heterogeneous graph structures and encounter semantic indistinguishability problems as their depth increases. In an effort to deal with these challenges, we introduce a novel heterogeneous graph representation learning with optimized structures to optimize heterogeneous graph structures and utilize semantic aggregation mechanism to alleviate semantic indistinguishability while learning node embeddings. To address the heterogeneity of relations within heterogeneous graphs, the proposed algorithm employs a strategy of generating distinct relational subgraphs and incorporating them with node features to optimize structural learning. To resolve the issue of semantic indistinguishability, the proposed algorithm adopts a semantic aggregation mechanism to assign appropriate weights to different meta-paths, consequently enhancing the effectiveness of captured node features. This methodology enables the learning of distinguishable node embeddings by a deeper HetGNN model. Extensive experiments on the node classification task validate the promising performance of the proposed framework when compared with state-of-the-art methods.
Deep community can be detected by removing noise nodes or edges from a network. A centrality measure, named local Fiedler vector centrality is proposed for deep community detection. Algorithms to optimize local Fiedler vector centrality are either with high computation complexity or difficult to find the optimal solution of local Fiedler vector centrality. In this paper, a novel memetic algorithm is proposed to maximize local Fiedler vector centrality for deep community detection. Experiments of our proposed memetic algorithm on four real world networks demonstrate that our algorithm can find optimal solution of local Fiedler vector centrality and is effective to discover deep communities.