首页> 外文会议>International Conference on Data Science, Machine Learning and Applications >Study of K-Means Clustering Algorithm for Identification of Dengue Fever Hotspots
【24h】

Study of K-Means Clustering Algorithm for Identification of Dengue Fever Hotspots

机译:识别登革热热点地区的K-Means聚类算法研究

获取原文

摘要

In India, several dengue outbreaks were reported like 2015 dengue outbreaks, increasing the need for control and prevention of such outbreaks. Cluster analysis is one of the most extensively used statistical data analysis due to its extensive use in machine learning. Clustering techniques can be integrated to determine potential real-world areas of infectious diseases. This paper presents the application of K-means in disease surveillance. K-means is one of the least difficult unsupervised learning calculations. It groups the dataset through a specific number of clusters. The primary thought is characterized k-centroids, one for each cluster. In India, several dengue outbreaks were reported like 2015 dengue outbreaks, thereby increasing the need for control and prevention of such outbreaks. This paper presents an experimental evaluation of the effectiveness of K-means using data of reported Dengue Fever (DF) which was maintained in the Health Department of Municipal Corporation of Delhi (MCD). A total of 4713 cases were seen in years 2011, 2012 and 2013. The paper successfully detected hotspots of DF and calculated the Silhouette coefficients to validate the clusters.
机译:在印度,据报道有几次登革热暴发,例如2015年的登革热暴发,增加了控制和预防此类暴发的必要性。聚类分析由于在机器学习中的广泛使用而成为最广泛使用的统计数据分析之一。可以集成聚类技术来确定潜在的现实世界中的传染病区域。本文介绍了K-means在疾病监测中的应用。 K均值是最困难的无监督学习计算之一。它通过特定数量的聚类对数据集进行分组。主要思想是表征k重心,每个群集一个。在印度,据报道有几次登革热暴发,例如2015年的登革热暴发,从而增加了控制和预防此类暴发的必要性。本文使用报告的登革热(DF)数据对K均值的有效性进行了实验评估,该数据由德里市政府卫生局(MCD)维护。在2011年,2012年和2013年共发现4713例病例。该论文成功地检测了DF热点,并计算了Silhouette系数以验证聚类。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号