Yajun Yang

Dr. Yajun Yang


Research Focus & Metrics

Academic Career Length

11Years (2016-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 March 2019 in Data Science and Engineering
Verified
Journal Article
Open access
PDF file
XWXin Wang
Xin Wang
LCLele Chai
Lele Chai
QXQiang Xu
Qiang Xu
YYYajun Yang
Yajun Yang
Jianxin LiJianxin Li
Jianxin Li
YCYunpeng Chai
Yunpeng Chai
With the popularity of knowledge graphs growing rapidly, large amounts of RDF graphs have been released, which raises the need for addressing the challenge of distributed subgraph matching queries. In this paper, we propose an efficient distributed method to answer subgraph matching queries on big RDF graphs using MapReduce. In our method, query graphs are decomposed into a set of stars that utilize the semantic and structural information embedded RDF graphs as heuristics. Two optimization techniques are proposed to further improve the efficiency of our algorithms. One algorithm, called RDF property filtering, filters out invalid input data to reduce intermediate results; the other is to improve the query performance by postponing the Cartesian product operations. The extensive experiments on both synthetic and real-world datasets show that our method outperforms the close competitors S2X and SHARD by an order of magnitude on average.

27 April 2022 in Knowledge-Based Systems
Verified
Journal Article
Open access
PLPengkai Liu
Pengkai Liu
Xin WangXin Wang
Xin Wang
QFQiang Fu
Qiang Fu
YYYajun Yang
Yajun Yang
YLYuan-Fang Li
Yuan-Fang Li
QZQingpeng Zhang
Qingpeng Zhang

21 December 2022 in ACM Transactions on Information Systems
Verified
Journal Article
Open access
HZHang Zhang
Hang Zhang
YYYajun Yang
Yajun Yang
Xin WangXin Wang
Xin Wang
HGHong Gao
Hong Gao
QHQinghua Hu
Qinghua Hu
In the social network, each user has attributes for self-description called user attributes, which are semantically hierarchical. Attribute inference has become an essential way for social platforms to realize user classifications and targeted recommendations. Most existing approaches mainly focus on the flat inference problem neglecting the semantic hierarchy of user attributes, which will cause serious inconsistency in multi-level tasks. In this article, we propose a multi-level model MLI, where information propagation part collects attribute information by mining the global graph structure, and the attribute correction part realizes the mutual correction between different levels of attributes. Further, we put forward the concept of generalized semantic tree, a way of representing the hierarchical structure of user attributes, whose nodes are allowed to have multiple parent nodes unlike the regular tree. Both regular and generalized semantic trees are commonly used in practice, and can be handled by our model. Besides, by making the inference start from sub-networks with sufficient attribute information, we design a “Ripple” algorithm to improve the efficiency and effectiveness of our model. For evaluation purposes, we conduct extensive verification experiments on DBLP datasets. The experimental results show the superior effect of MLI, compared with the state-of-the-art methods.


11 April 2025 in Proceedings of the AAAI Conference on Artificial Intelligence
Verified
Journal Article
Open access
PDF file
JLJunliang Li
Junliang Li
YYYajun Yang
Yajun Yang
YZYujia Zhang
Yujia Zhang
QHQinghua Hu
Qinghua Hu
AZAlan Zhao
Alan Zhao
HGHong Gao
Hong Gao
Information popularity prediction, aiming to predict the growth of user participation in a trending topic diffusion, is a fundamental task in social networks. Existing methods often treat information diffusion as a single independent process, ignoring the ``public opinion field effect'' where multiple trending topics coexist and compete for user attention simultaneously. Inspired by Hawkes theory, we propose a novel Hawkes-process-based learning model for information popularity prediction, which takes into account both the temporal correlation among users' propagation behaviors in several topics diffusion and public opinion field effect in social networks. We first propose an improved neural Hawkes process to capture comprehensive propagation law from multiple dimensions and then propose a novel public opinion field paradigm based on the improved Hawkes process and cascade structure. We design a novel learning framework incorporating the public opinion field paradigm to extract high-quality representations for information popularity prediction. Extensive experiments on four real-world datasets validate that our model significantly outperforms the state-of-the-art competitors.

1 January 2019 in Complexity
Verified
Journal Article
Open access
PDF file
YYYajun Yang
Yajun Yang
ZLZhongfei Li
Zhongfei Li
Xin WangXin Wang
Xin Wang
QHQinghua Hu
Qinghua Hu
Graph is an important complex network model to describe the relationship among various entities in real applications, including knowledge graph, social network, and traffic network. Shortest path query is an important problem over graphs and has been well studied. This paper studies a special case of the shortest path problem to find the shortest path passing through a set of vertices specified by user, which is NP‐hard. Most existing methods calculate all permutations for given vertices and then find the shortest one from these permutations. However, the computational cost is extremely expensive when the size of graph or given set of vertices is large. In this paper, we first propose a novel exact heuristic algorithm in best‐first search way and then give two optimizing techniques to improve efficiency. Moreover, we propose an approximate heuristic algorithm in polynomial time for this problem over large graphs. We prove the ratio bound is 3 for our approximate algorithm. We confirm the efficiency of our algorithms by extensive experiments on real‐life datasets. The experimental results validate that our algorithms always outperform the existing methods even though the size of graph or given set of vertices is large.