Link Prediction Task Research Articles

Continual learning with high-order experience replay for dynamic network embedding

Dynamic network embedding (DNE) poses a tough challenge in graph representation learning, especially when confronted with the frequent updates of streaming data. Conventional DNEs primarily resort to parameter updating but perform inadequately on historical networks, resulting in the problem of catastrophic forgetting. To tackle such issues, recent advancements in graph neural networks (GNNs) have explored matrix factorization techniques. However, these approaches encounter difficulties in preserving the global patterns of incremental data. In this paper, we propose CLDNE, a Continual Learning framework specifically designed for Dynamic Network Embedding. At the core of CLDNE lies a streaming graph auto-encoder that effectively captures both global and local patterns of the input graph. To further overcome catastrophic forgetting, CLDNE is equipped with an experience replay buffer and a knowledge distillation module, which preserve high-order historical topology and static historical patterns. We conduct experiments on four dynamic networks using link prediction and node classification tasks to evaluate the effectiveness of CLDNE. The outcomes demonstrate that CLDNE successfully mitigates the catastrophic forgetting problem and reduces training time by 80% without a significant loss in learning new patterns.

Relation semantic fusion in subgraph for inductive link prediction in knowledge graphs

Inductive link prediction (ILP) in knowledge graphs (KGs) aims to predict missing links between entities that were not seen during the training phase. Recent some subgraph-based methods have shown some advancements, but they all overlook the relational semantics between entities during subgraph extraction. To overcome this limitation, we introduce a novel inductive link prediction model named SASILP (Structure and Semantic Inductive Link Prediction), which comprehensively incorporates relational semantics in both subgraph extraction and node initialization processes. The model employs a random walk strategy to calculate the structural scores of neighboring nodes and utilizes an enhanced graph attention network to determine their semantic scores. By integrating both structural and semantic scores, SASILP strategically selects key nodes to form a subgraph. Furthermore, the subgraph is initialized with a node initialization technique that integrates information about neighboring relations. The experiments conducted on benchmark datasets demonstrate that SASILP outperforms state-of-the-art methods on inductive link prediction tasks, and verify the effectiveness of our approach.

Meta-collaboration-based semantic contrast for inductive knowledge representation learning

Inductive knowledge representation learning aims at effectively representing new entities in emerging knowledge graphs based on current ones, providing positive support for reasoning facts with newly emerging entities. It requires a scheme that can derive the instant knowledge to generate rational representations for new entities. Recently, some approaches have been developed for it by capturing logical rules between entities, mining structural information of KGs, or learning multiple structural patterns of entities. However, there are two main challenges that they have yet to overcome. The first is the structural bias-induced semantic ambiguity, where new entities are typically represented in a manner akin to those with analogous structures, during which the identical structures are emphasized while the differences are overlooked. We refer to this as the structural bias, which will lead to the generated representations of new entities being semantically ambiguous. The second is the potential sparsity of new entities. The presence of new entities with low frequencies brings about the insufficient representations for these new entities even training a model from scratch with substantial costs. To this end, we propose a Meta-Collaboration-based Semantic Contrast (MCSC) framework with the aim of addressing both issues above. Following the current meta-task formulation scheme, we first acquire the relation-specific knowledge to produce entity representations through modeling relations as feedback. Then, a multi-layer graph neural network module is developed to aggregate sufficient neighbor information to update entity representations. In the final, a collaborative semantic contrast module is designed on both support and query sets to respectively overcome the structural bias-induced semantic ambiguity and the potential sparsity of new entities challenges. Such a meta-collaboration-based semantic contrast procedure transcends current meta-learning paradigms in inductive knowledge representation learning that fail to learn semantically discriminative entity representations. Experimental results of the inductive link prediction task on 12 benchmark datasets demonstrate the superiority of MCSC over SOTA baselines.

BioPathNet: Enhancing Link Prediction in Biomedical Knowledge Graphs through Path Representation Learning.

