首页> 外文OA文献 >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

【2h】

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

机译：初始簇质心的确定是否提高了K-Means聚类算法的性能？应用研究中遗传算法，最小生成树和分层聚类的三种混合方法的比较

代理获取

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

页面导航

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

著录项

作者
Saeedeh Pourahmad; Atefeh Basirat; Amir Rahimi; Marziyeh Doostfatemeh;
展开▼
作者单位

展开▼
年度 2020
总页数
原文格式 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. Genetic Algorithm Based Dimensionality Reduction for Improving Performance of K-Means Clustering: A Case Study for Categorization of Medical Dataset [J] . Asha Gowda Karegowda, Vidya T. Shama, M.A. Jayaram, International journal of soft computing . 2012,第5期

机译：基于遗传算法的降维方法提高K-Means聚类性能：以医学数据集分类为例
3. Genetic Algorithm Based Dimensionality Reduction for Improving Performance of K-Means Clustering: A Case Study for Categorization of Medical Dataset [J] . Asha Gowda Karegowda, Vidya T. Shama, M.A. Jayaram, International journal of soft computing . 2012,第5期

机译：基于遗传算法的降维方法提高K-Means聚类性能：以医学数据集分类为例
4. Improving Performance of K-Means Clustering by Initializing Cluster Centers Using Genetic Algorithm and Entropy Based Fuzzy Clustering for Categorization of Diabetic Patients [C] . Asha Gowda Karegowda, Vidya T., Shama, International Conference on Advances in Computing . 2013

机译：利用基于遗传算法初始化群集中心和基于糖尿病患者的熵的模糊聚类来提高K-Means聚类的性能
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. Analysis of Building Electricity Use Pattern Using K-Means Clustering Algorithm by Determination of Better Initial Centroids and Number of Clusters [O] . 2019

机译：通过确定更好的初始质心和簇数使用K-Means聚类算法的建筑电力使用模式分析
8. K-Means Re-Clustering Algorithmic Options with Quantifiable Performance Comparisons [R] . Meyer, A. W., Paglieroni, D. W., Astaneh, C. 2002

机译：K-means通过可量化的性能比较重新聚类算法选项

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

著录项

引文网络

相似文献

相关主题

期刊订阅