A density peak clustering algorithm based on the K-nearest Shannon entropy and tissue-like P system

DOI10.1155/2019/1713801MaRDI QIDQ2298115zbMATH OpenOpenAlexFDO

Authors Zhenni Jiang, Xiyu Liu, Minghe Sun

Publication date 20 February 2020

Published in Mathematical Problems in Engineering (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.1155/2019/1713801

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)

Review text

Summary: This study proposes a novel method to calculate the density of the data points based on K-nearest neighbors and Shannon entropy. A variant of tissue-like P systems with active membranes is introduced to realize the clustering process. The new variant of tissue-like P systems can improve the efficiency of the algorithm and reduce the computation complexity. Finally, experimental results on synthetic and real-world datasets show that the new method is more effective than the other state-of-the-art clustering methods.

Recommendations

• Density peak clustering algorithm based on shared reverse nearest neighbors and exponential kernels
• scientific article; zbMATH DE number 7108734
• Optimized density peaks clustering algorithm based on dissimilarity measure

Cites work

• A quick introduction to membrane computing
• An unsupervised learning algorithm for membrane computing
• scientific article; zbMATH DE number 6531196 (Why is no real title available?)
• Tissue-like P systems with evolutional symport/antiport rules

Describes a project that uses

Uses Software

• UCI

This page was built for publication: A density peak clustering algorithm based on the K-nearest Shannon entropy and tissue-like P system

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2298115)