{"title":"Two-Phase Spectral Clustering Based on Discretization","authors":"Qiju Kang, Ying Qian, L. Sun, Hai Yu, Jianyu Wang","doi":"10.1109/IHMSC.2013.65","DOIUrl":null,"url":null,"abstract":"As spectral clustering has become increasingly popular in recent years, further research on it is very important. Due to the important role of discretization in data mining, a new clustering approach integrating discretization with density-sensitive spectral clustering namely density-sensitive spectral clustering of categorized data (DSSCCAT) is proposed. To alleviate the high computational complexity of DSSCCAT, two-phase spectral clustering (TPSC) algorithm is proposed, which involves two phases: construct the representatives of the original dataset and cluster the representatives with DSSCCAT. Experimental results on UCI datasets show the feasibility of combining discretization with density-sensitive spectral clustering. TPSC can obtain desirable clusters with high performance. Furthermore, TPSC outperforms DSSCCAT obviously in terms of computational time.","PeriodicalId":222375,"journal":{"name":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 5th International Conference on Intelligent Human-Machine Systems and Cybernetics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IHMSC.2013.65","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
As spectral clustering has become increasingly popular in recent years, further research on it is very important. Due to the important role of discretization in data mining, a new clustering approach integrating discretization with density-sensitive spectral clustering namely density-sensitive spectral clustering of categorized data (DSSCCAT) is proposed. To alleviate the high computational complexity of DSSCCAT, two-phase spectral clustering (TPSC) algorithm is proposed, which involves two phases: construct the representatives of the original dataset and cluster the representatives with DSSCCAT. Experimental results on UCI datasets show the feasibility of combining discretization with density-sensitive spectral clustering. TPSC can obtain desirable clusters with high performance. Furthermore, TPSC outperforms DSSCCAT obviously in terms of computational time.