MOTIVATION: T-cell receptors (TCRs) recognize antigenic peptides presented by major histocompatibility complex (MHC) molecules and are central to adaptive immunity. Computational prediction of TCR-epitope binding (TEB) can accelerate immunotherapy development, yet remains hampered by limited labeled data, false-negative noise in unobserved pairs, and over-smoothing in graph-based models. RESULTS: We present DynaTCR, a dynamic graph ensemble learning framework for TEB prediction. DynaTCR encodes TCR and epitope sequences with protein language model embeddings and organizes them into a bipartite interaction graph. A graph regularization-variance-preserving aggregation (GR-VPA) encoder stabilizes message propagation and alleviates over-smoothing, while a global attention layer captures long-range dependencies. Multiple base learners are trained with iteratively updated hard-negative samples to reduce false-negative predictions. Under the StrictTCR evaluation protocol on four public datasets, DynaTCR achieves AUC improvements of 4.0-8.2 percentage points over the strongest existing method and up to 15.8 percentage points in AUPR. On the most stringently curated dataset, DynaTCR attains an AUC of 95.1%. Furthermore, on an independent structure-derived test set, DynaTCR achieves the highest AUC (72.6%) among all compared methods, demonstrating its robustness and effectiveness for TEB prediction and candidate prioritization. AVAILABILITY: Source code and data can be downloaded from: https://github.com/2014402680/TEB/.

In recent years, incomplete multi-view clustering (IMVC) has attracted considerable attention for its ability to acheieve effective clustering results through the integration of key information amidst missing view. However, the existing IMVC methods are still faced with 3 limitations: (1) They exhibit deficiencies in considering the weight distribution within views, (2) they ignore the varying contributions of different views to the common consistent representation, and (3) they struggle to sufficiently extract and recover the vital information within incomplete views. To address these limitations, we incorporates local reasoning and correlation analysis to design an incomplete multi-view clustering method(IMVCLRCA), which introduces a new strategy of feature learning and missing view recovery, fully exploiting local similarity and structural continuity within views and performing precise local reasoning recovery on missing data. By maximizing mutual information between views through contrastive learning, we achieve the consistent representation learning of multiple views. Furthermore, based on semantic consistency, we comprehensively consider the correlation between views, utilized a weight matrix to fuse cross-view data, and constructed a view with a correlation structure, ultimately obtaining a common consistent representation. We conduct extensive experiments on 4 public datasets including Caltech101-20, BBCSport, Scene-15, and LandUse-21. Experimental results demonstrate that IMVCLRCA has higher accuracy and robustness compared to the state-of-the-art IMVC methods. The anonymous code of this project is available on GitHub at https://github.com/ggg2111/2025WSDM-IMVCLRCA.

The integration of mobile edge computing (MEC) and heterogeneous networks enables network operators to provide task offloading services to a large number of user devices (UDs) for low-latency task processing by equipping macro base stations and densely deployed small base stations with edge servers. Federated deep reinforcement learning allows each UD to collaboratively learn useful knowledge from the interaction with the environment in a privacy-preserving and high-efficiency way and thus has been applied to solve the task offloading problem in recent studies. However, very few of these studies have considered the energy and time costs incurred by the federated learning process. In this article, the goal is to minimize the total UDs’ energy consumption while guaranteeing deadline constraints considering both the task offloading process and the federated learning process in MEC-enabled heterogeneous networks. Toward this end, we propose a federated deep Q-network (DQN) method where each UD optimizes the offloading decision for the offloading process and the participation decision and training volume for the learning process based on its local DQN model. The simulation results demonstrate the proposed method is superior to several existing methods in terms of energy efficiency and Quality of Service (QoS).

In recent years, multi-view data often suffer from incompleteness owing to environmental factors, equipment failures. Thus Incomplete Multi-View Clustering (IMVC) has become an important research focus, which aims to alleviate the adverse impacts of missing views and leverage inter-view complementary information to enhance clustering performance. However, existing IMVC methodologies suffer from three critical limitations: 1) Inadequate integration of cross-view learning and cross-instance learning; 2) Lack of explicit modeling for dynamic interactions between view-specific information and cross-view shared semantics; 3) Inability to dynamically capture high-order topological correlations under view-missing conditions, leading to semantic misalignment among samples. To address these challenges, we propose an IMVC framework CrossNet-VGA based on variational collaboration and graph attention fusion. Specifically, We formulate a novel multi-view evidence lower bound to explicitly separate view-specific latent variables and cross-view shared latent variables, and achieve inter-view semantic fusion by integrating variational distributions shared across views. Contrastive learning is employed to maximize mutual information and promote feature distribution uniformity, thereby achieving consistent representation learning. We employ dynamic $k$ -nearest neighbor graph construction and multi-head graph attention mechanisms to capture the inter-sample deep topological correlations, achieving robust structural alignment. Comprehensive experiments conducted on 6 public datasets demonstrate that CrossNet-VGA significantly outperforms the competing methods both on accuracy and robustness. The anonymous code of this work is available on GitHub at https://github.com/ggg2111/2025-TIP-CrossNet-VGA.

