Simplex Pattern Prediction Based on Dynamic Higher Order Path Convolutional Networks
Bibliographic Data
| ID | 22108331 |
|---|---|
| Authors | Jianrui Chen (0000-0001-9104-4540, Shaanxi Normal University), Meixia He (0000-0003-2801-1222, Shaanxi Normal University), Peican Zhu (0000-0002-8389-1093, School of Artificial Intelligence, OPtics and ElectroNics (iOPEN), Northwestern Polytechnic University, Xi’an, China), Zhihui Wang (0000-0002-4984-1623, Shaanxi Normal University) |
| Year | 2024 |
| Volume | 11 |
| Issue | 5 |
| Pages | 6623-6636 |
| Publication date | 2024-10-01 |
| Peer Reviewed | Yes |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | IEEE Transactions on Computational Social Systems (JOURNAL) |
| Journal identifiers | ISSN: 2329-924X • E-ISSN: 2373-7476 |
| Publisher | Institute of Electrical and Electronics Engineers (IEEE) (PUBLISHER) |
| DOI | 10.1109/tcss.2024.3408214 |
| OpenAlex | W4399801024 |
| Language | EN |
| References cited | 41 |
Recently, higher order patterns have played an important role in network structure analysis. The simplices in higher order patterns enrich dynamic network modeling and provide strong structural feature information for feature learning. However, the disorder dynamic network with simplex patterns has not been organized and divided according to time windows. Besides, existing methods do not make full use of the feature information to predict the simplex patterns with higher orders. To address these issues, we propose a simplex pattern prediction method based on dynamic higher order path convolutional networks. First, we divide the dynamic higher order datasets into different network structures under continuous-time windows, which possess complete time information. Second, feature extraction is performed on the network structure of continuous-time windows through higher order path convolutional networks. Subsequently, we embed time nodes into feature encoding and obtain feature representations of simplex patterns through feature fusion. The obtained feature representations of simplices are recognized by a simplex pattern discriminator to predict the simplex patterns at different moments. Finally, compared to other dynamic graph representation learning algorithms, our proposed algorithm has significantly improved its performance in predicting simplex patterns on five real dynamic higher order datasets
Algorithm · Combinatorics · Computer network · Convolutional neural network · Simplex · Advanced Algorithms and Applications · Advanced Computational Techniques and Applications · Computer Science · Industrial Technology and Control Systems · Mathematics · Artificial Intelligence
| Citation velocity | historical |
|---|---|
| Highly cited | No |