{"title":"Comparison of distance and dissimilarity measures for clustering data with mix attribute types","authors":"Hermawan Prasetyo, A. Purwarianti","doi":"10.1109/ICITACEE.2014.7065756","DOIUrl":null,"url":null,"abstract":"Clustering is one of the most popular methods in data mining. Many algorithms can be applied for data clustering with numeric or categorical attributes. However, most of data in the real world contain both numeric and categorical attributes. A clustering method which can be applied on attributes in mix types become important to handle the problem. K-prototypes algorithm is one of the algorithms which can deal for clustering data with mix attribute types. However, it has a drawback on its dissimilarity measure between categorical data. The selection of proper dissimilarity measure between categorical data is thus important to increase its performance. This paper compares distance and dissimilarity measures for clustering data with mix attribute types. We used the k-prototypes algorithm on UCI datasets, i.e. Echocardiogram, Hepatitis, and Zoo, to assign cluster membership of the objects. Silhouette index was employed to evaluate clustering results. The results show that Euclidean distance and Ratio on Mismatches dissimilarity are the best combination for clustering data with numeric and categorical attribute types, as it shown with average Silhouette index towards 1. As a result, to cluster data with mix attribute types, we propose to employ Euclidean distance and Ratio on Mismatches dissimilarity to be applied on k-prototypes algorithm.","PeriodicalId":404830,"journal":{"name":"2014 The 1st International Conference on Information Technology, Computer, and Electrical Engineering","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"13","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 The 1st International Conference on Information Technology, Computer, and Electrical Engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITACEE.2014.7065756","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 13
Abstract
Clustering is one of the most popular methods in data mining. Many algorithms can be applied for data clustering with numeric or categorical attributes. However, most of data in the real world contain both numeric and categorical attributes. A clustering method which can be applied on attributes in mix types become important to handle the problem. K-prototypes algorithm is one of the algorithms which can deal for clustering data with mix attribute types. However, it has a drawback on its dissimilarity measure between categorical data. The selection of proper dissimilarity measure between categorical data is thus important to increase its performance. This paper compares distance and dissimilarity measures for clustering data with mix attribute types. We used the k-prototypes algorithm on UCI datasets, i.e. Echocardiogram, Hepatitis, and Zoo, to assign cluster membership of the objects. Silhouette index was employed to evaluate clustering results. The results show that Euclidean distance and Ratio on Mismatches dissimilarity are the best combination for clustering data with numeric and categorical attribute types, as it shown with average Silhouette index towards 1. As a result, to cluster data with mix attribute types, we propose to employ Euclidean distance and Ratio on Mismatches dissimilarity to be applied on k-prototypes algorithm.
聚类是数据挖掘中最流行的方法之一。许多算法可以应用于具有数字或分类属性的数据聚类。然而,现实世界中的大多数数据都包含数值属性和分类属性。一种适用于混合类型属性的聚类方法对于解决这一问题至关重要。k -原型算法是一种处理混合属性类型数据聚类的算法。然而,它在分类数据之间的不相似度量上有一个缺点。因此,在分类数据之间选择合适的不相似度量对于提高分类数据的性能具有重要意义。本文比较了混合属性类型数据聚类的距离度量和不相似度量。我们在UCI数据集(即Echocardiogram, Hepatitis, and Zoo)上使用k-prototype算法来分配对象的聚类隶属度。采用剪影指数评价聚类结果。结果表明,对于数值和分类属性类型的聚类数据,欧几里得距离和错配不相似度比是最佳组合,剪影指数平均趋近于1。因此,为了对混合属性类型的数据进行聚类,我们提出将欧几里得距离和错配不相似率应用于k-原型算法。