Investigating the inhibitory effects of compounds on cardiac ion channels is essential for assessing cardiac drug safety. Consequently, researchers have developed computational models to evaluate combined cardiotoxicity (CCT) on cardiac ion channels. However, limitations in experimental data often cause issues like uneven data distribution and scarcity. Additionally, existing models primarily emphasize atomic information flow within graph neural networks (GNNs) while overlooking chemical bonds, leading to inadequate recognition of key structures. Therefore, this study integrates optimal transport (OT), structure remapping (SR), and Kolmogorov-Arnold networks (KANs) into a GNN-based CCT prediction model, CardiOT. First, the proposed CardiOT model employs OT pooling to optimize sample-feature joint distribution using expectation maximization, identifying "important" sample-feature pairs. Additionally, SR technology is used to emphasize the role of chemical bond information in message propagation. KAN technology is integrated to greatly enhance model interpretability. In summary, the model mitigates challenges related to uneven data distribution and scarcity. Multiple experiments on public datasets confirm the model's robust performance. We anticipate that this model will provide deeper insights into compound inhibition mechanisms on cardiac ion channels and reduce toxicity risks.

The challenge of optimally placing facilities to maximize coverage within road networks is a critical problem with significant implications for urban planning, emergency response, and the development of sustainable infrastructure. For instance, strategically locating fire stations or electric vehicle (EV) charging stations along a road network can greatly enhance public safety and support the adoption of clean transportation technologies. However, determining these optimal placements is computationally challenging, particularly when accounting for factors like road network distances and coverage radius. Traditional methods, such as greedy algorithms, offer a reasonable approximation but are limited by high computational complexity, making them less suitable for large-scale transportation networks. In response, our research introduces two novel algorithms designed to improve both the efficiency and scalability of the k-radius coverage problem. The first algorithm achieves a strong approximation with significantly reduced time complexity, while the second employs a sketch-based approach, offering a nearly linear time complexity relative to the number of edges. Although the second algorithm sacrifices some approximation accuracy, it offers substantial gains in computational speed, making it particularly valuable for large-scale transportation networks. Extensive experiments on large-scale real-world road networks demonstrate the superior performance of our proposed methods compared to existing solutions.

In recent years, since edge computing has improved the performance of transportation systems, research on edge-computing-enabled transportation systems has received widespread attention. However, most previous studies overlooked that task requests in transportation systems are unevenly distributed in time and space, which easily causes the overloading of edge servers, resulting in high response latency. To this end, we present a novel task offloading scheme based on graph neural network (GNN) and deep reinforcement learning (DRL) in edge-computing-enabled transportation systems (TransEdge). Specifically, we first propose an adaptive node placement algorithm to assign Internet of Things sensors to appropriate edge servers, thereby minimizing transmission latency. Then, an improved DRL scheme based on GNN is designed to capture the spatial features between sensors, aiming to improve the accuracy of task offloading decisions. Finally, we introduce a task forwarding strategy based on the greedy algorithm to achieve collaborative task offloading between different edge servers and overcome the system instability caused by a sudden surge in task requests. We conduct extensive experiments on two real-world traffic data sets. The results show that TransEdge reduces the response latency by at least 3.7% compared to four baselines while achieving a success rate of 99%.

Recently, the Industrial Internet of Things (IIoT) has shown great application value in environmental monitoring. However, it suffers from serious bottlenecks in energy and computing capability. To address them, researchers have made lots of effort. Nevertheless, they neglect either the edge–end collaboration or the impact of task queue backlog, resulting in low system revenue. To this end, we design a queue-aware computation offloading method based on DRL (QDRL). Specifically, we represent the long-term system operation as a multistage stochastic mixed-integer optimization problem (M-SMIP), which is further converted into a deterministic problem using Lyapunov optimization. Given that the resource allocation and computation offloading in this deterministic problem are strongly coupled and difficult to solve, we decompose this problem into two subproblems. Subsequently, a reinforcement learning scheme with actor–critic architecture is designed to solve these subproblems. The Actor module is designed based on a deep learning model and quantization strategy for generating computation offloading actions. The mathematical reasoning and learning-based methods are integrated as the Critic module for achieving resource allocation. Extensive simulation results show that the performance of QDRL surpasses four baselines and approaches the approximate optimal algorithm in terms of average task queue length, normalized real computation rate, and computation time.

