论文标题
图形神经网络基于社交互联网的聚类
Graph Neural Networks-based Clustering for Social Internet of Things
论文作者
论文摘要
在本文中,我们提出了一个机器学习过程,用于将大规模社交互联网(SIOT)设备聚集到共享牢固关系的几组相关设备中。为此,我们基于物联网设备及其社会关系的历史数据集生成了无方向的加权图。使用这些图形的邻接矩阵和IoT设备的功能,我们使用图神经网络(GNN)嵌入了图形节点,以获得IoT设备的数值向量表示。向量表示不仅反映了设备的特征,还反映了其与同龄人的关系。然后将所获得的节点嵌入送入传统的无监督学习算法中,以相应地确定簇。我们使用两种众所周知的聚类算法展示了所获得的IoT组,特别是K-均值和基于密度的算法,用于发现簇(DBSCAN)。最后,我们将基于GNN的聚类方法和模块化的性能与确定性的Louvain社区检测算法的性能进行了比较,仅应用于不同关系创建的图表。结果表明,该框架在聚集大规模的物联网系统方面取得了有希望的初步结果。
In this paper, we propose a machine learning process for clustering large-scale social Internet-of-things (SIoT) devices into several groups of related devices sharing strong relations. To this end, we generate undirected weighted graphs based on the historical dataset of IoT devices and their social relations. Using the adjacency matrices of these graphs and the IoT devices' features, we embed the graphs' nodes using a Graph Neural Network (GNN) to obtain numerical vector representations of the IoT devices. The vector representation does not only reflect the characteristics of the device but also its relations with its peers. The obtained node embeddings are then fed to a conventional unsupervised learning algorithm to determine the clusters accordingly. We showcase the obtained IoT groups using two well-known clustering algorithms, specifically the K-means and the density-based algorithm for discovering clusters (DBSCAN). Finally, we compare the performances of the proposed GNN-based clustering approach in terms of coverage and modularity to those of the deterministic Louvain community detection algorithm applied solely on the graphs created from the different relations. It is shown that the framework achieves promising preliminary results in clustering large-scale IoT systems.