Kai Wang

Kai Wang

Auto-generated profile, based on publicly available information

Kai Wang

Institute of Information Technology, Information Engineering University, Zhengzhou 450002, Henan, People’s Republic of China

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
4 September 2019 in Entropy
Verified
Journal Article
Open access
PDF file
XLXing Li
Xing Li
SLShu-Xin Liu
Shu-Xin Liu
HCHongchang Chen
Hongchang Chen
KWKai Wang
Kai Wang
Recently, a number of similarity-based methods have been proposed for link prediction of complex networks. Among these indices, the resource-allocation-based prediction methods perform very well considering the amount of resources in the information transmission process between nodes. However, they ignore the information channels and their information capacity in information transmission process between two endpoints. Motivated by the Cannikin Law, the definition of information capacity is proposed to quantify the information transmission capability between any two nodes. Then, based on the information capacity, a potential information capacity (PIC) index is proposed for link prediction. Empirical study on 15 datasets has shown that the PIC index we proposed can achieve a good performance, compared with eight mainstream baselines.

5 January 2023 in Entropy
Verified
Journal Article
Open access
PDF file
RLRan Li
Ran Li
HCHongchang Chen
Hongchang Chen
SLShuxin Liu
Shuxin Liu
KWKai Wang
Kai Wang
BWBiao Wang
Biao Wang
XHXinxin Hu
Xinxin Hu
Telecom fraud detection is of great significance in online social networks. Yet the massive, redundant, incomplete, and uncertain network information makes it a challenging task to handle. Hence, this paper mainly uses the correlation of attributes by entropy function to optimize the data quality and then solves the problem of telecommunication fraud detection with incomplete information. First, to filter out redundancy and noise, we propose an attribute reduction algorithm based on max-correlation and max-independence rate (MCIR) to improve data quality. Then, we design a rough-gain anomaly detection algorithm (MCIR-RGAD) using the idea of maximal consistent blocks to deal with missing incomplete data. Finally, the experimental results on authentic telecommunication fraud data and UCI data show that the MCIR-RGAD algorithm provides an effective solution for reducing the computation time, improving the data quality, and processing incomplete data.

14 August 2024 in Applied Soft Computing
Verified
Journal Article
Closed access
RLRan Li
Ran Li
HCHongchang Chen
Hongchang Chen
SLShu-Xin Liu
Shu-Xin Liu
KWKai Wang
Kai Wang
SLShuo Liu
Shuo Liu
ZSZhe Su
Zhe Su

1 December 2024 in Chaos: An Interdisciplinary Journal of Nonlinear Science
Verified
Journal Article
Open access
PDF file
LHLi Haitao
Li Haitao
LJLixin Ji
Lixin Ji
KWKai Wang
Kai Wang
SLShu-Xin Liu
Shu-Xin Liu
SLShu-Xin Liu
Shu-Xin Liu
Critical infrastructure systems (CIS) are closely related to human life. Attacks against CIS occur frequently, making accurate and effective protection of CIS essential. Vulnerability assessment is the primary issue to achieving this goal. The interconnected characteristic of CIS means that it is best represented by a multi-layer network, but a uniform model is absent. Game theory offers a suitable framework for researching intelligent confrontation. Previous research combining game theory and network science mainly focuses on a single-layer network and lacks a comprehensive assessment that combines qualitative and quantitative aspects of vulnerability. In this paper, we apply the Stackelberg game to the multi-layer network and comprehensively assess vulnerability based on game equilibrium to realize accurate protection. We first present a method for constructing a general model of the multi-layer network and introduce a multi-layer weighted factor to extend topological attribute metrics. Then, we design a Stackelberg game model for the multi-layer network. Furthermore, we qualitatively analyze the impact of multi-layer network characteristics on vulnerability and propose a method to quantify vulnerability. Experiments show that the vulnerability of the multi-layer network is greatly influenced by the multi-layer weighted factor, single-layer network type, and inter-layer coupling method. The quantitative value of network vulnerability does not rely entirely on the topology attributes on which the attack and defense costs depend but also relates to the resources available. Our work provides an adaptive model for CIS and gives a new approach to developing accurate protection based on comprehensive vulnerability assessment, which deserves further study.

16 August 2024 in Entropy
Verified
Journal Article
Open access
PDF file
JZJunjie Zhang
Junjie Zhang
CLCaixia Liu
Caixia Liu
SLShu-Xin Liu
Shu-Xin Liu
KWKai Wang
Kai Wang
WZWeifei Zang
Weifei Zang
Prior research on cascading failures within interdependent networks has predominantly emphasized the coupling of nodes. Nevertheless, in practical networks, interactions often exist not just through the nodes themselves but also via the connections (edges) linking them, a configuration referred to as edge-coupled interdependent networks. Past research has shown that introducing a certain percentage of reinforced nodes or connecting edges can prevent catastrophic network collapses. However, the effect of reinforced inter-layer links in edge-coupled interdependent networks has yet to be addressed. Here, we develop a theoretical framework for studying percolation models in edge-coupled interdependent networks by introducing a proportion of reinforced inter-layer links and deriving detailed expressions for the giant and finite components and the percolation phase transition threshold. We find that there exists a required minimum proportion of the reinforced inter-layer links to prevent abrupt network collapse, which serves as a boundary to distinguish different phase transition types of a network. We provide both analytical and numerical solutions for random and scale-free networks, demonstrating that the proposed method exhibits superior reinforcement efficiency compared to intra-layer link reinforcement strategies. Theoretical analysis, simulation results, and real network systems validate our model and indicate that introducing a specific proportion of reinforced inter-layer links can prevent abrupt system failure and enhance network robustness in edge-coupled interdependent networks.

1 January 2024 in Chinese Journal of Electronics
Verified
Journal Article
Closed access
SLShu-Xin Liu
Shu-Xin Liu
HCHongchang Chen
Hongchang Chen
LWLan Wu
Lan Wu
KWKai Wang
Kai Wang
XLXing Li
Xing Li
Link prediction utilizes accessible network information to complement or predict the network links. Similarity is an important prerequisite for link prediction which means links more likely occurs between two similar nodes. Existing methods utilize the similarity of nodes but neglect of network structure. However the link direction leads to a far more complex structure and contains more information useful than the undirected networks. Most classic methods are difficult to depict the distribution of the network structure with incidental direction so the similarity characteristics of the network structure itself are lost. In this respect, a new method of local structure entropy is proposed to depict the directed structural distribution characteristics, which can be used to evaluate the degree of local structural similarity of nodes and then applied to link prediction methods. Experimental results on 8 real directed networks show that this method is effective for both area under the receiver operating characteristic curve (AUC) and ranking-score measures, and improved predictive capacity of the baseline methodology.