Search Results for author:
Found 3 papers, 1 papers with code
K-means for Evolving Data Streams
In this paper, we formally define the Streaming $K$-means(S$K$M) problem, which implies a restart of the error function when a concept drift occurs.
An efficient K -means clustering algorithm for massive data
The analysis of continously larger datasets is a task of major importance in a wide variety of scientific fields.
An efficient K-means algorithm for Massive Data
Due to the progressive growth of the amount of data available in a wide variety of scientific fields, it has become more difficult to ma- nipulate and analyze such information.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
