Penerapan Algoritma K-Medoids dalam Menentukan Daerah Rawan Banjir di Kabupaten Karawang

Flood disasters often occur during the rainy season. Karawang is one area that is often flooded. Based on the risk index from BNPB, the flood disaster in Karawang affected 84% of the community, so efforts need to be made to reduce and overcome flood disasters. These problems are the beginning of efforts that need to be known which areas are prone to flooding. Therefore, this study aims to determine flood-prone areas in Karawang as an initial effort in tackling flood disasters. The research was conducted by classifying flood-prone areas using the k-medoids algorithm. K-Medoids uses the partition clustering method to group lists and objects into a number of clusters. This algorithm uses objects in a collection of objects that represent a cluster. The attributes used are flood-causing factors such as rainfall, elevation (soil height), population density, and distance to the river. The results of the study found three potential floods, namely low, medium, and high. There are 1 sub-district with low flood potential, 24 sub-districts with moderate flood potential, and 5 sub-districts with high flood potential. The test results using the silhouette coefficient get a value of 0.370.

Identifying Parkinson’s disease subtypes with motor and non-motor symptoms via model-based multi-partition clustering

Identification of Parkinson’s disease subtypes may help understand underlying disease mechanisms and provide personalized management. Although clustering methods have been previously used for subtyping, they have reported generic subtypes of limited relevance in real life practice because patients do not always fit into a single category. The aim of this study was to identify new subtypes assuming that patients could be grouped differently according to certain sets of related symptoms. To this purpose, a novel model-based multi-partition clustering method was applied on data from an international, multi-center, cross-sectional study of 402 Parkinson’s disease patients. Both motor and non-motor symptoms were considered. As a result, eight sets of related symptoms were identified. Each of them provided a different way to group patients: impulse control issues, overall non-motor symptoms, presence of dyskinesias and pyschosis, fatigue, axial symptoms and motor fluctuations, autonomic dysfunction, depression, and excessive sweating. Each of these groups could be seen as a subtype of the disease. Significant differences between subtypes (P< 0.01) were found in sex, age, age of onset, disease duration, Hoehn & Yahr stage, and treatment. Independent confirmation of these results could have implications for the clinical management of Parkinson’s disease patients.

Akurasi Pemberian Insentif Menggunakan Algoritma K-Medoids Terhadap Tingkat Kedisiplinan Pegawai

Assessment of a discipline is a performance evaluation stage that is important for the continuity of company activities. Monitoring and assessment of an employee's discipline must be carried out continuously in order to improve the quality of human resources. This research was conducted to make the accuracy of providing incentives based on the level of employee discipline. The data processed in this study is a recapitulation of the attendance of AMIK and STIKOM Tunas Bangsa Pematangsiantar employees as many as 25 employees as a sample. For grouping the employee data using the K-Medoids Algorithm. K-Medoids groups a set of n objects into a number of k clusters using the partition clustering method. Furthermore, the employee data is processed using Rapid Miner software. Research using this method obtained results in the form of grouping employees into 3 groups that have good discipline levels of 12 employees, sufficient discipline levels of 8 employees, and less disciplinary levels of 5 employees. Based on the grouping results that have been produced, it can be a consideration for the leadership to determine the amount of incentives for employees.

Identifying Parkinson’s disease subtypes with motor and non-motor symptoms via model-based multi-partition clustering

Identification of Parkinson’s disease subtypes may help understand underlying disease mechanisms and provide personalized management. Although clustering methods have been previously used for subtyping, they have reported generic subtypes of limited relevance in real life practice because patients do not always fit into a single category. The aim of this study was to identify new subtypes assuming that patients could be grouped differently according to certain sets of related symptoms. To this purpose, a novel model-based multi-partition clustering method was applied on data from an international, multi-center, cross-sectional study of 402 Parkinson’s disease patients. Both motor and non-motor symptoms were considered. As a result, eight sets of related symptoms were identified. Each of them provided a different way to group patients: impulse control issues, overall non-motor symptoms, presence of dyskinesias and pyschosis, fatigue, axial symptoms and motor fluctuations, autonomic dysfunction, depression, and excessive sweating. Each of these groups could be seen as a subtype of the disease. Significant differences between subtypes (p < 0.01) were found in sex, age, age of onset, disease duration, and Hoehn & Yahr stage. Independent confirmation of these results could have implications for the clinical management of Parkinson’s disease patients.

