首页> 外文会议>International Conference on intelligent science and big data engineering >A Hybrid Approach Optimized by Tissue-Like P System for Clustering
【24h】

A Hybrid Approach Optimized by Tissue-Like P System for Clustering

机译:类组织P系统优化的混合聚类方法

获取原文

摘要

K-medoids algorithm is a classical algorithm used for clustering, it is developed from K-means algorithm and it is more robust compared to K-means algorithm for noises and outliers. But it takes more time to achieve a better result. In this paper, we proposed a hybrid algorithm to overcome the drawbacks. We combined K-means algorithm and an improved K-medoids algorithm together. Firstly, to have an elementary clustering results, we run K-means algorithm for the data set. Then, the improved K-medoids algorithm are used to optimize the results to make it more robust. Furthermore, we designed a Tissuelike P system for the proposed approach, the Tissue-like P system operates in a parallel way thus can improve time efficiency greatly. We tested the efficiency and effectiveness of our approach on some data sets of the well-known UCI benchmark and compared the approach with the K-means and the K-medoids algorithm.
机译:K-medoids算法是用于聚类的经典算法,它是从K-means算法发展而来的,与针对噪声和离群值的K-means算法相比,它更健壮。但是需要更多时间才能达到更好的结果。在本文中,我们提出了一种混合算法来克服这些缺点。我们将K-means算法和改进的K-medoids算法结合在一起。首先,为了获得基本的聚类结果,我们对数据集运行K-means算法。然后,使用改进的K-medoids算法对结果进行优化,使其更加健壮。此外,我们针对提出的方法设计了一个类似T组织的P系统,该类似T组织的P系统以并行方式运行,因此可以大大提高时间效率。我们在著名的UCI基准测试的一些数据集上测试了该方法的效率和有效性,并将该方法与K-means和K-medoids算法进行了比较。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号