Jian Feng^*, Tian Liu, Cailing Du

CMC-Computers, Materials & Continua, Vol.81, No.2, pp. 2895-2909, 2024, DOI:10.32604/cmc.2024.056434 - 18 November 2024

Abstract Unsupervised learning methods such as graph contrastive learning have been used for dynamic graph representation learning to eliminate the dependence of labels. However, existing studies neglect positional information when learning discrete snapshots, resulting in insufficient network topology learning. At the same time, due to the lack of appropriate data augmentation methods, it is difficult to capture the evolving patterns of the network effectively. To address the above problems, a position-aware and subgraph enhanced dynamic graph contrastive learning method is proposed for discrete-time dynamic graphs. Firstly, the global snapshot is built based on the historical snapshots… More >

Lanze Zhang, Yijun Gu^*, Jingjie Peng

CMES-Computer Modeling in Engineering & Sciences, Vol.139, No.2, pp. 1701-1731, 2024, DOI:10.32604/cmes.2023.045129 - 29 January 2024

Abstract Graph Neural Networks (GNNs) play a significant role in tasks related to homophilic graphs. Traditional GNNs, based on the assumption of homophily, employ low-pass filters for neighboring nodes to achieve information aggregation and embedding. However, in heterophilic graphs, nodes from different categories often establish connections, while nodes of the same category are located further apart in the graph topology. This characteristic poses challenges to traditional GNNs, leading to issues of “distant node modeling deficiency” and “failure of the homophily assumption”. In response, this paper introduces the Spatial-Frequency domain Adaptive Heterophilic Graph Neural Networks (SFA-HGNN), which… More >

Zefeng Gu, Hua Chen^*

CMES-Computer Modeling in Engineering & Sciences, Vol.135, No.3, pp. 2497-2514, 2023, DOI:10.32604/cmes.2023.024332 - 23 November 2022

Abstract Link prediction, also known as Knowledge Graph Completion (KGC), is the common task in Knowledge Graphs (KGs) to predict missing connections between entities. Most existing methods focus on designing shallow, scalable models, which have less expressive than deep, multi-layer models. Furthermore, most operations like addition, matrix multiplications or factorization are handcrafted based on a few known relation patterns in several well-known datasets, such as FB15k, WN18, etc. However, due to the diversity and complex nature of real-world data distribution, it is inherently difficult to preset all latent patterns. To address this issue, we propose KGE-ANS, More >

Zhipeng Li^1,2, Shanshan Feng^3,*, Jun Shi², Yang Zhou², Yong Liao^1,2, Yangzhao Yang², Yangyang Li⁴, Nenghai Yu¹, Xun Shao⁵

Computer Systems Science and Engineering, Vol.44, No.3, pp. 2411-2423, 2023, DOI:10.32604/csse.2023.026823 - 01 August 2022

Abstract Accurate prediction of future events brings great benefits and reduces losses for society in many domains, such as civil unrest, pandemics, and crimes. Knowledge graph is a general language for describing and modeling complex systems. Different types of events continually occur, which are often related to historical and concurrent events. In this paper, we formalize the future event prediction as a temporal knowledge graph reasoning problem. Most existing studies either conduct reasoning on static knowledge graphs or assume knowledges graphs of all timestamps are available during the training process. As a result, they cannot effectively… More >

Jiaming Wang², Xiaolan Xie^1,2,*, Xiaochun Cheng³, Yuhan Wang²

Computer Systems Science and Engineering, Vol.43, No.3, pp. 997-1008, 2022, DOI:10.32604/csse.2022.027005 - 09 May 2022

Abstract

There is a large amount of information in the network data that we can exploit. It is difficult for classical community detection algorithms to handle network data with sparse topology. Representation learning of network data is usually paired with clustering algorithms to solve the community detection problem. Meanwhile, there is always an unpredictable distribution of class clusters output by graph representation learning. Therefore, we propose an improved density peak clustering algorithm (ILDPC) for the community detection problem, which improves the local density mechanism in the original algorithm and can better accommodate class clusters of different

… More >