K-Means and K-Medoids: Cluster Analysis on Birth Data Collected in City Muzaffarabad, Kashmir

Abstract

In the field of medical, each and every analysis is decisive as the study links to life of the subject under observation. One of the most vital area in the field of medical is the healthcare of expecting women in low income countries. High mortality rate due to increased number of caesarean section is evident because of poor medical infrastructure in the region, misunderstood religious teachings, low education and lack of proper decision making at the right time. The root cause analysis of situations demanding caesarean section is a tough job, however in the presence of historical data, one may extract useful information that will help supporting a medical decision by predicting the outcome. It is obvious that regional disparities have a huge impact on the residents of that region. A study performed on any region cannot be all applicable to the residents of some other distant region. This motive has established grounds to conduct a local study upon the data collected from expecting women in city Muzaffarabad, Kashmir. It is believed that the findings of this study will be significant for women that share more or less similar physical, social and maternal traits. Keeping this in mind, study presents an analysis of two clustering techniques for the investigation of appropriate algorithm that groups data into relevant clusters robustly. Firstly, we analyzed K-means and K-medoids algorithms' capability to cluster the data using different distance metrics. Secondly, data transformation techniques including scale, range and Yeo-Johnson are applied. Finally, transformed data are used in K-means and K-medoids algorithms' to generate cluster accuracy. It is observed that the results produced from transformed data are better than using raw data. Yeo-Johnson transformation method is found best for k-means (Hartigan & Wang), K-medoids (SEV distance function) and Rank k-medoids (SEV distance function) with mean accuracy 67.58%, 69.58% and 72.64% respectively.

Applying Simulation Optimization to Minimize Drug Inventory Costs: A Study of a Case Outpatient Pharmacy

“…In the second stage, this study used the K -means method to divide the data into four groups. The K -means clustering method has been applied to various domains because it is simple and easy to use [ 28 ]. The four groups were named according to the four indicators of each group of drugs (i.e., average monthly consumption, monthly drug consumption slope, absolute value of the monthly average deviation rate, and chronic disease prescription ratio).…”

Research on the Correlation between Multisource Big Data Virtual Assisted Preschool Education and the Development of Children’s Innovative Ability

“…After getting the list of frequent 1-itemsets, it is necessary to build a global FP-tree to obtain the conditional pattern basis of each item. When the data set is too large, the global FP-tree cannot fit into the memory [ 20 , 21 ]. Therefore, the parallelized method decomposes the data set into subsets, builds FP-tree on the data subset, which is called “local FP-tree”, and then calls the FP-growth method for the local FP-tree to recursively mine the local association rules.…”

Collision Detection Algorithm of Belt Grinding of the Blisk Based on Improved Octree Segmentation Method

“…In order to solve the many shortcomings caused by the above-mentioned traditional methods, this paper adopts the idea of "divide and conquer, overall optimization", and introduces the k-means clustering algorithm [16] to improve it, that is, firstly, perform appropriate point cloud classification of the individual blades of the Blisk, then perform the octree segmentation after classification respectively, finally, the result is stored in the corresponding data structure for subsequent collision detection.…”