Density-based clustering is famous for its ability to extract clusters of arbitrary shapes and to detect noise samples, but many existing density-based clustering algorithms suffer from high dimensional or varying density data. To address these issues, we introduce a novel density-based clustering algorithm, general ratio density (GRD). Based on k-NN graph, it combines global density estimation and local density estimation to better detect noise points in varying density situations. During the process of shifting noise points and dividing clusters, our clustering algorithm can cluster and denoise at the same time. Experiment results on real life dataset and synthetic dataset demonstrates the state-of-the-art performance of our algorithm compared to other methods.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.