首页> 外文期刊>Mathematical Problems in Engineering >A Density Peak Clustering Algorithm Based on the K-Nearest Shannon Entropy and Tissue-Like P System
【24h】

A Density Peak Clustering Algorithm Based on the K-Nearest Shannon Entropy and Tissue-Like P System

机译:一种基于K到最近的Shannon熵和组织样P系统的密度峰值聚类算法

获取原文
获取原文并翻译 | 示例
           

摘要

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.
机译:本研究提出了一种新的方法来计算基于K-CORMETT邻居和Shannon熵的数据点密度。引入了具有活性膜的组织样P系统的变体以实现聚类过程。组织类似的组织P系统的新变体可以提高算法的效率并降低计算复杂性。最后,对合成和实世界数据集的实验结果表明,新方法比其他最先进的聚类方法更有效。

著录项

  • 来源
    《Mathematical Problems in Engineering》 |2019年第17期|1713801.1-1713801.13|共13页
  • 作者单位

    Shandong Normal Univ Business Sch Jinan Shandong Peoples R China;

    Shandong Normal Univ Business Sch Jinan Shandong Peoples R China;

    Univ Texas San Antonio Business Sch San Antonio TX USA;

  • 收录信息
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号