Jurnal Gaussian · 2019 · 17 citations · 4 references
ComputingData ScienceComputational GeometryData MiningSpatial Data AnalysisClustered Data AnalysisDocument ClusteringSpatial Cluster AnalysisSpatial ClusteringCluster AnalysisCluster ClassificationCluster SimilarityCluster-based Outlier DetectionClusteringCrime ClusteringDistance MeasuresK-means Clustering
The k-medoids method is a non-hierarchical clustering to classify n object into k clusters that have the same characteristics. This clustering algorithm uses the medoid as its cluster center. Medoid is the most centrally located object in a cluster, so it’s robust to outliers. In cluster analysis the objects are grouped by the similarity. To measure the similarity, it can be used distance measures, euclidean distance and cityblock distance. The distance that is used in cluster analysis can affect the clustering results. Then, to determine the quality of the clustering results can be used the internal criteria with silhouette width and C-index. In this research the k-medoids method to classify of regencies/cities in Central Java based on type and number of crimes. The optimal cluster at k= 4 use euclidean distance, where the silhouette index= 0,3862593 and C-index= 0,043893. Keywords: Clustering, k-Medoids, Euclidean distance, Cityblock distance, Silhouette index, C-index, Crime
4
Multivariate Data Analysis (Seventh Edition)
Joseph F. Hair, William C. Black, Barry J. Babin et al. · 2010 · 769 citations
Analisis statistika multivariat terapan
Agus Widarjono · 2010 · 188 citations