Understanding complex interactions in biomedical networks is crucial for advancements in biomedicine, but traditional link prediction (LP) methods are limited in capturing this complexity. Representation-based learning techniques improve prediction accuracy by mapping nodes to low-dimensional embeddings, yet they often struggle with interpretability and scalability. We present BioPathNet, a novel graph neural network framework based on the Neural Bellman-Ford Network (NBFNet), addressing these limitations through path-based reasoning for LP in biomedical knowledge graphs. Unlike node-embedding frameworks, BioPathNet learns representations between node pairs by considering all relations along paths, enhancing prediction accuracy and interpretability. This allows visualization of influential paths and facilitates biological validation. BioPathNet leverages a background regulatory graph (BRG) for enhanced message passing and uses stringent negative sampling to improve precision. In evaluations across various LP tasks, such as gene function annotation, drug-disease indication, synthetic lethality, and lncRNA-mRNA interaction prediction, BioPathNet consistently outperformed shallow node embedding methods, relational graph neural networks and task-specific state-of-the-art methods, demonstrating robust performance and versatility. Our study predicts novel drug indications for diseases like acute lymphoblastic leukemia (ALL) and Alzheimer's, validated by medical experts and clinical trials. We also identified new synthetic lethality gene pairs and regulatory interactions involving lncRNAs and target genes, confirmed through literature reviews. BioPathNet's interpretability will enable researchers to trace prediction paths and gain molecular insights, making it a valuable tool for drug discovery, personalized medicine and biology in general.

Application of geometric deep learning in disease-gene relationship prediction

The correlation between diseases and genetic factors represents a pivotal challenge in the biomedical field, often conceptualized as a task of link prediction. Conventional methods employed for prediction, such as statistical models and various machine learning algorithms, frequently fall short in terms of accuracy when confronted with the intricacies of biological network data. These methods also tend to inadequately represent the complex relationships inherent in such data. In contrast, recent advances in geometric deep learning have introduced a powerful tool within artificial intelligence, particularly adept at processing non-Euclidean data structures. This study delves into the potential of leveraging geometric deep learning techniques to enhance the prediction of disease-gene associations. Initially, we conduct a thorough review of existing research related to link prediction, encompassing both traditional approaches and contemporary methods grounded in deep learning. Subsequently, we propose a geometric deep learning framework, incorporating Graph Convolutional Networks (GCN) and Graph Auto-Encoder (GAE), to develop and assess our predictive model. The results of our experiments demonstrate that the proposed geometric deep learning model surpasses conventional techniques in accurately predicting disease-gene associations. In conclusion, we evaluate the implications of our findings, discuss their practical applications in the biomedical domain, and suggest possible avenues for future research.

Community knowledge graph abstraction for enhanced link prediction: A study on PubMed knowledge graph

Objective:As new knowledge is produced at a rapid pace in the biomedical field, existing biomedical Knowledge Graphs (KGs) cannot be manually updated in a timely manner. Previous work in Natural Language Processing (NLP) has leveraged link prediction to infer the missing knowledge in general-purpose KGs. Inspired by this, we propose to apply link prediction to existing biomedical KGs to infer missing knowledge. Although Knowledge Graph Embedding (KGE) methods are effective in link prediction tasks, they are less capable of capturing relations between communities of entities with specific attributes (Fanourakis et al., 2023). Methods:To address this challenge, we proposed an entity distance-based method for abstracting a Community Knowledge Graph (CKG) from a simplified version of the pre-existing PubMed Knowledge Graph (PKG) (Xu et al., 2020). For link prediction on the abstracted CKG, we proposed an extension approach for the existing KGE models by linking the information in the PKG to the abstracted CKG. The applicability of this extension was proved by employing six well-known KGE models: TransE, TransH, DistMult, ComplEx, SimplE, and RotatE. Evaluation metrics including Mean Rank (MR), Mean Reciprocal Rank (MRR), and Hits@k were used to assess the link prediction performance. In addition, we presented a backtracking process that traces the results of CKG link prediction back to the PKG scale for further comparison. Results:Six different CKGs were abstracted from the PKG by using embeddings of the six KGE methods. The results of link prediction in these abstracted CKGs indicate that our proposed extension can improve the existing KGE methods, achieving a top-10 accuracy of 0.69 compared to 0.5 for TransE, 0.7 compared to 0.54 for TransH, 0.67 compared to 0.6 for DistMult, 0.73 compared to 0.57 for ComplEx, 0.73 compared to 0.63 for SimplE, and 0.85 compared to 0.76 for RotatE on their CKGs, respectively. These improved performances also highlight the wide applicability of the extension approach. Conclusion:This study proposed novel insights into abstracting CKGs from the PKG. The extension approach indicated enhanced performance of the existing KGE methods and has applicability. As an interesting future extension, we plan to conduct link prediction for entities that are newly introduced to the PKG.

Dynamic Graph Representation Learning via Coupling-Process Model.

