Author:
Jaschek Tim,Bucyk Marko,Oberoi Jaspreet S.
Publisher
Springer International Publishing
Reference38 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. SIAM (2007)
2. Zhang, T., Ramakrishnan, R., Livny, M.: BIRCH: an efficient data clustering method for very large databases. In: ACM Sigmod Record, vol. 25, pp. 103–114. ACM (1996)
3. Ester, M., Kriegel, H.P., Sander, J., Xu, X., et al.: A density-based algorithm for discovering clusters in large spatial databases with noise. In: KDD, vol. 96, pp. 226–231 (1996)
4. Nayak, R., Mills, R., De-Vries, C., Geva, S.: Clustering and labeling a web scale document collection using Wikipedia clusters. In: Proceedings of the 5th International Workshop on Web-scale Knowledge Representation Retrieval & Reasoning, pp. 23–30. ACM (2014)
5. de Vries, C.M., de Vine, L., Geva, S., Nayak, R.: Parallel streaming signature EM-tree: a clustering algorithm for web scale applications. In: Proceedings of the 24th International Conference on World Wide Web, pp. 216–226. International World Wide Web Conferences Steering Committee (2015)
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献