Author:
Shalileh Soroosh,Mirkin Boris
Publisher
Springer International Publishing
Reference28 articles.
1. Arthur, D., Vassilvitskii, S.: K-means++: the advantages of careful seeding. In: Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1027–1035 (2006)
2. Bianchi, F., Grattarola, D., Alippi, C.: Spectral clustering with graph neural networks for graph pooling. In: International Conference on Machine Learning (PMLR), pp. 874–883, November 2020
3. Bojchevski, A., Günnemanz., S.: Bayesian robust attributed graph clustering: joint learning of partial anomalies and group structure. In: Thirty-Second AAAI Conference on Artificial Intelligence (2018)
4. Cavallari, S., Zheng, V.W., Cai, H., Chang, K.C., Cambria., E.: Learning community embedding with community detection and node embedding on graphs. In: Proceedings of the 2017 ACM Conference on Information and Knowledge Management, pp. 377–386. ACM (2017)
5. Chunaev, P.: Community detection in node-attributed social networks: a survey. Comput. Sci. Rev. 37, 100286 (2020)