Abstract
The traditional clustering algorithms are only suitable for the static datasets. As for the dynamic and incremental datasets, the clustering results will become unreliable after data updates, and also it will certainly decrease efficiency and waste computing resources to cluster all of the data again. To overcome these problems, a new incremental clustering algorithm is proposed on the basis of density and density-reachable. Theoretical analysis and experimental results demonstrate that the incremental algorithm can improve the efficiency of data resource utilization, and handle the dynamic datasets effectively.
Sign-in/Register to access full text options 
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.
