Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Computer Science Applications,Information Systems
Reference44 articles.
1. Aggarwal A, Deshpande A, Kannan R (2009) Adaptive sampling for k-means clustering. Approximation, randomization, and combinatorial optimization. Algorithms and techniques, APPROX-RANDOM. Springer, Berlin, pp 15–28
2. Aloise D, Deshpande A, Hansen P, Popat P (2009) NP-hardness of Euclidean sum-of-squares clustering. Mach Learn 75(2):245–248
3. Alon N, Duke RA, Lefmann H, Rödl V, Yuster R (1994) The algorithmic aspects of the regularity lemma. J Algorithms 16(1):80–109
4. Alon N, Naor A (2006) Approximating the cut-norm via Grothendieck’s inequality. SIAM J Comput 35(4):787–803
5. Arthur D, Vassilvitskii S (2007)
$$k$$
k
-means++: the advantages of careful seeding. In: Proceedings of the 18th annual ACM-SIAM symposium on discrete algorithms, SIAM, SODA ’07, pp 1027–1035
Cited by
52 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. General-purpose query processing on summary graphs;Social Network Analysis and Mining;2024-08-09
2. Node Embedding Preserving Graph Summarization;ACM Transactions on Knowledge Discovery from Data;2024-04-12
3. SsAG
: Summarization and Sparsification of Attributed Graphs;ACM Transactions on Knowledge Discovery from Data;2024-04-12
4. GTP-ViT: Efficient Vision Transformers via Graph-based Token Propagation;2024 IEEE/CVF Winter Conference on Applications of Computer Vision (WACV);2024-01-03
5. A Novel Approach for Extracting Summarized RDF Graph from Heterogeneous Corpus;2023 International Conference on Innovations in Intelligent Systems and Applications (INISTA);2023-09-20