Carefully selecting clients to participate in aggregation can assist the global model in achieving better performance. However, existing research on federated heterogeneous graph learning (FHGL) has shown limited attention to the client selection (CS) problem. Current CS algorithms face challenges in accurately evaluating client contributions and selecting appropriate participants in the context of FHGL, leading to a dilemma between convergence and accuracy. In this paper, we propose a Reinforcement Active client selection based Federated Heterogeneous Graph Learning (RAFHGL), which precisely evaluates the importance of local heterogeneous graph data and selects high-contributing clients for aggregation. RAFHGL employs an active learning agent to select representative nodes for local training. The statistical features of the active scores are used to assess client contributions. A client selection agent then chooses clients conducive to global model convergence for aggregation. To address heterogeneity introduced by sample and client selection, the training process stabilizes by correcting local losses based on data prototypes. Experimental results on 4 publicly available heterogeneous graph datasets show that RAFHGL outperforms existing Client Selection algorithms in federated heterogeneous graph learning scenarios in terms of performance and convergence.

Deep cross-media hashing provides an efficient semantic representation learning solution for large-scale cross-media retrieval. The existing methods only consider the inter-media or intra-media semantic association learning, ignore the guiding of semantic structure information, and have weak reasoning ability for implicit fine-grained semantic associations. To tackle this problem, we propose a novel structures aware fine-grained contrastive adversarial hashing method for cross-media retrieval. A novel cross-media contrastive adversarial hash network is constructed for the first time, which integrates the cross-media and intra-media contrastive learning and multi-modal adversarial learning, aiming at maximizing the semantic association between different modalities, and improving the semantic discrimination and consistency of cross-media unified hash representation, thereby the inter-media and intra-media semantic preserving ability can be well enhanced; A fine-grained cross-media semantic feature learning method based on fine-grained semantic reasoning with transformers is proposed, which captures fine-grained salient features of different modalities for semantic association learning, and enhances the reasoning ability of fine-grained implicit semantic association; A semantic label graph convolutional network guided cross-media semantic association learning strategy is proposed, which makes full use of semantic structure information to enhance the learning ability of implicit cross-media semantic associations. Extensive experiments on several large-scale cross-media benchmark datasets demonstrate that the proposed method outperforms the state-of-the-art methods.

Scholar clustering has garnered increasing attention due to the explosive growth of scholar data. Although researchers have proposed many algorithms to cluster scholars, they typically focus on clustering scholars from the intrinsic view (scholars’ contents). These algorithms may lead to inaccurate and biased clustering results because they ignore the extrinsic view (scholar's specialty) and the changeability of scholars’ interest in each view. In this paper, we propose a multi-view scholar clustering topic model (MSCT), which integrates complementary information from both intrinsic and extrinsic views while considering dynamic scholar interests. Specifically, MSCT involves two novel schemes. The first one ismulti-view integration, where MSCT collaboratively tracks scholars’ time-varying topic distribution from two views:intrinsic viewandextrinsic view. The former exploits the details of different academic degrees in the title and information in the abstract; the latter leverages the specialty of different categories in the corresponding research field and research discipline. The second one isdynamic interest tracking, which dynamically models each scholar's interest distribution in terms of the current scholar texts and previously estimated distribution through a newly designed collapsed Gibbs sampling algorithm. Experimental results demonstrate that MSCT can significantly outperform state-of-the-art algorithms.