{"title":"An integrated multi-attribute graph sequence clustering with fuzzy information granule and knowledge-guidance","authors":"Fang Li, Jingxian Ma, Xinran Cheng","doi":"10.1016/j.neucom.2025.130989","DOIUrl":null,"url":null,"abstract":"<div><div>Attribute graph sequence clustering is a type of vertex clustering that meets the needs of applications, like port scale clustering, which involves vertex attribute information and historical information. However, the existing methods explore such clustering tend to focus on only one of these aspects, missing opportunity for integrated analysis of data characteristics. To address this gap, our study introduces fuzzy information granule (FIG) to include as many vertices as possible while capturing multi-faceted information with precision, thereby enabling the integration of attribute information and historical information simultaneously. Based on these granular knowledges, two algorithms are raised to realize attribute graph sequence clustering, respectively for single-attribute graph sequence (Algorithm 1) and multi-attribute graph sequence (Algorithm 2). Algorithm 1 clusters single-attribute graph sequence employing FIG based fuzzy C-means algorithm, with the objects of FIGs. Leveraging the results of single-attribute clustering, Algorithm 2 extends to multi-attribute graph sequence clustering according to knowledge-guided idea. Ultimately, an accurate clustering result for multi-attribute graph sequence is ensured by considering the clustering result of each individual attribute. Worth noting that two novel proposed clustering algorithms achieve the clustering of attribute graph sequence successfully at application level, and also facilitate that of FIGs at methodological level. After comparing the proposed multi-attribute graph sequence clustering algorithm with six other algorithms on seven datasets, Algorithm 2 wins the highest clustering accuracy (CA) and adjusted rand index (ARI) values, and the smallest FIG-Index value, particularly with CA=0.88, ARI=0.62, and FIG‐Index=0.17 on a synthetic dataset. These results demonstrate that the newly proposed algorithm significantly outperforms other algorithms in clustering accuracy and robustness.</div></div>","PeriodicalId":19268,"journal":{"name":"Neurocomputing","volume":"651 ","pages":"Article 130989"},"PeriodicalIF":6.5000,"publicationDate":"2025-07-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Neurocomputing","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0925231225016613","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Attribute graph sequence clustering is a type of vertex clustering that meets the needs of applications, like port scale clustering, which involves vertex attribute information and historical information. However, the existing methods explore such clustering tend to focus on only one of these aspects, missing opportunity for integrated analysis of data characteristics. To address this gap, our study introduces fuzzy information granule (FIG) to include as many vertices as possible while capturing multi-faceted information with precision, thereby enabling the integration of attribute information and historical information simultaneously. Based on these granular knowledges, two algorithms are raised to realize attribute graph sequence clustering, respectively for single-attribute graph sequence (Algorithm 1) and multi-attribute graph sequence (Algorithm 2). Algorithm 1 clusters single-attribute graph sequence employing FIG based fuzzy C-means algorithm, with the objects of FIGs. Leveraging the results of single-attribute clustering, Algorithm 2 extends to multi-attribute graph sequence clustering according to knowledge-guided idea. Ultimately, an accurate clustering result for multi-attribute graph sequence is ensured by considering the clustering result of each individual attribute. Worth noting that two novel proposed clustering algorithms achieve the clustering of attribute graph sequence successfully at application level, and also facilitate that of FIGs at methodological level. After comparing the proposed multi-attribute graph sequence clustering algorithm with six other algorithms on seven datasets, Algorithm 2 wins the highest clustering accuracy (CA) and adjusted rand index (ARI) values, and the smallest FIG-Index value, particularly with CA=0.88, ARI=0.62, and FIG‐Index=0.17 on a synthetic dataset. These results demonstrate that the newly proposed algorithm significantly outperforms other algorithms in clustering accuracy and robustness.
属性图序列聚类是一种满足应用需求的顶点聚类,如端口规模聚类,涉及顶点属性信息和历史信息。然而,现有的聚类方法往往只关注其中的一个方面,而没有机会对数据特征进行综合分析。为了解决这一差距,本研究引入模糊信息颗粒(FIG),在精确捕获多面信息的同时,尽可能多地包含顶点,从而实现属性信息和历史信息的同时集成。基于这些颗粒知识,提出了两种实现属性图序列聚类的算法,分别针对单属性图序列(算法1)和多属性图序列(算法2)。算法1采用基于FIG的模糊c均值算法对单属性图序列进行聚类,以FIG中的对象为聚类对象。算法2利用单属性聚类的结果,根据知识引导思想,扩展到多属性图序列聚类。最后,通过考虑各个单独属性的聚类结果,保证了多属性图序列聚类结果的准确性。值得注意的是,本文提出的两种新的聚类算法在应用层面成功实现了属性图序列的聚类,并在方法层面促进了FIGs的聚类。将本文提出的多属性图序列聚类算法与其他6种算法在7个数据集上的聚类精度(CA)和调整后的rand index (ARI)值进行比较,算法2在合成数据集上的聚类精度(CA)和调整后的rand index (ARI)值最高,FIG- index值最小,特别是CA=0.88、ARI=0.62和FIG- index =0.17。结果表明,新算法在聚类精度和鲁棒性方面明显优于其他算法。
期刊介绍:
Neurocomputing publishes articles describing recent fundamental contributions in the field of neurocomputing. Neurocomputing theory, practice and applications are the essential topics being covered.