Abstract

This study focuses on the summary data structure design and optimize the method of calculation of the mesh density and how to effectively deal with the problem of boundary points, combined with the sliding window mechanism and suggest improvements based on the mesh density of the data stream real-time clustering algorithm framework and the various parts of concrete realization of the algorithm.

Keywords:

Clustering algorithm, data stream, extension, grid,

References

Competing interests

The authors have no competing interests.

Open Access Policy

This article is distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Copyright

The authors have no competing interests.