YJYantao Jia

Yantao Jia

*This is an algorithmically generated author record based on publicly available information.

Yantao Jia has a total of 17 co-authors. Here are the top co-authors by number of shared publications:

  • Xueqi Cheng

    CAS Key Laboratory of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Science, Beijing, China

    4 shared publications
  • Xiaolong Jin

    Chinese Acad Sci, Key Lab Network Data Sci & Technol, Inst Comp Technol, Beijing, Peoples R China

    3 shared publications
  • Yuanzhuo Wang

    CAS Key Laboratory of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Science, Beijing, China

    3 shared publications
  • Yuanzhuo Wang

    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

    2 shared publications
  • Denghui Zhang

    CAS Key Laboratory of Network Data Science and Technology, Institute of Computing Technology, Chinese Academy of Science, Beijing, China

    1 shared publication
  • Hailun Lin

    Institute of Information Engineering, Chinese Academy of Sciences, Beijing, P. R. China

    1 shared publication

Latest Publications

  • Open Access

    SWE-Debate: Competitive Multi-Agent Debate for Software Issue Resolution

    by Han Li, Yuling Shi, Shaoxin Lin, Xiaodong Gu, Heng Lian, Xin Wang, Yantao Jia, Tao Huang, Qianxiang Wang


  • Link Prediction in Knowledge Graphs: A Hierarchy-Constrained Approach

    by Manling Li, Yuanzhuo Wang, Denghui Zhang, Yantao Jia, Xueqi Cheng

    Link prediction over a knowledge graph aims to predict the missing head entities $h$ or tail entities $t$ and missing relations $r$ for a triple $(h,r,t)$ . Recent years have witnessed great advance of knowledge graph embedding based link prediction methods, which represent entities and relations as elements of a continuous vector space. Most methods learn the embedding vectors by optimizing a margin-based loss function, where the margin is used to separate negative and positive triples in the loss function. The loss function utilizes the general structures of knowledge graphs, e.g., the vector of $r$ is the translation of the vector of $h$ and $t$ , and the vector of $t$ should be the nearest neighbor of the vector of $h+r$ . However, there are many particular structures, and can be employed to promote the performance of link prediction. One typical structure in knowledge graphs is hierarchical structure, which existing methods have much unexplored. We argue that the hierarchical structures also contain rich inference patterns, and can further enhance the link prediction performance. In this paper, we propose a hierarchy-constrained link prediction method, called hTransM, on the basis of the translation-based knowledge graph embedding methods. It can adaptively determine the optimal margin by detecting the single-step and multi-step hierarchical structures. Moreover, we prove the effectiveness of hTransM theoretically, and experiments over three benchmark datasets and two sub-tasks of link prediction demonstrate the superiority of hTransM.


  • Path-specific knowledge graph embedding

    by Yantao Jia, Yuanzhuo Wang, Xiaolong Jin, Xueqi Cheng


  • Open Access

    Knowledge Graph Embedding

    by Yantao Jia, Yuanzhuo Wang, Xiaolong Jin, Hailun Lin, Xueqi Cheng

    A knowledge graph is a graph with entities of different types as nodes and various relations among them as edges. The construction of knowledge graphs in the past decades facilitates many applications, such as link prediction, web search analysis, question answering, and so on. Knowledge graph embedding aims to represent entities and relations in a large-scale knowledge graph as elements in a continuous vector space. Existing methods, for example, TransE, TransH, and TransR, learn the embedding representation by defining a global margin-based loss function over the data. However, the loss function is determined during experiments whose parameters are examined among a closed set of candidates. Moreover, embeddings over two knowledge graphs with different entities and relations share the same set of candidates, ignoring the locality of both graphs. This leads to the limited performance of embedding related applications. In this article, a locally adaptive translation method for knowledge graph embedding, called TransA, is proposed to find the loss function by adaptively determining its margin over different knowledge graphs. Then the convergence of TransA is verified from the aspect of its uniform stability. To make the embedding methods up-to-date when new vertices and edges are added into the knowledge graph, the incremental algorithm for TransA, called iTransA, is proposed by adaptively adjusting the optimal margin over time. Experiments on four benchmark data sets demonstrate the superiority of the proposed method, as compared to the state-of-the-art ones.


  • Link Inference in Dynamic Heterogeneous Information Network: A Knapsack-Based Approach

    by Yantao Jia, Yuanzhuo Wang, Xiaolong Jin, Zeya Zhao, Xueqi Cheng

    Link inference, i.e., inferring links between vertices in a heterogeneous information network with heterogeneous vertices and edges, has been extensively studied in recent years. So far, many machine learning-based methods have been proposed for link inference, which can be classified into two categories, namely, supervised and unsupervised. Supervised methods perform well but highly rely on feature selection and training data. Although unsupervised methods are inferior to supervised ones, they work in a relatively simple way without considering the class distribution of the training data. In this paper, we investigate the link inference problem in heterogeneous information networks by proposing a knapsack-constrained inference method. Specifically, we integrate dynamic information into the heterogeneous information network and further formalize the link inference problem as a knapsack-like problem. We then solve it by the virtue of a 0-1 knapsack analogous optimization approach and investigate the time complexity of the proposed approach. Finally, experimental results show that the proposed unsupervised method can obtain high performance comparable to supervised method for some cases.