Query：
学者姓名：汪璟玢
Refining：
Year
Type
Indexed by
Source
Complex
Former Name
Co-
Language
Clean All
Abstract ：
Temporal Knowledge Graph Completion (TKGC) aims to address the incompleteness issue present in Temporal Knowledge Graph (TKG). Existing methods for TKGC mainly fall into two categories: one is the method that combines temporal information with entity and relation representations, which makes it difficult to deal with complex temporal patterns, and the other is the method that uses Graph Neural Network (GNN) to capture the neighborhood structure, which usually focuses on single timestamps and ignores the interactions between different timestamps. To address these limitations, we propose a novel method called Dynamic Periodicity Perception and Multi-Graph Integration (DPPMI). DPPMI introduces Temporal Category Sampling strategy and Relation-Aware Graph Transformer module to effectively capture contextual information across different time points. To handle complex temporal dynamics, we introduce a novel period embedding method based on the prime. Furthermore, we introduce a specialized attention mechanism to dynamically perceive the significance of various period embeddings, enabling the model to effectively identify and capture complex temporal patterns. Experimental results show that our model improves the Mean Reciprocal Rank (MRR) on the ICEWS14, YAGO11k, and Wikidata12k datasets by around 3.9%, 10%, and 3.7%, respectively, compared to the state-of-the-art baseline. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
Keyword ：
Graph embeddings Graph embeddings Knowledge graph Knowledge graph
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wu, Yuwei , Ke, Xifan , He, Haoran et al. Dynamic Period Perception and Multi-graph Integration for Temporal Knowledge Graph Completion [C] . 2025 : 412-426 . |
| MLA | Wu, Yuwei et al. "Dynamic Period Perception and Multi-graph Integration for Temporal Knowledge Graph Completion" . (2025) : 412-426 . |
| APA | Wu, Yuwei , Ke, Xifan , He, Haoran , Zha, Xian , Wang, Jingbin . Dynamic Period Perception and Multi-graph Integration for Temporal Knowledge Graph Completion . (2025) : 412-426 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Knowledge graph completion (KGC) aims to enhance the completeness and utility of knowledge graphs (KGs) by predicting and filling missing information. Existing methods primarily focus on structured representation learning, extracting low-dimensional embeddings of entities and relations to uncover and predict missing information in knowledge graphs. However, these methods often overlook entity type information and lack deep feature extraction capabilities. Inability to recognize the type information of entities may lead to poor embedding expression effects of entities, while insufficient deep feature extraction limits the model’s ability to understand complex relationships. To address these issues, this paper proposes a Knowledge Graph Completion with Entity Type-Aware and Deep Feature Extraction (TAFE). The model employs a Type-Aware Graph Attention Encoder (TA-GAT) to identify equivalence relations and model entity type information during graph context entity aggregation. Additionally, it incorporates a Deep Feature Extraction 3D Convolution Decoder (FE-Conv3D), using Gaussian function mapping techniques to capture deep feature information of entities and relations. The 3D convolutional kernels extract interaction and local features among embeddings, enhancing the model’s ability to capture details and understand complex relationships. Extensive experimental analysis demonstrates the effectiveness of TAFE in knowledge graph completion tasks. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
Keyword ：
Graph embeddings Graph embeddings Graph neural networks Graph neural networks Knowledge graph Knowledge graph
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Fuyuan , You, Changkai , Lin, Xinyang et al. Knowledge Graph Completion with Entity Type-Aware and Deep Feature Extraction [C] . 2025 : 396-411 . |
| MLA | Zhang, Fuyuan et al. "Knowledge Graph Completion with Entity Type-Aware and Deep Feature Extraction" . (2025) : 396-411 . |
| APA | Zhang, Fuyuan , You, Changkai , Lin, Xinyang , Zheng, Cuichun , Zhang, Yumeng , Wang, Jingbin . Knowledge Graph Completion with Entity Type-Aware and Deep Feature Extraction . (2025) : 396-411 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Multimodal Knowledge Graph Completion (MMKGC) involves integrating information from various modalities, such as text and images, into traditional knowledge graphs to enhance their completeness and accuracy. This approach leverages the complementary nature of multimodal data to strengthen the expressive power of knowledge graphs, thereby achieving better performance in tasks like knowledge reasoning and information retrieval. However, knowledge graph completion models designed for the structural information of triples directly applied to the multimodal domain have led to suboptimal model performance. In response to this challenge, this study introduces a novel model called the Multimodal Knowledge Graph Completion Model Based on Modal Hierarchical Fusion (MHF). The MHF model employs a phased fusion strategy that initially learns from structured, visual, and textual modalities independently. Then, it combines structural embeddings with text and image data using a specially designed neural network fusion layer to see how the different types of data interact with each other. Additionally, the MHF model incorporates a semantic constraint layer with a Factor Interaction Regularizer, which enhances the model’s generalization ability by exploiting the semantic equivalence between the head and tail entities of triples. Experimental results on three real-world multimodal benchmark datasets demonstrate that the MHF model achieves excellent performance in link prediction tasks, surpassing the current state-of-the-art baselines, the average performance gain of MRR, Hit@1, and Hit@10 is greater than 5.4%. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
Keyword ：
Data fusion Data fusion Graph embeddings Graph embeddings Knowledge graph Knowledge graph Semantics Semantics
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Zhang, Sirui , Huang, Hao , Lin, Xinyang et al. Multimodal Knowledge Graph Completion Model Based on Modal Hierarchical Fusion [C] . 2025 : 381-395 . |
| MLA | Zhang, Sirui et al. "Multimodal Knowledge Graph Completion Model Based on Modal Hierarchical Fusion" . (2025) : 381-395 . |
| APA | Zhang, Sirui , Huang, Hao , Lin, Xinyang , Zheng, Cuichun , Zheng, Zhibo , Wang, Jingbin . Multimodal Knowledge Graph Completion Model Based on Modal Hierarchical Fusion . (2025) : 381-395 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
The extrapolation task in the temporal knowledge graph has received increasing attention from scholars due to its wide range of practical application scenarios. At present, recurrent neural networks are currently widely used in temporal knowledge graph completion techniques. These networks are employed to depict the sequential pattern of entities and relations. However, as the sequence lengthens, some critical early information may become diluted. Prediction errors ensue in the completion task as a result. Furthermore, it is observed that existing temporal knowledge graph completion methods fail to account for the topological structure of relations, which leads to relation representations with essentially little distinction across different timestamps. In order to tackle the previously mentioned concern, our research introduces a Temporal Knowledge Graph Completion Method utilizing Sequence-Focus Patterns Representation Learning (SFP). This method contains two patterns: the Focus pattern and the Sequential pattern. In the SFP model, we developed a novel graph attention network called ConvGAT. This network efficiently distinguishes and extracts complex relation information, thereby enhancing the accuracy of entity representations that are aggregated in the Focus pattern and Sequential pattern. Furthermore we proposed RelGAT, a graph attention network that simulates the topological structure of relations. This enhances the precision of relation representations and facilitates the differentiation between relation embeddings generated at various timestamps in the Focus pattern. Utilizing a time-aware attention mechanism, the Focus pattern extracts vital information at particular timestamps in order to amplify the data that the Sequential pattern dilutes. On five distinct benchmark datasets, SFP significantly outperforms the baseline, according to a comprehensive series of experiments.
Keyword ：
Graph Attention Network Graph Attention Network Knowledge graph completion Knowledge graph completion Link prediction Link prediction Temporal knowledge graphs Temporal knowledge graphs
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Jingbin , Ke, Xifan , Zhang, Fuyuan et al. SFP: temporal knowledge graph completion based on sequence-focus patterns representation learning [J]. | APPLIED INTELLIGENCE , 2025 , 55 (6) . |
| MLA | Wang, Jingbin et al. "SFP: temporal knowledge graph completion based on sequence-focus patterns representation learning" . | APPLIED INTELLIGENCE 55 . 6 (2025) . |
| APA | Wang, Jingbin , Ke, Xifan , Zhang, Fuyuan , Wu, Yuwei , Zhang, Sirui , Guo, Kun . SFP: temporal knowledge graph completion based on sequence-focus patterns representation learning . | APPLIED INTELLIGENCE , 2025 , 55 (6) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Link prediction in open knowledge graphs (OpenKGs) is crucial for applications like question answering and recommendation systems. Existing OpenKG models leverage the semantic information of noun phrases (NPs) to enhance the performance in the link prediction task. However, these models only extract superficial semantic information from NPs, ignoring the fact that an NP possesses diverse semantics. Furthermore, these models have not fully exploited the semantic information of the relation phrases (RPs). To address these issues, we propose a model for link prediction called Open Knowledge Graph Link Prediction with Semantic -Aware Embedding (SeAE). First, we develop an adaptive disentanglement embedding (ADE) mechanism to learn the intrinsically abundant semantics of NPs. The ADE mechanism can adaptively calculate the embedding segmentation number according to the dataset and has an ingenious method for updating embeddings. Second, we integrate the attention mechanism into the GRU encoder to obtain the distribution of importance inside RP, facilitating a more comprehensive capture of the RP's semantic information and enhancing the model's interpretability. Finally, we design a relation gate, which extracts the RP semantic features of tail NP from the shared edge. This gate realizes the relation constraints on entities while enhancing the interaction between entities and relations. Extensive experiments on four benchmarks demonstrate that SeAE outperforms the state-of-the-art models, resulting in improvements of approximately 5.4% and 7.4% in MRR on ReVerb45K and ReVerb45KF datasets respectively.
Keyword ：
Attention mechanism Attention mechanism Knowledge graph embedding Knowledge graph embedding Link prediction Link prediction Open knowledge graph Open knowledge graph Semantic-aware Semantic-aware
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Jingbin , Huang, Hao , Wu, Yuwei et al. Open Knowledge Graph Link Prediction with Semantic-Aware Embedding [J]. | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 249 . |
| MLA | Wang, Jingbin et al. "Open Knowledge Graph Link Prediction with Semantic-Aware Embedding" . | EXPERT SYSTEMS WITH APPLICATIONS 249 (2024) . |
| APA | Wang, Jingbin , Huang, Hao , Wu, Yuwei , Zhang, Fuyuan , Zhang, Sirui , Guo, Kun . Open Knowledge Graph Link Prediction with Semantic-Aware Embedding . | EXPERT SYSTEMS WITH APPLICATIONS , 2024 , 249 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Temporal knowledge graphs completion (TKGC) is a critical task that aims to forecast facts that will occur in future timestamps. It has attracted increasing research interest in recent years. Among the many approaches, reinforcement learning-based methods have gained attention due to their efficient performance and interpretability. However, these methods still face two challenges in the prediction task. First, a single policy network lacks the capability to capture the dynamic and static features of entities and relationships separately. Consequently, it fails to evaluate candidate actions comprehensively from multiple perspectives. Secondly, the composition of the action space is incomplete, often guiding the agent towards distant historical events and missing the answers in recent history. To address these challenges, this paper proposes a Temporal Knowledge Graph Completion Based on a Multi-Policy Network(MPNet). It constructs three policies from the aspects of static entity-relation, dynamic relationships, and dynamic entities, respectively, to evaluate candidate actions comprehensively. In addition, this paper creates a more diverse action space that guides the agent in investigating answers within historical subgraphs more effectively. The effectiveness of MPNet is validated through an extrapolation setting, and extensive experiments conducted on three benchmark datasets demonstrate the superior performance of MPNet compared to existing state-of-the-art methods.
Keyword ：
Knowledge graph completion Knowledge graph completion Link prediction Link prediction Reinforcement learning Reinforcement learning Temporal knowledge graphs Temporal knowledge graphs
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Jingbin , Wu, Renfei , Wu, Yuwei et al. MPNet: temporal knowledge graph completion based on a multi-policy network [J]. | APPLIED INTELLIGENCE , 2024 , 54 (3) : 2491-2507 . |
| MLA | Wang, Jingbin et al. "MPNet: temporal knowledge graph completion based on a multi-policy network" . | APPLIED INTELLIGENCE 54 . 3 (2024) : 2491-2507 . |
| APA | Wang, Jingbin , Wu, Renfei , Wu, Yuwei , Zhang, Fuyuan , Zhang, Sirui , Guo, Kun . MPNet: temporal knowledge graph completion based on a multi-policy network . | APPLIED INTELLIGENCE , 2024 , 54 (3) , 2491-2507 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Accurate monitoring of urban waterlogging contributes to the city's normal operation and the safety of residents' daily travel. However, due to feedback delays or high costs, existing methods make large-scale, fine-grained waterlogging monitoring impossible. A common method is to forecast the city's global waterlogging status using its partial waterlogging data. This method has two challenges: first, existing predictive algorithms are either driven by knowledge or data alone; and second, the partial waterlogging data is not collected selectively, resulting in poor predictions. To overcome the aforementioned challenges, this paper proposes a framework for large-scale and fine-grained spatiotemporal waterlogging monitoring based on the opportunistic sensing of limited bus routes. This framework follows the Sparse Crowdsensing and mainly comprises a pair of iterative predictor and selector. The predictor uses the collected waterlogging status and the predicted status of the uncollected area to train the graph convolutional neural network. It combines both knowledge-driven and data-driven approaches and can be used to forecast waterlogging status in all regions for the upcoming term. The selector consists of a two-stage selection procedure that can select valuable bus routes while satisfying budget constraints. The experimental results on real waterlogging and bus routes in Shenzhen show that the proposed framework could easily perform urban waterlogging monitoring with low cost, high accuracy, wide coverage, and fine granularity.
Keyword ：
active learning active learning graph convolutional network graph convolutional network route selection route selection sparse crowdsensing sparse crowdsensing waterlogging prediction waterlogging prediction
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | Wang, Jingbin , Zhang, Weijie , Yu, Zhiyong et al. Route selection for opportunity-sensing and prediction of waterlogging [J]. | FRONTIERS OF COMPUTER SCIENCE , 2024 , 18 (4) . |
| MLA | Wang, Jingbin et al. "Route selection for opportunity-sensing and prediction of waterlogging" . | FRONTIERS OF COMPUTER SCIENCE 18 . 4 (2024) . |
| APA | Wang, Jingbin , Zhang, Weijie , Yu, Zhiyong , Huang, Fangwan , Zhu, Weiping , Chen, Longbiao . Route selection for opportunity-sensing and prediction of waterlogging . | FRONTIERS OF COMPUTER SCIENCE , 2024 , 18 (4) . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
Temporal Knowledge Graphs (TKGs), represented by quadruples, describe facts with temporal relevance. Temporal Knowledge Graph Completion (TKGC) aims to address the incompleteness issue of TKGs and has received extensive attention in recent years. Previous approaches treated timestamps as a single node, resulting in incomplete parsing of temporal information and the inability to perceive temporal hierarchies and periodicity. To tackle this problem, we propose a novel model called Time Split Network (TSN). Specifically, we employed a unique approach to handle temporal information by splitting timestamps. This allows the model to perceive temporal hierarchies and periodicity, while reducing the number of model parameters. Additionally, we combined convolutional neural networks with stepwise fusion of temporal features to simulate the hierarchical order of time and obtain comprehensive temporal information. The experimental results of entity link prediction on the four benchmark datasets demonstrate the superiority of the TSN model. Specifically, compared to the state-of-the-art baseline, TSN improves the MRR by approximately 2.6% and 1.3% on the ICEWS14 and ICEWS05-15 datasets, and improves the MRR by approximately 33.5% and 34.6% on YAGO11k and Wikidata12k, respectively. © 2024, The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
Keyword ：
Convolution Convolution Convolutional neural networks Convolutional neural networks Knowledge graph Knowledge graph
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | You, Changkai , Lin, Xinyu , Wu, Yuwei et al. Time Split Network for Temporal Knowledge Graph Completion [C] . 2024 : 333-347 . |
| MLA | You, Changkai et al. "Time Split Network for Temporal Knowledge Graph Completion" . (2024) : 333-347 . |
| APA | You, Changkai , Lin, Xinyu , Wu, Yuwei , Zhang, Sirui , Zhang, Fuyuan , Wang, Jingbin . Time Split Network for Temporal Knowledge Graph Completion . (2024) : 333-347 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
近年来利用图结构来解决知识图补全(KGC)问题取得了不错的进展,其中图神经网络(GNNs)通过聚合实体的局部邻域信息来不断更新中心实体的表示,图注意力网络(GATs)使用注意力机制有侧重地聚合邻居,以获得更准确的中心实体表示.这些模型虽然在KGC中取得了不错的性能,但它们都忽略了中心实体的类型信息,仅仅使用邻域信息来计算注意力,将导致计算出来的注意力不够精准.针对这些问题,文中提出了一种类型匹配约束的图注意力网络(TMGAT),该方法通过计算中心实体类型对每个邻域关系的注意力,来得到实体类型-关系级别的注意力,以进一步计算出中心实体与各邻域关系的类型匹配度,再通过邻域关系及对应的邻居实体,结合类型匹配度计算实体-关系级别的注意力,得到邻域节点对中心实体的最终注意力.使用类型匹配度来约束传统的注意力机制,提升注意力机制的准确性,得到更加精准的中心实体嵌入,进而提升知识图补全的准确性.截至目前,文中提出的TMGAT是第一个在GATs中结合显式类型进行知识图补全任务的模型.文中加工了两个现有的数据集,使数据集中每个实体都拥有若干个类型,以验证TMGAT模型的性能.最后,实验部分展现了 TMGAT在知识补全任务中优秀的竞争力,并研究了类型个数对模型性能的影响.
Keyword ：
图注意力机制 图注意力机制 图结构 图结构 知识图补全 知识图补全 知识图谱 知识图谱 类型信息 类型信息
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 孙首男 , 汪璟玢 , 吴仁飞 et al. TMGAT:类型匹配约束的图注意力网络 [J]. | 计算机科学 , 2024 , 51 (3) : 235-243 . |
| MLA | 孙首男 et al. "TMGAT:类型匹配约束的图注意力网络" . | 计算机科学 51 . 3 (2024) : 235-243 . |
| APA | 孙首男 , 汪璟玢 , 吴仁飞 , 游常凯 , 柯禧帆 , 黄皓 . TMGAT:类型匹配约束的图注意力网络 . | 计算机科学 , 2024 , 51 (3) , 235-243 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Abstract ：
现有的时间知识图谱补全模型仅考虑四元组自身的结构信息,忽略了实体隐含的邻居信息和关系对实体的约束,导致模型在时态知识图谱补全任务上表现不佳.此外,一些数据集在时间上呈现不均衡的分布,导致模型训练难以达到一个较好的平衡点.针对这些问题,提出了一个基于关系约束的上下文感知模型(CARC).CARC通过自适应时间粒度聚合模块来解决数据集在时间上分布不均衡的问题,并使用邻居聚合器将上下文信息集成到实体嵌入中,以增强实体的嵌入表示.此外,设计了四元组关系约束模块,使具有相同关系约束的实体嵌入彼此相近,不同关系约束的实体嵌入彼此远离,以进一步增强实体的嵌入表示.在多个公开的时间数据集上进行了大量实验,实验结果证明了所提模型的优越性.
Keyword ：
关系约束 关系约束 时间区间预测 时间区间预测 时间知识图谱 时间知识图谱 时间粒度 时间粒度 邻居信息 邻居信息 链路预测 链路预测
Cite：
Copy from the list or Export to your reference management。
| GB/T 7714 | 汪璟玢 , 赖晓连 , 林新宇 et al. 基于关系约束的上下文感知时态知识图谱补全 [J]. | 计算机科学 , 2023 , 50 (3) : 23-33 . |
| MLA | 汪璟玢 et al. "基于关系约束的上下文感知时态知识图谱补全" . | 计算机科学 50 . 3 (2023) : 23-33 . |
| APA | 汪璟玢 , 赖晓连 , 林新宇 , 杨心逸 . 基于关系约束的上下文感知时态知识图谱补全 . | 计算机科学 , 2023 , 50 (3) , 23-33 . |
| Export to | NoteExpress RIS BibTex |
Version ：
Export
| Results： |
Selected to |
| Format： |