A Comprehensive Study on the Importance of the Elbow and the Silhouette Metrics in Cluster Count Prediction for Partition Cluster Models

Proper selection of cluster count gives better clustering results in partition models. Partition clustering methods are very simple as well as efficient. Kmeans and its modified versions are very efficient cluster models and the results are very sensitive to the chosen K value. The partition clustering algorithms are more suitable in applications where the data are arranged in a uniform manner. This work aims to evaluate the importance of assigning cluster count value in order to improve the efficiency of partition clustering algorithms using two well known statistical methods, the Elbow method and the Silhouette method. The performance of the Silhouette method and Elbow method are compared with different data sets from the UCI data repository. The values obtained using these methods are compared with the results of cluster performance obtained using the statistical analysis tool Weka on the selected data sets. Performance was evaluated on cluster efficiency for small and large data sets by varying the cluster count values. Similar results obtained from the three methods, the Elbow method, the Silhouette method and the clustering by Weka. It was also observed that the fast reduction in clustering efficiency for small changes in cluster count when the cluster count is small.

Analisis Clustering Virus MERS-CoV Menggunakan Metode Spectral Clustering Dan Algoritma K-Means

<p><em>The MERS-Cov virus has spread to other countries outside Saudi Arabia. This is because the MERS-CoV virus can mutate rapidly so it is feared that it could threaten public health and even world health. This virus develops and becomes an acute respiratory disease and the mortality rate reaches 30% among 536 cases. One way to classify the MERS-CoV virus is by grouping the DNA sequences of the MERS-CoV virus which have similar characteristics and functions. Spectral clustering is a grouping method that can identify DNA gene expression. This method is also able to partition DNA data with a more complex structure than the partition clustering method. The purpose of this study was to analyze the MERS-CoV virus clustering using the spectral clustering method and the k-means algorithm. This study used a quantitative descriptive literature approach. The results showed that the results of clustering using the spectral clustering method and the k-means algorithm produced three clusters and were more homogeneous than clustering using k-means only.</em></p>

AN EFFICIENTFUZZY C-MEANS CLUSTERING ALGORITHM FOR MULTI-VALUED DATA SETS

In data analysis, items were mostly described by a set of characteristics called features, in which each feature contains only single value for each object. Even so, in existence, some features may include more than one value, such as a person with different job descriptions, activities, phone numbers, skills and different mailing addresses. Such features may be called as multi-valued features, and are mostly classified as null features while analyzing the data using machine learning and data mining techniques. In this paper, it is proposed a proximity function to be described between two substances with multi-valued features that are put into effect for clustering.The suggested distance approach allows iterative measurements of the similarities around objects as well as their characteristics. For facilitating the most suitable multi-valued factors, we put forward a model targeting at determining each factor’s relative prominence for diverse data extracting problems. The proposed algorithm is a partition clustering strategy that uses fuzzy c- means clustering for evolutions, which is using the novel member ship function by utilizing the proposed similarity measure. The proposed clustering algorithm as fuzzy c- means based Clustering of Multivalued Attribute Data (FCM-MVA).Therefore this becomes feasible using any mechanisms for cluster analysis to group similar data. The findings demonstrate that our test not only improves the performance the traditional measure of similarity but also outperforms other clustering algorithms on the multi-valued clustering framework.

Evaluation of product of two sigmoidal membership functions (psigmf) as an ANFIS membership function for prediction of nanofluid temperature

A nanofluid containing water and nanoparticles made of copper (Cu) inside a cavity with square shape is simulated utilizing the computational fluid dynamics (CFD) approach. The nanoparticles made up 15% of the nanofluid. By performing the simulation, the CFD output is characterized by the coordinates in the x, y, nanofluid temperature, and velocity in the y-direction that these outputs are obtained for different physical time iterations. Moreover, the CFD outputs are examined by one of the artificial techniques, i.e. adaptive network-based fuzzy inference system (ANFIS). For this purpose, the data was clustered via grid partition clustering, and the type of membership functions (MFs) was chosen product of two sigmoidal membership functions (psigmf). After reaching 99.9% of intelligence in ANFIS, the nanofluid temperature is predicted for the entire data, which are included in the learning processes. The results showed that the method of ANFIS can predict the thermal properties in different physical times at different computing points without having a training background at those times. Additionally, this study shows that with three membership functions at each input, the model’s accuracy is higher than four functions.