Abstract
Clustering is an important data analyzing method in data mining. In this paper, we analyzed existing clustering algorithms and raised a new density-based grid clustering algorithm based on digital search tree (DST). We classified DST as a new kind of clustering method and gave out the construction algorithm of the region-density digital search tree (RD-DST) and its clustering algorithm. We then extended the algorithm to high-dimensional data space and analyzed the space and time complexities of the RD-DST based clustering algorithm. We further proved that the RD-DST based clustering algorithm only did grid division of the non-empty space in the high-dimensional data space. It lowers the number of the grid unit drastically and gain higher space and time efficiency.
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.
