Deep Attentional Implanted Graph Clustering Algorithm for the Visualization and Analysis of Social Networks

Abstract

As the user base expands, social network data becomes more intricate, making analyzing the interconnections between various entities challenging. Various graph visualization technologies are employed to analyze extensive and intricate network data. Network graphs inherently possess intricacy and may have overlapping elements. Graph clustering is a basic endeavor that aims to identify communities or groupings inside networks. Recent research has mostly concentrated on developing deep learning techniques to acquire a concise representation of graphs, which is then utilized with traditional clustering methods such as k-means or spectral clustering techniques. Multiplying these two-step architectures is challenging and sometimes results in unsatisfactory performance. This is mostly due to the lack of a goal-oriented graph encoding developed explicitly for the clustering job. This work introduces a novel Deep Learning (DL) method called Deep Attentional Implanted Graph Clustering (DAIGC), designed to achieve goal-oriented clustering. Our approach centers on associated graphs to thoroughly investigate both aspects of data in graphs. The proposed DAIGC technique utilizes a Graph Attention Autoencoder (GAA) to determine the significance of nearby nodes about a target node. This allows encoding a graph's topographical structure and node value into a concise representation. Based on this representation, an interior product decoder has been trained to rebuild the graph structure. The performance of the proposed approach has been evaluated on four distinct types and sizes of real-world intricate networks, varying in vertex count from 𝑁=102 𝑡𝑜 𝑁=107. The performance of the suggested methods is evaluated by comparing them with two established and commonly used graph clustering techniques. The testing findings demonstrate the effectiveness of the proposed method in terms of processing speed and visualization compared to the state-of-the-art algorithms.