Representation learning based on dynamic graphs has received a lot of attention in recent years due to its wide range of application scenarios. Although many discrete or continuous dynamic graph representation learning methods have been proposed, many of them ignore the role of edge types. Through the observation of dynamic graphs in the real world, it is found that the types of various edges are very different in nature. They are roughly divided into two categories according to the frequency of occurrence: evolutive edges that appear infrequently and interactive edges that appear frequently. For both types of edges, we propose a coupling-process model (DyCPM) to capture the dynamic mechanisms of them. The model not only generates low-dimensional embedding vectors of nodes, but also aggregates the structural information and temporal information of two kinds of edges. In particular, we design a neural network parameterized discrete process to depict the change law of the topology of evolutive edges and a neural network parameterized temporal point process (TPP) to characterize the temporal dynamic rule of interactive edges. More importantly, we propose a coupling mechanism to transfer the information of the two processes through a shared embedding matrix and finally generate an embedding matrix that aggregates the topology information and temporal information of the two kinds of edges for the dynamic link prediction task. We evaluate our model and several baselines on real datasets. The experimental results show that our model can better aggregate the topology information and temporal information of the two kinds of edges according to their properties and outperforms several state-of-the-art baselines in the performance of dynamic link prediction.

A hierarchical and interlamination graph self-attention mechanism-based knowledge graph reasoning architecture

Knowledge Graph (KG) is an essential research field in graph theory, but its inherent incompleteness and sparsity influence its performance in several fields. Knowledge Graph Reasoning (KGR) aims to ameliorate those problems by mining new knowledge from subsistent knowledge. As one of the downstream tasks of KGR, link prediction is of great significance for improving the quality of KG. Recently, the Graph Neural Network (GNN)-based method became the most effective way to achieve the link prediction task. However, it still suffers from problems such as incomplete neighbor and relation-level information aggregation and unstable learning of the entity's features. To improve those issues, a Hierarchical and Interlamination Graph Self-attention Mechanism-based (HIGSM) plug-and-play architecture is proposed for KGR in this paper. It is composed of three-level layers: feature extractor, encoder, and decoder. The feature extractor makes our architecture more effective and stable for the retrieval of new features. The encoder is equipped with a two-stage encoding mechanism accompanied by two mixture-of-expert strategies, which enables our architecture to capture more practical reasoning information to improve prediction accuracy and generalization of the model. The decoder can use existing KGR models and compute the scores of triples in KG. The extensive experimental results and ablation studies on four KGs unambiguously demonstrate the state-of-the-art prediction performance of the proposed HIGSM architecture compared to current GNN-based methods.

Neighbor-Enhanced Representation Learning for Link Prediction in Dynamic Heterogeneous Attributed Networks

Dynamic link prediction aims to predict future connections among unconnected nodes in a network. It can be applied for friend recommendations, link completion, and other tasks. Network representation learning algorithms have demonstrated considerable effectiveness in various prediction tasks. However, most network representation learning algorithms are based on homogeneous networks and static networks for link prediction that do not consider rich semantic and dynamic information. Additionally, existing dynamic network representation learning methods neglect the neighborhood interaction structure of the node. In this work, we design a neighbor-enhanced dynamic heterogeneous attributed network embedding method (NeiDyHNE) for link prediction. In light of the impressive achievements of the heuristic methods, we learn the information of common neighbors and neighbors’ interaction in heterogeneous networks to preserve the neighbors proximity and common neighbors proximity. NeiDyHNE encodes the attributes and neighborhood structure of nodes as well as the evolutionary features of the dynamic network. More specifically, NeiDyHNE consists of the hierarchical structure attention module and the convolutional temporal attention module. The hierarchical structure attention module captures the rich features and semantic structure of nodes. The convolutional temporal attention module captures the evolutionary features of the network over time in dynamic heterogeneous networks. We evaluate our method and various baseline methods on the dynamic link prediction task. Experimental results demonstrate that our method is superior to baseline methods in terms of accuracy.

A multi-hierarchical aggregation-based graph convolutional network for industrial knowledge graph embedding towards cognitive intelligent manufacturing

