Journal
ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH
Volume 36, Issue 1, Pages -Publisher
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S0217595919500064
Keywords
k-Means clustering; coreset; streaming; approximation algorithm
Categories
Funding
- Scientific Research Foundation for the Returned Overseas Chinese Scholars, State Education Ministry
- Higher Educational Science and Technology Program of Shandong Province [J15LN22]
- Natural Science Foundation of China [11531014, 11871081]
Ask authors/readers for more resources
For computing the k-means clustering of the streaming and distributed big sparse data, we present an algorithm to obtain the sparse coreset for the k-means in polynomial time. This algorithm is mainly based on the explicit form of the center of mass and the approximate k-means. Because of the existence of the approximation, the coreset of the output inevitably has a factor, which can be controlled to be a very small constant.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available