{"title":"An automatic clustering method based on distance evaluation function","authors":"Zhou Hong-bo, Gao Jun-tao","doi":"10.1109/IWECA.2014.6845701","DOIUrl":null,"url":null,"abstract":"In spatial clustering, the key factor to solve the problem of optimal class number is to construct a proper cluster validity function. The value of k must be confirmed in advance to exert K-means algorithm. However, it can not be clearly and easily confirmed in fact for its uncertainty. This paper recommends a distance evaluation function based on Euclidean distance to confirm the optimal class number, designs a new optimization algorithm of k value. The experiential rule which is usually expressed as kmax n is theoretically proved to be reasonable. Results come from the example also show the validity of this new algorithm.","PeriodicalId":383024,"journal":{"name":"2014 IEEE Workshop on Electronics, Computer and Applications","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 IEEE Workshop on Electronics, Computer and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWECA.2014.6845701","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In spatial clustering, the key factor to solve the problem of optimal class number is to construct a proper cluster validity function. The value of k must be confirmed in advance to exert K-means algorithm. However, it can not be clearly and easily confirmed in fact for its uncertainty. This paper recommends a distance evaluation function based on Euclidean distance to confirm the optimal class number, designs a new optimization algorithm of k value. The experiential rule which is usually expressed as kmax n is theoretically proved to be reasonable. Results come from the example also show the validity of this new algorithm.