Density peaks clustering (DPC) is a new algorithm based on density in clustering analysis. The algorithm considers local density and relative distance to draw the decision graph, quickly identify cluster centers, and complete clustering. The DPC has a unique input parameter and requires no prior knowledge or iteration. Since it was proposed in 2014, DPC has aroused great interest among scholars and developed rapidly. The paper first introduces the advantages and disadvantages of DPC and its basic theory. Secondly, we analyze the DPC optimization method from four perspectives. Then, five improved algorithms of DPC are introduced, and experiments on DPC and these improved algorithms are carried out in synthetic datasets and real-world datasets to evaluate the performance of these algorithms.
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.