Yingchao Li^1,*, Jianbin Wang¹, Haibin Wang²

Energy Engineering, Vol.121, No.4, pp. 1049-1065, 2024, DOI:10.32604/ee.2023.045228

Abstract With the increasing demand for electrical services, wind farm layout optimization has been one of the biggest challenges that we have to deal with. Despite the promising performance of the heuristic algorithm on the route network design problem, the expressive capability and search performance of the algorithm on multi-objective problems remain unexplored. In this paper, the wind farm layout optimization problem is defined. Then, a multi-objective algorithm based on Graph Neural Network (GNN) and Variable Neighborhood Search (VNS) algorithm is proposed. GNN provides the basis representations for the following search algorithm so that the expressiveness and search accuracy of the… More >

Shihu Liu, Chunsheng Yang^*, Yingjie Liu

Intelligent Automation & Soft Computing, Vol.38, No.3, pp. 203-223, 2023, DOI:10.32604/iasc.2023.040818

Abstract Many network presentation learning algorithms (NPLA) have originated from the process of the random walk between nodes in recent years. Despite these algorithms can obtain great embedding results, there may be also some limitations. For instance, only the structural information of nodes is considered when these kinds of algorithms are constructed. Aiming at this issue, a label and community information-based network presentation learning algorithm (LC-NPLA) is proposed in this paper. First of all, by using the community information and the label information of nodes, the first-order neighbors of nodes are reconstructed. In the next, the random walk strategy is improved… 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

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 integrates adaptive embedding mechanisms for… More >

Sufen Zhao^1,2, Rong Peng^1,*, Po Hu², Liansheng Tan²

CMES-Computer Modeling in Engineering & Sciences, Vol.137, No.1, pp. 83-130, 2023, DOI:10.32604/cmes.2023.024781

Abstract Real-world complex networks are inherently heterogeneous; they have different types of nodes, attributes, and relationships. In recent years, various methods have been proposed to automatically learn how to encode the structural and semantic information contained in heterogeneous information networks (HINs) into low-dimensional embeddings; this task is called heterogeneous network embedding (HNE). Efficient HNE techniques can benefit various HIN-based machine learning tasks such as node classification, recommender systems, and information retrieval. Here, we provide a comprehensive survey of key advancements in the area of HNE. First, we define an encoder-decoder-based HNE model taxonomy. Then, we systematically overview, compare, and summarize various… More > Graphic Abstract

Dongming Chen, Mingshuo Nie, Jie Wang, Dongqi Wang^*

Computer Systems Science and Engineering, Vol.46, No.3, pp. 2809-2820, 2023, DOI:10.32604/csse.2023.035494

Abstract Complex systems in the real world often can be modeled as network structures, and community discovery algorithms for complex networks enable researchers to understand the internal structure and implicit information of networks. Existing community discovery algorithms are usually designed for single-layer networks or single-interaction relationships and do not consider the attribute information of nodes. However, many real-world networks consist of multiple types of nodes and edges, and there may be rich semantic information on nodes and edges. The methods for single-layer networks cannot effectively tackle multi-layer information, multi-relationship information, and attribute information. This paper proposes a community discovery algorithm based… More >

Zibo Wang^1,3, Chaobin Huo², Yaofang Zhang^1,3, Shengtao Cheng^1,3, Yilu Chen^1,3, Xiaojie Wei⁵, Chao Li⁴, Bailing Wang^1,3,*

CMC-Computers, Materials & Continua, Vol.75, No.2, pp. 2957-2979, 2023, DOI:10.32604/cmc.2023.035694

Abstract With the growing discovery of exposed vulnerabilities in the Industrial Control Components (ICCs), identification of the exploitable ones is urgent for Industrial Control System (ICS) administrators to proactively forecast potential threats. However, it is not a trivial task due to the complexity of the multi-source heterogeneous data and the lack of automatic analysis methods. To address these challenges, we propose an exploitability reasoning method based on the ICC-Vulnerability Knowledge Graph (KG) in which relation paths contain abundant potential evidence to support the reasoning. The reasoning task in this work refers to determining whether a specific relation is valid between an… More >

Leilei Li¹, Yansheng Fu², Dongjie Zhu^2,*, Xiaofang Li³, Yundong Sun², Jianrui Ding², Mingrui Wu², Ning Cao^4,*, Russell Higgs⁵

Intelligent Automation & Soft Computing, Vol.36, No.3, pp. 3295-3307, 2023, DOI:10.32604/iasc.2023.035257

Abstract The knowledge graph with relational abundant information has been widely used as the basic data support for the retrieval platforms. Image and text descriptions added to the knowledge graph enrich the node information, which accounts for the advantage of the multi-modal knowledge graph. In the field of cross-modal retrieval platforms, multi-modal knowledge graphs can help to improve retrieval accuracy and efficiency because of the abundant relational information provided by knowledge graphs. The representation learning method is significant to the application of multi-modal knowledge graphs. This paper proposes a distributed collaborative vector retrieval platform (DCRL-KG) using the multimodal knowledge graph VisualSem… 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

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, a novel knowledge graph embedding… 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

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 reason over temporal knowledge graphs… 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

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 shapes. And we study the… More >