Variance-based clustering for balanced clusters in growing datasets

0Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

k-Means is a very popular clustering algorithm. We modify its objective to achieve a clustering method which produces more balanced clusters. The proposal can be adapted in a framework where dataset keeps growing and number of clusters is decided within the algorithm to achieve balanced clustering. This is done without affecting the time complexity. Experimental results are in favor of the proposal.

Cite

CITATION STYLE

APA

Saini, D., Singh, M., & Sharma, I. (2016). Variance-based clustering for balanced clusters in growing datasets. In Advances in Intelligent Systems and Computing (Vol. 438, pp. 559–565). Springer Verlag. https://doi.org/10.1007/978-981-10-0767-5_58

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free