{"title":"Unsupervised learning from attributed networks","authors":"Lazhar Labiod, Mohamed Nadif","doi":"10.1007/s11634-025-00641-w","DOIUrl":null,"url":null,"abstract":"<div><p>Unlike the plain network where only the topological structure is available, nodes of attributed networks possess rich attributed information. Thereby, the attributed networks ubiquitous in the real world have attracted much attention in recent years. In our paper, to simultaneously address both attributed network embedding and clustering, we propose a new model. It exploits both content and structure/topological information, capitalizing on their simultaneous use. The proposed model relies on the approximation of the relaxed continuous embedding solution by the true discrete clustering. Thus, we show that incorporating an embedding representation provides simpler and more interpretable solutions. Moreover, we show how our proposed approach is related to some other clustering and data embedding methods. To clearly establish various connections, we propose to distinguish two variants. Experimental results demonstrate that the proposed algorithm performs better, in terms of clustering and embedding, than the state-of-the-art algorithms, including deep learning methods dedicated to similar tasks for attributed network datasets.</p></div>","PeriodicalId":49270,"journal":{"name":"Advances in Data Analysis and Classification","volume":"20 :","pages":"167 - 196"},"PeriodicalIF":2.1000,"publicationDate":"2025-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Advances in Data Analysis and Classification","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s11634-025-00641-w","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"STATISTICS & PROBABILITY","Score":null,"Total":0}
引用次数: 0
Abstract
Unlike the plain network where only the topological structure is available, nodes of attributed networks possess rich attributed information. Thereby, the attributed networks ubiquitous in the real world have attracted much attention in recent years. In our paper, to simultaneously address both attributed network embedding and clustering, we propose a new model. It exploits both content and structure/topological information, capitalizing on their simultaneous use. The proposed model relies on the approximation of the relaxed continuous embedding solution by the true discrete clustering. Thus, we show that incorporating an embedding representation provides simpler and more interpretable solutions. Moreover, we show how our proposed approach is related to some other clustering and data embedding methods. To clearly establish various connections, we propose to distinguish two variants. Experimental results demonstrate that the proposed algorithm performs better, in terms of clustering and embedding, than the state-of-the-art algorithms, including deep learning methods dedicated to similar tasks for attributed network datasets.
期刊介绍:
The international journal Advances in Data Analysis and Classification (ADAC) is designed as a forum for high standard publications on research and applications concerning the extraction of knowable aspects from many types of data. It publishes articles on such topics as structural, quantitative, or statistical approaches for the analysis of data; advances in classification, clustering, and pattern recognition methods; strategies for modeling complex data and mining large data sets; methods for the extraction of knowledge from data, and applications of advanced methods in specific domains of practice. Articles illustrate how new domain-specific knowledge can be made available from data by skillful use of data analysis methods. The journal also publishes survey papers that outline, and illuminate the basic ideas and techniques of special approaches.