Node Failures of Heterogeneous Networks Link Based on HLE-T Algorithm

Through the analysis of historical data of heterogeneous networks, the main task of this paper is to predict whether there will be failure instances under the target meta-path between the nodes to be tested in the future network. The HLE-T algorithm that dynamically combines link entropy and time is proposed. Taking into account the different effects of different nodes in the path instance and the establishment time of the path instance, the effectiveness of the HLE-T algorithm is verified on the AMiner data set of the DBLP academic network. When considering the formation of the target link, it is necessary to comprehensively consider the contribution of different meta-paths and their path instances to the formation of the link.

Authors

Institutions

Publication Details

Published
2024-10-25
DOI
https://doi.org/10.1109/ccnis64984.2024.00008
Primary Topic
Mobile Agent-Based Network Management
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Node Failures of Heterogeneous Networks Link Based on HLE-T Algorithm

Yuwei Mu, Qianwei Shen
Mobile Agent-Based Network Management
article

Node Failures of Heterogeneous Networks Link Based on HLE-T Algorithm

Yuwei Mu, Qianwei Shen
article en

Abstract

Through the analysis of historical data of heterogeneous networks, the main task of this paper is to predict whether there will be failure instances under the target meta-path between the nodes to be tested in the future network. The HLE-T algorithm that dynamically combines link entropy and time is proposed. Taking into account the different effects of different nodes in the path instance and the establishment time of the path instance, the effectiveness of the HLE-T algorithm is verified on the AMiner data set of the DBLP academic network. When considering the formation of the target link, it is necessary to comprehensively consider the contribution of different meta-paths and their path instances to the formation of the link.

Tianjin University of Technology (CN)
Openalex Percentile: Top 67%
Mobile Agent-Based Network Management
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.