Yiming Huang, Di Wu, Yinshui He, N. Lv, Shanben Chen
{"title":"The selection of arc spectral line of interest based on improved K-medoids algorithm","authors":"Yiming Huang, Di Wu, Yinshui He, N. Lv, Shanben Chen","doi":"10.1109/ARSO.2016.7736265","DOIUrl":null,"url":null,"abstract":"In order to eliminate the effect of wavelength error value and spectral line broadening on the definition of arc plasma spectrum, K-medoids algorithm is used to cluster different kinds of spectral lines and determine the spectral line of interest(SLOI). An improved K-medoids algorithm based on minimum spanning tree is proposed to solve the problem that K-medoids algorithm can not ascertain the number of classification. Moreover, spectral distance(SD) is proposed as the criterion to cluster in terms of the characteristic of spectral data. By marking the known spectral lines, cluster testing is made to validate the validity of the algorithm. The experiment results show that improved K-medoids algorithm can cluster effectively and determine the SLOI.","PeriodicalId":403924,"journal":{"name":"2016 IEEE Workshop on Advanced Robotics and its Social Impacts (ARSO)","volume":"108 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-07-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE Workshop on Advanced Robotics and its Social Impacts (ARSO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ARSO.2016.7736265","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 5
Abstract
In order to eliminate the effect of wavelength error value and spectral line broadening on the definition of arc plasma spectrum, K-medoids algorithm is used to cluster different kinds of spectral lines and determine the spectral line of interest(SLOI). An improved K-medoids algorithm based on minimum spanning tree is proposed to solve the problem that K-medoids algorithm can not ascertain the number of classification. Moreover, spectral distance(SD) is proposed as the criterion to cluster in terms of the characteristic of spectral data. By marking the known spectral lines, cluster testing is made to validate the validity of the algorithm. The experiment results show that improved K-medoids algorithm can cluster effectively and determine the SLOI.