【24h】

Robustness of DNA-Based Clustering

机译:基于DNA的聚类的鲁棒性

获取原文

摘要

The primary objective of clustering is to discover a structure in the data by forming some number of clusters or groups. In order to achieve optimal clustering results in current soft computing approaches, two fundamental questions should be considered; (i) how many clusters should be actually presented in the given data, and (ii) how real or good the clustering itself is. Based on these two fundamental questions, almost clustering method needs to determine the number of clusters . Yet, it is difficult to determine an optimal number of a cluster group should be obtained for each data set. Hence, DNA-based clustering algorithms were proposed to solve clustering problem without considering any preliminary parameters such as a number of clusters, iteration and, etc.. Because of the nature of processes between DNA-based solutions with a silicon-based solution, the evaluation of obtained results from DNA-based clustering is critical to be conducted. It is to ensure that the obtained results from this proposal can be accepted as well as other soft computing techniques. Thus, this study proposes two different techniques to evaluate the DNA-based clustering algorithms either it can be accepted as other soft computing techniques or the results that obtained from DNA-based clustering are not reliable for employed.
机译:聚类的主要目标是通过形成一些数量的簇或组来发现数据中的结构。为了实现当前软计算方法的最佳聚类,应考虑两个基本问题; (i)在给定的数据中实际应呈现多少个群集,并且(ii)聚类本身是多么真实或良好。基于这两个基本问题,几乎聚类方法需要确定群集的数量。然而,对于每个数据集,难以确定应获得群集组的最佳数量。因此,提出了基于DNA的聚类算法来解决聚类问题,而不考虑任何初步参数,例如许多簇,迭代和等。由于基于DNA的解决方案与基于硅的解决方案之间的过程的性质,因此评价DNA基聚类得到的结果是至关重要的。它是确保可以接受该提案的获得结果以及其他软计算技术。因此,本研究提出了两种不同的技术来评估基于DNA的聚类算法,可以被接受为其他软计算技术或从基于DNA的聚类获得的结果不可靠。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号