Abstract
This paper introduced a density grid-based data stream clustering algorithm.Through the introduction of the "subject degree",the traditional density grid-based clustering algorithm for data stream was improved by taking the data points within the grid as the grid density,thereby resolving the problem of data points belonging to two classes in one grid as well as the treatment of boundary points.Therefore,not only the high efficiency of the grid-based algorithm was utilized,but also the clustering accuracy was raised significantly.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
