A comprehensive survey of fast graph clustering
Vicinagearth · 13.09.2024 · 1 (1)
DOI: 10.1007/s44336-024-00008-3 ↗Kurz gefasst
Fachartikel in der Zeitschrift Vicinagearth, online erschienen am 13.09.2024. Verfasst von Jingjing Xue und 7 weiteren Autor:innen. Die Arbeit wurde bisher 12-mal zitiert (Crossref) und nennt 195 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Innovative Research Group Project of the National Natural Science Foundation of China.
Abstract (Originalsprache)
Graph clustering methods are popular due to their ability to discover clusters with arbitrary shapes. However, with the emergence of large-scale datasets, the efficiency of graph clustering algorithms has become a significant concern. As a result, many researchers have been drawn to the field of fast graph clustering algorithms, leading to rapid and intricate advancements in related research. Nevertheless, there is currently no comprehensive survey available for fast graph clustering algorithms. To address this gap, we review these fast graph clustering models in both single and multi-view fields, categorizing them based on different properties and analyzing their advantages and disadvantages. In the single-view field, the main categories we explore include large graph methods and bipartite graph methods. The former includes graph cut and graph density methods, while the latter includes graph cut, co-clustering, and label transmission methods. For the multi-view field, the main categories also include large graph methods and bipartite graph methods. The former is specifically designed to avoid the eigenvalue decomposition of graph cut models, and the latter focuses on accelerating algorithms by integrating anchor points. Towards the conclusion of this paper, we discuss the challenges and provide several further research directions for fast graph clustering.
Förderung
- Innovative Research Group Project of the National Natural Science Foundation of China
Zitieren
APA
Xue, J., Xing, L., Wang, Y., Fan, X., Kong, L., Zhang, Q., Nie, F., & Li, X. (2024). A comprehensive survey of fast graph clustering. Vicinagearth, 1(1). https://doi.org/10.1007/s44336-024-00008-3
Vancouver
Xue J, Xing L, Wang Y, Fan X, Kong L, Zhang Q, et al. A comprehensive survey of fast graph clustering. Vicinagearth. 2024;1(1). doi:10.1007/s44336-024-00008-3
BibTeX
@article{Xue2024,
author = {Xue, Jingjing and Xing, Liyin and Wang, Yuting and Fan, Xinyi and Kong, Lingyi and Zhang, Qi and Nie, Feiping and Li, Xuelong},
title = {A comprehensive survey of fast graph clustering},
journal = {Vicinagearth},
year = {2024},
volume = {1},
number = {1},
doi = {10.1007/s44336-024-00008-3}
}
EUVIMED