Yingjie Liu

Mr. Yingjie Liu

Yunnan Minzu University, Kunming, Yunnan, China
orcid

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
8 July 2022 in Information Sciences
Verified
Journal Article
Closed access
YLYingjie Liu
Yingjie Liu
SLShihu Liu
Shihu Liu
FYFusheng Yu
Fusheng Yu
XYXiyang Yang
Xiyang Yang

19 August 2022 in Entropy
Verified
Journal Article
Open access
PDF file
SLShihu Liu
Shihu Liu
YLYingjie Liu
Yingjie Liu
CYChunsheng Yang
Chunsheng Yang
LDLi Deng
Li Deng
Many similarity measure algorithms of nodes in weighted graph data have been proposed by employing the degree of nodes in recent years. Despite these algorithms obtaining great results, there may be still some limitations. For instance, the strength of nodes is ignored. Aiming at this issue, the relative entropy of the distance distribution based similarity measure of nodes is proposed in this paper. At first, the structural weights of nodes are given by integrating their degree and strength. Next, the distance between any two nodes is calculated with the help of their structural weights and the Euclidean distance formula to further obtain the distance distribution of each node. After that, the probability distribution of nodes is constructed by normalizing their distance distributions. Thus, the relative entropy can be applied to measure the difference between the probability distributions of the top d important nodes and all nodes in graph data. Finally, the similarity of two nodes can be measured in terms of this above-mentioned difference calculated by relative entropy. Experimental results demonstrate that the algorithm proposed by considering the strength of node in the relative entropy has great advantages in the most similar node mining and link prediction.

22 April 2022 in arXiv
Verified
Preprint
Open access
PDF file
HHHaoxiang Huang
Haoxiang Huang
YLYingjie Liu
Yingjie Liu
VYVigor Yang
Vigor Yang
In our prior work [arXiv:2109.09316], neural network methods with inputs based on domain of dependence and a converging sequence were introduced for solving one dimensional conservation laws, in particular the Euler systems. To predict a high-fidelity solution at a given space-time location, two solutions of a conservation law from a converging sequence, computed from low-cost numerical schemes, and in a local domain of dependence of the space-time location, serve as the input of a neural network. In the present work, we extend the methods to two dimensional Euler systems and introduce variations. Numerical results demonstrate that the methods not only work very well in one dimension [arXiv:2109.09316], but also perform well in two dimensions. Despite smeared local input data, the neural network methods are able to predict shocks, contacts, and smooth regions of the solution accurately. The neural network methods are efficient and relatively easy to train because they are local solvers.