The rapid development and widespread applications of cognitive computing technologies have led to a paradigm shift towards cognitive intelligent development in manufacturing, where knowledge plays an increasingly important role in enabling higher levels of cognition. Knowledge graph (KG) has emerged as one of the essential tools in cognitive intelligent manufacturing and its completion would significantly impact the quality of knowledge. To facilitate effective knowledge management, KG embedding has proven to be an effective approach for KG completion. However, existing models have deficiencies in achieving relation-specific transformations, differentiating the neighbor nodes, and exploiting the intermediate information generated during the KG embedding learning process, which is prone to limit model performance and hinder successful applications. To address these limitations, this paper proposes a new multi-hierarchical aggregation-based graph convolutional network (GCN), consisting of relation-aware, entity-aware, and across-block aggregation. A parallel relation and entity-aware aggregation (PREA) block is established to simultaneously perform relation-specific transformations and entity-differentiated learning. Additionally, an across-block aggregation is constructed to efficiently integrate extracted information from the intermediate stacked block. To demonstrate the effectiveness and superiority of the proposed approach, 3D printing KG is constructed, which is a representative knowledge-intensive industry linking to a variety of aspects like raw materials, adhesion, usages, etc. Extensive experiments are conducted based on the link prediction task. Illustrative examples are provided to reveal the practical implementation of the proposed method, along with technical details and insightful opinions, exhibiting its promising applications.

Path-based reasoning for biomedical knowledge graphs with BioPathNet.

Understanding complex interactions in biomedical networks is crucial for advancements in biomedicine, but traditional link prediction (LP) methods are limited in capturing this complexity. Representation-based learning techniques improve prediction accuracy by mapping nodes to low-dimensional embeddings, yet they often struggle with interpretability and scalability. We present BioPathNet, a novel graph neural network framework based on the Neural Bellman-Ford Network (NBFNet), addressing these limitations through path-based reasoning for LP in biomedical knowledge graphs. Unlike node-embedding frameworks, BioPathNet learns representations between node pairs by considering all relations along paths, enhancing prediction accuracy and interpretability. This allows visualization of influential paths and facilitates biological validation. BioPathNet leverages a background regulatory graph (BRG) for enhanced message passing and uses stringent negative sampling to improve precision. In evaluations across various LP tasks, such as gene function annotation, drug-disease indication, synthetic lethality, and lncRNA-mRNA interaction prediction, BioPathNet consistently outperformed shallow node embedding methods, relational graph neural networks and task-specific state-of-the-art methods, demonstrating robust performance and versatility. Our study predicts novel drug indications for diseases like acute lymphoblastic leukemia (ALL) and Alzheimer's, validated by medical experts and clinical trials. We also identified new synthetic lethality gene pairs and regulatory interactions involving lncRNAs and target genes, confirmed through literature reviews. BioPathNet's interpretability will enable researchers to trace prediction paths and gain molecular insights, making it a valuable tool for drug discovery, personalized medicine and biology in general.

Graph Representation Learning for Street-Level Crime Prediction

In contemporary research, the street network emerges as a prominent and recurring theme in crime prediction studies. Meanwhile, graph representation learning shows considerable success, which motivates us to apply the methodology to crime prediction research. In this article, a graph representation learning approach is utilized to derive topological structure embeddings within the street network. Subsequently, a heterogeneous information network that incorporates both the street network and urban facilities is constructed, and embeddings through link prediction tasks are obtained. Finally, the two types of high-order embeddings, along with other spatio-temporal features, are fed into a deep neural network for street-level crime prediction. The proposed framework is tested using data from Beijing, and the outcomes demonstrate that both types of embeddings have a positive impact on crime prediction, with the second embedding showing a more significant contribution. Comparative experiments indicate that the proposed deep neural network offers superior efficiency in crime prediction.

Self-supervised reconstructed graph learning for link prediction in bipartite graphs

Graph Neural Network(GNN) has achieved remarkable performance in classification tasks due to its strong distinctive power of different graph topologies. However, traditional GNNs face great limitations in link prediction tasks since they learn vertex embeddings from fixed input graphs thus the learned embeddings cannot reflect unobserved graph structures. Graph-learning based GNNs have shown better performance by collaborative learning of graph structures and vertex embeddings, but most of them rely on available initial features to refine graphs and almost perform graph learning at once. Recently, some methods utilizes contrastive learning to facilitate link prediction, but their graph augmentation strategies are predefined only on original graphs, and do not introduce unobserved edges into augmented graphs. To this end, a self-supervised reconstructed graph learning (SRGL) method is proposed. The key points of SRGL lie in two folds: Firstly, it generates augmented graphs for contrasting by learning reconstructed graphs and vertex embeddings from each other, which brings unobserved edges into augmented graphs. Secondly, it maximizes the mutual information between edge-level embeddings of reconstructed graphs and the graph-level embedding of an original graph, which guarantees learned reconstructed graphs to be relevant to the original graph.

