首页> 外文期刊>Cybernetics and Systems Analysis >DISCRETE PERFECT SETS AND THEIR APPLICATION IN CLUSTER ANALYSIS
【24h】

DISCRETE PERFECT SETS AND THEIR APPLICATION IN CLUSTER ANALYSIS

机译:离散完美集及其在聚类分析中的应用

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

摘要

A formalization of the fuzzy concept of a cluster is investigated within the framework of discrete mathematical analysis. Based on the so-called discrete perfect sets, an attempt is made to mathematically realize the heuristic Everitt definition. Discrete perfect sets (DPSs) are considered and a DPS algorithm is constructed on their basis. The algorithm filters the original space by singling out its densest subset against a general background.
机译:在离散数学分析的框架内研究了聚类的模糊概念的形式化。基于所谓的离散完美集,尝试以数学方式实现启发式Everitt定义。考虑离散完美集(DPS),并在其基础上构造DPS算法。该算法通过在一般背景下挑选出最密集的子集来过滤原始空间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号