Link prediction is an important task in social network analysis and mining because of its various applications. A large number of link prediction methods have been proposed. Among them, the deep learning-based embedding methods exhibit excellent performance, which encodes each node and edge as an embedding vector, enabling easy integration with traditional machine learning algorithms. However, there still remain some unsolved problems for this kind of methods, especially in the steps of node embedding and edge embedding. First, they either share exactly the same weight among all neighbors or assign a completely different weight to each node to obtain the node embedding. Second, they can hardly keep the symmetry of edge embeddings obtained from node representations by direct concatenation or other binary operations such as averaging and Hadamard product. In order to solve these problems, we propose a weighted symmetric graph embedding approach for link prediction. In node embedding, the proposed approach aggregates neighbors in different orders with different aggregating weights. In edge embedding, the proposed approach bidirectionally concatenates node pairs both forwardly and backwardly to guarantee the symmetry of edge representations while preserving local structural information. The experimental results show that our proposed approach can better predict network links, outperforming the state-of-the-art methods. The appropriate aggregating weight assignment and the bidirectional concatenation enable us to learn more accurate and symmetric edge representations for link prediction.

Image-based kinship verification is an important task in computer vision and has many applications in practice, such as missing children search and family album construction, among others. Due to the differences in age, gender, expression and appearance, there usually exists a large discrepancy between the facial images of parent and child. This makes kinship verification a challenging task. In this article, we propose a Distance and Direction Based Deep Discriminant Metric Learning (D 4 ML) approach for kinship verification. The basic idea of D 4 ML is to make full use of the discriminant information contained in the facial images of parent and child such that the network can learn more a discriminating distance metric. Specifically, D 4 ML learns the metric by utilizing the discriminant information from two perspectives: distance-based perspective and direction-based perspective. From the distance-based perspective, the designed loss function is used to minimize the distance between images having kinship and maximize the distance between images without kinship. In practice, the gender difference and large age gap may significantly increase the distance between facial images of parent and child. Therefore, learning the metric only from a distance-based perspective is insufficient. Considering that two vectors with a large distance may appear with high similarity in direction, D 4 ML also employs the direction-based loss function in the training process. Both kinds of loss function work together to improve the discriminability of the learned metric. Experimental results on four small size publicly available datasets demonstrate the effectiveness of our approach. Source code of our approach can be found at https://github.com/lclhenu/D4ML .

With the expansion of data, increasing imbalanced data has emerged. When the imbalance ratio (IR) of data is high, most existing imbalanced learning methods decline seriously in classification performance. In this paper, we systematically investigate the highly imbalanced data classification problem, and propose an uncorrelated cost-sensitive multiset learning (UCML) approach for it. Specifically, UCML first constructs multiple balanced subsets through random partition, and then employs the multiset feature learning (MFL) to learn discriminant features from the constructed multiset. To enhance the usability of each subset and deal with the non-linearity issue existed in each subset, we further propose a deep metric based UCML (DM-UCML) approach. DM-UCML introduces the generative adversarial network technique into the multiset constructing process, such that each subset can own similar distribution with the original dataset. To cope with the non-linearity issue, DM-UCML integrates deep metric learning with MFL, such that more favorable performance can be achieved. In addition, DM-UCML designs a new discriminant term to enhance the discriminability of learned metrics. Experiments on eight traditional highly class-imbalanced datasets and two large-scale datasets indicate that: the proposed approaches outperform state-of-the-art highly imbalanced learning methods and are more robust to high IR.

Video-based person re-identification (re-id) is an important application in practice. Since large variations exist between different pedestrian videos, as well as within each video, it's challenging to conduct re-identification between pedestrian videos. In this paper, we propose a simultaneous intra-video and inter-video distance learning (SI2DL) approach for video-based person re-id. Specifically, SI2DL simultaneously learns an intravideo distance metric and an inter-video distance metric from the training videos. The intra-video distance metric is used to make each video more compact, and the inter-video one is used to ensure that the distance between truly matching videos is smaller than that between wrong matching videos. Considering that the goal of distance learning is to make truly matching video pairs from different persons be well separated with each other, we also propose a pair separation based SI2DL (P-SI2DL). P-SI2DL aims to learn a pair of distance metrics, under which any two truly matching video pairs can be well separated. Experiments on four public pedestrian image sequence datasets show that our approaches achieve the state-of-the-art performance.