TracKGE: Transformer with Relation-pattern Adaptive Contrastive Learning for Knowledge Graph Embedding

Knowledge Graphs, fundamental to intelligent applications, are increasingly critical in various domains, enhancing tasks like precise searching and personalized recommendation. Effectively representing entities and relationships in these graphs is key, especially as the Transformer model, despite its representational prowess, faces challenges in adapting to the graph’s structure and complex relations. In this work, we present the Transformer with Relation-pattern Adaptive Contrastive Learning for Knowledge Graph Embedding (TracKGE). Specifically, TracKGE transforms the structural information of the knowledge graph into a sequence format that is more manageable for Transformers. In addition, we employ a relation-pattern adaptive contrastive learning module to capture a richer semantic and complex relationship pattern information of the knowledge graph. Lastly, by introducing a mask node model, it addresses the issue of incomplete information in the knowledge graph, further enhancing the model’s capability to capture implicit relationships within it. To evaluate the performance of our model, we have chosen well-established models as baselines and executed link prediction tasks on four renowned datasets. Our experimental results reveal that our model excels in representing the semantics and intricate structures of Knowledge Graphs. It outperforms other advanced baseline models, showcasing its superior capability in handling complex data representations.

A binary-domain recurrent-like architecture-based dynamic graph neural network

The integration of Dynamic Graph Neural Networks (DGNNs) with Smart Manufacturing is crucial as it enables real-time, adaptive analysis of complex data, leading to enhanced predictive accuracy and operational efficiency in industrial environments. To address the problem of poor combination effect and low prediction accuracy of current dynamic graph neural networks in spatial and temporal domains, and over-smoothing caused by traditional graph neural networks, a dynamic graph prediction method based on spatiotemporal binary-domain recurrent-like architecture is proposed: Binary Domain Graph Neural Network (BDGNN). The proposed model begins by utilizing a modified Graph Convolutional Network (GCN) without an activation function to extract meaningful graph topology information, ensuring non-redundant embeddings. In the temporal domain, Recurrent Neural Network (RNN) and residual systems are employed to facilitate the transfer of dynamic graph node information between learner weights, aiming to mitigate the impact of noise within the graph sequence. In the spatial domain, the AdaBoost (Adaptive Boosting) algorithm is applied to replace the traditional approach of stacking layers in a graph neural network. This allows for the utilization of multiple independent graph learners, enabling the extraction of higher-order neighborhood information and alleviating the issue of over-smoothing. The efficacy of BDGNN is evaluated through a series of experiments, with performance metrics including Mean Average Precision (MAP) and Mean Reciprocal Rank (MRR) for link prediction tasks, as well as metrics for traffic speed regression tasks across diverse test sets. Compared with other models, the better experiments results demonstrate that BDGNN model can not only better integrate the connection between time and space information, but also extract higher-order neighbor information to alleviate the over-smoothing phenomenon of the original GCN.

Research on Recognition Method of Social Robot Based on T-A-GCNIIT in the Metaverse

Social robots are used in intelligent customer service, intelligent chat, intelligent shopping guides, and more because of emotion recognition studies in cognitive psychology. However, determining the user's purpose quickly and precisely has proved challenging. Domestic researchers proposed the A-GCNII model to address missing feature information; however, it needs a lot of math. This research offers a social robot recognition approach using the T-A-GCNIIT model and cognitive psychology to optimize computing complexity and performance. The T-A-GCNIIT algorithm processes social network data, and the Viola–Jones algorithm improves social robot intelligence to represent social robots in the meta-universe. The model performs well in node classification, link prediction, community discovery, and other tasks, with enhanced accuracy, recall, F1 score value, and other metrics. The model can also better comprehend the user's emotional state using cognitive psychology to better recognize their purpose and propose a fresh notion for enhancing social robots' cognitive psychology.

A knowledge graphs representation method based on IsA relation modeling

Knowledge graph representation learning, which is able to support further knowledge computation and reasoning, has drawn much research attention in the field of artificial intelligence in recent years. Due to data sparsity, traditional knowledge graph methods focusing on the observed facts have poor performance. Therefore, researchers introduce auxiliary information to tackle this issue. As a kind of prior knowledge containing rich semantics, IsA relation could be used to boost model performance. We propose a knowledge representation learning method combined with isA relation modeling. Specifically, we model two features of isA relation—transitivity and antisymmetry. The transitivity is modeled by the projection invariance of vectors, and antisymmetry is modeled by partial order constraints. We use RotatE as our base model which could also be replaced by other knowledge embedding model with higher dimension. Finally, experimental results of link prediction and triple classification task on two datasets verify the proposed model’s effectiveness outperforming baseline models.

