Semantic graphs are fundamental to the Web, enabling applications such as semantic search, recommendation, and knowledge-intensive reasoning. In decentralized Web environments, however, these graphs are distributed across organizations and constrained by strict privacy policies, making centralized training infeasible. Federated learning provides a promising solution, yet its effectiveness is severely limited by the dual incompleteness of real-world semantic graphs: missing node attributes and incomplete relational structures. Such dual missingness, often heterogeneous and unobserved across clients, causes substantial degradation in model performance. We present FedCL, a missingness-aware federated contrastive learning framework for dual-incomplete semantic graphs. FedCL introduces two key components: a topology estimation module, grounded in rate–distortion theory, that privately quantifies structural incompleteness across clients, and a federated reconstruction module that leverages these estimations to generate plausible relations without inferring sensitive attributes. To further improve robustness, FedCL integrates graph contrastive learning across reconstructed subgraphs, ensuring semantic consistency across heterogeneous and incomplete client graphs. Experiments on benchmark citation and Web datasets demonstrate that FedCL consistently outperforms state-of-the-art baselines in accuracy and robustness under heterogeneous missingness, while preserving strong privacy guarantees. These results highlight FedCL as a scalable and trustworthy approach for federated learning on incomplete semantic graphs, advancing privacy-preserving knowledge sharing on the Web.

The liver is an internal organ that is most commonly affected by cancer metastasis. Hepatocellular carcinoma (HCC) is a major cause of cancer-related deaths worldwide. Identifying the histological category of this disease is a crucial step in determining the most appropriate treatment plan. Currently, the classification of HCC primarily relies on the observation of pathologists through a visual microscope, which is undoubtedly subjective. To address this issue, the present study conducted pathological examination of liver tumors based on few-shot learning. In order to achieve automatic identification of the three categories in HCC tissue, we propose a few-shot learning based HCC histological image classification method that combines contrastive learning (CL) using different backbone architectures with several well-known machine learning methods. We evaluate 12 backbone-classifier combinations, and the best performance is achieved by combining CL using DeiT-TinyR as the backbone architecture with support vector machine (SVM), with an accuracy of 74.42% and an F1 score of 74.58% in the 3-way-10-shot setting. Experimental results demonstrate the effectiveness of this method in NB histological image classification.

Graph Neural Networks (GNNs) are powerful tools for graph representation. However, GNNs have remained black boxes, leading to the lack of explainability. As a consequence, the application of GNNs has been severely limited. Existing methods focus on generating an explanation with important nodes and edges but pay less attention to high-order structures (e.g., network motif), which are more intuitive and important for graph data. The explanations generated by the explainer will thus ignore the high-order information contained in multi-node neighbours, resulting in a decrease in the human comprehensibility of the explanation subgraph. In this paper, we propose a motif-aware GNNs explainer (MEGA), wherein a motif-aware subgraph generation module and a counterfactual optimization layer are employed. MEGA can provide high-quality counterfactual explanations for GNNs while focusing on high-order features of graph data. We justify the effectiveness of the proposed MEGA on both synthetic and real-world datasets. Experimental results show that MEGA outperforms state-of-the-art baselines while keeping explanations at a smaller level.

In order to save time and cost, many disease gene prediction methods have been proposed in recent years. However, the traditional network model uses a binary relationship to represent the relationship between different proteins or gene molecules and phenotypes, which leads to the loss of information. Recently, hypergraph shows that it can overcome this loss of information to some extent and preserve the multivariate relationship, so we transformed the disease gene prediction problem into the problem of ranking the multivariate-relationship object. In this paper, we propose a method of Heterogeneous Probabilistic Hypergraph Ranking (HPHR) to predict disease genes. Firstly, fix a graph centroid for each hyperedge and according to different associations, and add other nodes related to the graph centroid to hyperedges with a certain probability. Then transform the problem of predicting disease genes into the problem of ranking heterogeneous objects, and the candidate genes are sorted by hypergraph ranking. The method is then applied to the integrated disease gene network. Compared with other prediction methods achieved better results, which was verified by this experiment.

Environment perception is one of the important issues for unmanned ground vehicle (UGV). It is necessary to develop waters hole detection and tracking method in cross-country environment. This paper is related to the waters hole detection and tracking by using visual information. Image processing strategies based on support vector machine (SVM) and speeded up robust feature (SURF) methods are employed to detect and track waters hole. It focuses on how to extract the waters feature descriptor by exploring the machine learning algorithm. Based on the S/V color features and Gray Level Co-occurrence Matrix, the waters feature descriptor is extracted. The radial basis function (RBF) kernel function and the sampling-window size are determined by using the SVM classifier. The optimal parameters are obtained under the cross-validation conditions by the grid method. In terms of waters tracking, SURF feature matching method is applied to extract the remarkable feature points, then to observe the relation between feature point movement of adjacent frames and scale change ratio. Experiments show that SURF algorithm can still be effective to detect and match the remarkable feature points, against the negative effects of waters scale transformation and affine transform. The conclusion is that the computing speed of SURF algorithm is about three times faster than that of scale-invariant feature transform (SIFT) algorithm, and the comprehensive performance of SURF algorithm is better.