摘要: Relational learning has attracted more and attention in recent years due to its phenomenal impact various important applications which involve multi-type interrelated data objects, such as bioinformatics, citation analysis, epidemiology web analytics. However, the research on unsupervised relational is still limited preliminary. In this paper, we propose a general model, collective factorization related matrices, for clustering. The model applicable with structures. Under proposed specific distance function ‐ Euclidean function, derive novel spectral clustering algorithm, clustering, cluster objects simultaneously. algorithm iteratively embeds each type of into low dimensional spaces benefits from interactions among hidden structures different types objects. Extensive experiments demonstrate promise effectiveness algorithm.