Funder
National Natural Science Foundation of China
Publisher
Springer Science and Business Media LLC
Reference30 articles.
1. Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the 18th annual ACM-SIAM symposium discrete algorithms, ACM, pp 1027–1035
2. Boobalan MP, Lopez D, Gao XZ (2016) Graph clustering using k-neighbourhood attribute structural similarity. Appl Soft Comput 47:216–223
3. Cecile B, David CJ, Matteo M, Barbora M (2015) Clustering attributed graphs: models, measures and methods. Netw Sci 3(3):408–444
4. Cheng H, Zhou Y, Yu JX (2011) Clustering large attributed graphs: a balance between structural and attribute similarities. ACM Trans Knowl Discov D 5(2):1–33
5. Dai T, Zhu L, Cai XY, Pan SR, Yuan S (2018) Explore semantic topics and author communities for citation recommendation in bipartite bibliographic network. J Amb Intel Hum Comp 9:957–975
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献