{"title":"使用密度指数增强的尺度不变密度聚类初始化算法检测基于密度变化的聚类数","authors":"Onapa Limwattanapibool, S. Arch-int","doi":"10.1109/ICITEED.2017.8250481","DOIUrl":null,"url":null,"abstract":"Despite high accuracy, K-means relies mainly on the determination of the suitable number of clusters. To cope with, it is hypothesized that in a dataset region with high density tends to be a cluster. The present study is based on Scaleinvariant density-based clustering initialization, in which a cluster numbers is derived from density change analysis or density distribution analysis. However, the density calculation under this approach is based on the number and volume of data, which may result in inaccuracy for cluster detection. Thus, the objective of this study was to improve the performance of Scaleinvariant density-based clustering initialization to detect the appropriate cluster numbers and initial cluster centers. We proposed a density calculation based on data distance. The density value obtained from the calculation was used as a condition of data division and data merging for cluster detection. According to the experiment, compared to the Scale invariant density-based clustering initialization, the proposed method could detect the cluster numbers and initial cluster centers more equal or closer to the actual number of clusters. In addition, the level of accuracy in clustering was higher than its counterpart.","PeriodicalId":267403,"journal":{"name":"2017 9th International Conference on Information Technology and Electrical Engineering (ICITEE)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Detecting cluster numbers based on density changes using density-index enhanced Scale-invariant density-based clustering initialization algorithm\",\"authors\":\"Onapa Limwattanapibool, S. Arch-int\",\"doi\":\"10.1109/ICITEED.2017.8250481\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Despite high accuracy, K-means relies mainly on the determination of the suitable number of clusters. To cope with, it is hypothesized that in a dataset region with high density tends to be a cluster. The present study is based on Scaleinvariant density-based clustering initialization, in which a cluster numbers is derived from density change analysis or density distribution analysis. However, the density calculation under this approach is based on the number and volume of data, which may result in inaccuracy for cluster detection. Thus, the objective of this study was to improve the performance of Scaleinvariant density-based clustering initialization to detect the appropriate cluster numbers and initial cluster centers. We proposed a density calculation based on data distance. The density value obtained from the calculation was used as a condition of data division and data merging for cluster detection. According to the experiment, compared to the Scale invariant density-based clustering initialization, the proposed method could detect the cluster numbers and initial cluster centers more equal or closer to the actual number of clusters. In addition, the level of accuracy in clustering was higher than its counterpart.\",\"PeriodicalId\":267403,\"journal\":{\"name\":\"2017 9th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"volume\":\"37 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 9th International Conference on Information Technology and Electrical Engineering (ICITEE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICITEED.2017.8250481\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 9th International Conference on Information Technology and Electrical Engineering (ICITEE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITEED.2017.8250481","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Detecting cluster numbers based on density changes using density-index enhanced Scale-invariant density-based clustering initialization algorithm
Despite high accuracy, K-means relies mainly on the determination of the suitable number of clusters. To cope with, it is hypothesized that in a dataset region with high density tends to be a cluster. The present study is based on Scaleinvariant density-based clustering initialization, in which a cluster numbers is derived from density change analysis or density distribution analysis. However, the density calculation under this approach is based on the number and volume of data, which may result in inaccuracy for cluster detection. Thus, the objective of this study was to improve the performance of Scaleinvariant density-based clustering initialization to detect the appropriate cluster numbers and initial cluster centers. We proposed a density calculation based on data distance. The density value obtained from the calculation was used as a condition of data division and data merging for cluster detection. According to the experiment, compared to the Scale invariant density-based clustering initialization, the proposed method could detect the cluster numbers and initial cluster centers more equal or closer to the actual number of clusters. In addition, the level of accuracy in clustering was higher than its counterpart.