【24h】

Orthogonal Clustering

机译:正交聚类

获取原文

摘要

Often there are several logical criteria for clustering data. If all such clusterings are to be elicited for the purposes of cluster analysis it is typically necessary to use more than one algorithm. We have developed a novel clustering algorithm that uses a clustering generated by a previous pass of the algorithm as an additional feature to be optimized. The result is a new clustering that is distinct from the original clustering. Our method is analogous to boosting, except that where boosting converges, using a collection of models to form a single model, our method diverges, using a single model to generate one or more new models. We present experimental results using both synthetic data of our own design and real-world data found in the literature.
机译:通常有几个逻辑标准进行聚类数据。如果出于集群分析的目的引发所有此类群集,通常需要使用多种算法。我们开发了一种新的聚类算法,它使用算法的先前传递生成的群集作为要优化的附加功能。结果是一种与原始群集不同的新群集。我们的方法类似于提升,除了在升高收敛的情况下,使用模型的集合来形成单个模型,我们的方法发散,使用单个模型来生成一个或多个新模型。我们使用在文献中发现的我们自己的设计和现实世界数据的合成数据呈现实验结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号