Author:
Bianchi Filippo Maria,Livi Lorenzo,Rizzi Antonello
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Computer Vision and Pattern Recognition
Reference43 articles.
1. Arthur D, Vassilvitskii S (2007) k-means++: the advantages of careful seeding. In: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms., SODA ’07Society for Industrial and Applied Mathematics, Philadelphia, PA, USA, pp 1027–1035
2. Bache K, Lichman M (2013) UCI Machine learning repository. http://archive.ics.uci.edu/ml
3. Bardaji I, Ferrer M, Sanfeliu A (2010) A comparison between two representatives of a set of graphs: median vs. barycenter graph. In: Proceedings of the 2010 joint IAPR international conference on Structural, syntactic, and statistical pattern recognition, SSPR&SPR’10. Springer, Berlin, pp 149–158
4. Bianchi FM, Livi L, Rizzi A, Sadeghian A (2014) A Granular Computing approach to the design of optimized graph classification systems. Soft Comput 18(2):393–412. doi: 10.1007/s00500-013-1065-z
5. Bulò SR, Pelillo M (2013) A game-theoretic approach to hypergraph clustering. IEEE Trans Pattern Anal Machine Intell 35(6):1312–1327
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献