首页> 外文OA文献 >A Novel Hybrid Clustering Algorithm Based on Minimum Spanning Tree of Natural Core Points

【2h】

A Novel Hybrid Clustering Algorithm Based on Minimum Spanning Tree of Natural Core Points

机译：一种基于自然核心点最小生成树的新型混合聚类算法

代理获取

本网站仅为用户提供外文OA文献查询和代理获取服务，本网站没有原文。下单后我们将采用程序或人工为您竭诚获取高质量的原文，但由于OA文献来源多样且变更频繁，仍可能出现获取不到、文献不完整或与标题不符等情况，如果获取不到我们将提供退款服务。请知悉。

页面导航

著录项
引文网络
相似文献
相关主题

著录项

作者
Jinlong Huang; Ru Xu; Dongdong Cheng; Sulan Zhang; Keke Shang;
展开▼
作者单位

展开▼
年度 2019
总页数
原文格式 PDF
正文语种
中图分类

相似文献

外文文献
中文文献
专利

1. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm, Minimum Spanning Tree, and Hierarchical Clustering in an Applied Study [J] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, Computational and mathematical methods in medicine . 2020,第1期

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法，最小生成树和分层聚类的三种混合方法的比较
2. Routing Algorithm based on Minimum Spanning Tree and Minimum Cost Flow for Hybrid Wireless-optical Broadband Access Network [J] . Zichun Le, Kaihua Suo, Minglei Fu, Journal of Optical Communications . 2012,第1期

机译：基于最小生成树和最小成本流的混合无线宽带接入网络路由算法
3. CciMST: A Clustering Algorithm Based on Minimum Spanning Tree and Cluster Centers [J] . Lv Xiaobo, Ma Yan, He Xiaofu, Mathematical Problems in Engineering . 2018,第PTa17期

机译：CciMST：一种基于最小生成树和聚类中心的聚类算法
4. Fast Minimum Spanning Tree Based Clustering Algorithms on Local Neighborhood Graph [C] . R. Jothi, Sraban Kumar Mohanty, Aparajita Ojha IAPR-TC-15 international workshop on graph-based representations in pattern recognition . 2015

机译：快速最小生成树的局部邻域图聚类算法
5. A minimum spanning tree based clustering algorithm for high throughput biological data. [D] . Pirim, Harun. 2011

机译：用于高通量生物数据的基于最小生成树的聚类算法。
6. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm Minimum Spanning Tree and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法最小生成树和分层聚类的三种混合方法的比较
7. Does Determination of Initial Cluster Centroids Improve the Performance of K-Means Clustering Algorithm? Comparison of Three Hybrid Methods by Genetic Algorithm, Minimum Spanning Tree, and Hierarchical Clustering in an Applied Study [O] . Saeedeh Pourahmad, Atefeh Basirat, Amir Rahimi, 2020

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法，最小生成树和分层聚类的三种混合方法的比较
8. Approximation Algorithm for the Generalized Minimum Spanning Tree Problem with Bounded Cluster Size. [R] . Pop, P. C., Kern, W., Still, G. 2001

机译：有界簇尺寸广义最小生成树问题的逼近算法。

A Novel Hybrid Clustering Algorithm Based on Minimum Spanning Tree of Natural Core Points

著录项

引文网络

相似文献

相关主题

期刊订阅