BP-MoE: Behavior Pattern-aware Mixture-of-Experts for Temporal Graph Representation Learning

Temporal graph representation learning aims to develop low-dimensional embeddings for nodes in a graph that can effectively capture their structural and temporal properties. Prior approaches primarily focus on devising sophisticated neural architectures to encode the historical interactions of nodes, enabling capturing the specific behavior patterns. However, such methods often overlook the fact that different nodes in a graph may exhibit distinct evolutionary preferences, resulting in a failure to adequately model the variations in the node evolution behavior. To address these issues, we propose a novel temporal graph learning framework called Behavior Pattern-aware Mixture-of-Experts (BP-MoE), which leverages multiple expert encoder networks with diverse architectures to comprehensively capture the behavior patterns for nodes. In detail, we first design a multi-perspective graph encoder that employs experts based on the gated recurrent units, graph attention units, and multilayer perceptron units to encode a node’s long-term memory, high-order neighborhood features, and short-term behavior preference, respectively. Subsequently, to achieve the personalized evolution preference learning for each individual node, we incorporate a behavior pattern-aware MoE mechanism to activate the pattern-specific experts for each node via a gating network. Finally, to optimize the training process of expert networks, we introduce two auxiliary losses that prevent the imbalanced training across experts. Extensive experiments conducted on multiple benchmark datasets verify the superiority of our approach over the state-of-the-art baselines. Specifically, BP-MoE consistently outperforms the baseline models for the link prediction and node classification tasks under various experimental settings.

GEUKE: A geographic entities uniformly explicit knowledge embedding model

AbstractKnowledge embedding for geographic knowledge graphs can effectively improve computational efficiency and provide support for knowledge reasoning, knowledge answering and other applications of knowledge graphs. To maintain a more comprehensive understanding of spatial features through knowledge embedding, it is crucial to integrate the representation and computation of various entity types, encompassing points, lines, and polygons. This article proposes a geographic entities uniformly explicit knowledge embedding model (GEUKE). In GEUKE, spatial data of point, line, and polygon‐type geographic entities are expressed in the form of subgraphs, and space embedding is generated using a SubGNN‐based uniform spatial feature encoder. GEUKE improves the energy function in TransE to train spatial feature‐based embedding and structural‐based embedding of geographic entities into a unified vector space. Experimental results show that GEUKE has higher performance than TransE, TransH, TransD, and TransE‐GDR on link prediction and triple classification task. Within the spatial feature embedding process, GEUKE effectively preserves the inherent features of entities, encompassing location, neighborhood, and structural attributes, while simultaneously ensuring a coherent spatial data representation across all three entity types: points, lines, and polygons. By maintaining the spatial features of geographic entities and their interrelations, this capability unleashes the full potential of applications such as knowledge reasoning and geospatial question answering in a manner that is conducive to diverse geospatial scenarios.

ClusterLP: A novel Cluster-aware Link Prediction model in undirected and directed graphs

Link prediction models endeavor to understand the distribution of links within graphs and forecast the presence of potential links. With the advancements in deep learning, prevailing methods typically strive to acquire low-dimensional representations of nodes in networks, aiming to capture and retain the structure and inherent characteristics of networks. However, the majority of these methods primarily focus on preserving the microscopic structure, such as the first- and second-order proximities of nodes, while largely disregarding the mesoscopic cluster structure, which stands out as one of the network's most prominent features. Following the homophily principle, nodes within the same cluster exhibit greater similarity to each other compared to those from different clusters, suggesting that they should possess analogous vertex representations and higher probabilities of linkage. In this study, we develop a straightforward yet efficient Cluster-aware Link Prediction framework (ClusterLP), with the objective of directly leveraging cluster structures to predict links among nodes with maximum accuracy in both undirected and directed graphs. Specifically, we posit that establishing links between nodes with similar representation vectors and cluster tendencies is more feasible in undirected graphs, whereas nodes in directed graphs are inclined to point towards nodes with akin representation vectors and greater influence. We tailor the implementation of ClusterLP for undirected and directed graphs, respectively, and experimental findings using multiple real-world networks demonstrate the high competitiveness of our models in the realm of link prediction tasks. The code utilized in our implementation is accessible at https://github.com/ZINUX1998/ClusterLP.