摘要
High-level link prediction is a hot and difficult problem in network analysis research. An excellent high-level link prediction algorithm can not only mine the potential relationship between nodes in a complex network but also help to understand the law of network structure evolves over time. Exploring unknown network relationships has important applications. Most traditional link prediction algorithms only consider the structural similarity between nodes, while ignoring the characteristics of higher-order structures and information about network changes. This study proposes a high-order link prediction model based on Motif clustering coefficients and time series partitioning (MTLP). This model constructs a representational feature vector by extracting the features of Motif clustering coefficients and network structure evolution of high-order structures in the network, and uses multilayer perceptron (MLP) network model to complete the link prediction task. By conducting experiments on different real-life data sets, the results show that the proposed MTLP model has better high-order link prediction performance than the state-of-the-art methods.
投稿的翻译标题 | High-order Link Prediction Method Based on Motif Aggregation Coefficient and Time Series Division |
---|---|
源语言 | 繁体中文 |
页(从-至) | 712-725 |
页数 | 14 |
期刊 | Ruan Jian Xue Bao/Journal of Software |
卷 | 32 |
期 | 3 |
DOI | |
出版状态 | 已出版 - 3月 2021 |
关键词
- Dynamic networks
- Graph based machine learning
- High-order network structure
- Link prediction