Yinghong Ma

Dr. Yinghong Ma


Research Focus & Metrics

Academic Career Length

21Years (2006-Present)

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

Representative Publications

View All Publications
1 May 2019 in Information Sciences
Verified
Journal Article
Closed access
ZLZhiyuan Liu
Zhiyuan Liu
YMYinghong Ma
Yinghong Ma

1 May 2021 in Computer Communications
Verified
Journal Article
Closed access
XYXuemei You
Xuemei You
YMYinghong Ma
Yinghong Ma
ZLZhiyuan Liu
Zhiyuan Liu
JLJiacheng Liu
Jiacheng Liu
MZMingming Zhang
Mingming Zhang

1 January 2021 in Knowledge-Based Systems
Verified
Journal Article
Closed access
MLMengmeng Liu
Mengmeng Liu
YMYinghong Ma
Yinghong Ma
乐S乐 Song
乐 Song
CLChangyu Liu
Changyu Liu

9 December 2023 in Communications in Nonlinear Science and Numerical Simulation
Verified
Journal Article
Closed access
HZHan Zhou
Han Zhou
YMYinghong Ma
Yinghong Ma
HCHuizheng Chen
Huizheng Chen
XYXuemei You
Xuemei You

2 January 2019 in Complexity
Verified
Journal Article
Open access
PDF file
XMXiaojian Ma
Xiaojian Ma
YMYinghong Ma
Yinghong Ma
Detecting influential spreaders had become a challenging and crucial topic so far due to its practical application in many areas, such as information propagation inhibition and disease dissemination control. Some traditional local based evaluation methods had given many discussions on ranking important nodes. In this paper, ranking nodes of networks continues to be discussed. A semilocal structures method for ranking nodes based on the degree and the neighbors’ connections of the node is presented. The semilocal structures are regarded as the number of neighbors of the nodes and the connections between the node and its neighbors. We combined the triangle structure and the degree information of the neighbors to define the inner‐outer spreading ability of the nodes and then summed the node neighbors’ inner‐outer spreading ability to be used as the local triangle structure centrality (LTSC). The LTSC avoids the defect “pseudo denser connections” in measuring the structure of neighbors. The performance of the proposed LTSC method is evaluated by comparing the spreading ability on both real‐world and synthetic networks with the SIR model. The simulation results of the discriminability and the correctness compared with pairs of ranks (one is generated by SIR model and the others are generated by central nodes measures) show that LTSC outperforms some other local or semilocal methods in evaluating the node’s influence in most cases, such as degree, betweenness, H‐index, local centrality, local structure centrality, K‐shell, and S‐shell. The experiments prove that the LTSC is an efficient and accurate ranking method which provides a more reasonable evaluating index to rank nodes than some previous approaches.

31 March 2020 in IEEE Access
Verified
Journal Article
Open access
ZLZhiyuan Liu
Zhiyuan Liu
YMYinghong Ma
Yinghong Ma
XWXiujuan Wang
Xiujuan Wang
Community detection is a key aspect for understanding network structures and uncovers the underlying functions or characteristics of complex systems. A community usually refers to a set of nodes that are densely connected among themselves, but sparsely connected to the remaining nodes of the network. Detecting communities has been proved to be a NP-hard problem. Therefore, evolutionary based optimization approaches can be used to solve it. But a primary challenge for them is the higher computational complexity when dealing with large scale networks. In this respect, a COMpression based Multi-Objective Evolutionary Algorithm with Decomposition (Com-MOEA/D) for community detection is proposed where the network is first compressed to a much more smaller scale by exploring network topologies. After that, a framework of multi-objective evolutionary algorithm based on decomposition is applied, in which a local information based genetic operator is proposed to speed up the convergence and improve the accuracy of the Com-MOEA/D algorithm. Experimental results on both real world and synthetic networks show the superiority of the proposed method over several state-of-the-art community detection algorithms.