Yangqiang Yu, Tian-qiang Huang, Gong-de Guo, Kai Li
{"title":"多密度复杂形状数据集的半监督聚类算法","authors":"Yangqiang Yu, Tian-qiang Huang, Gong-de Guo, Kai Li","doi":"10.1109/CCPR.2008.15","DOIUrl":null,"url":null,"abstract":"There are many complicated data in real world, clustering analysis should be able to find the clusters of different shapes and densities. The existing typical clustering algorithms do not perform well on multi-density data. A semi-supervised clustering algorithm for multi-density dataset SCMD is proposed. The pairwise constraints: must-link and cannot-link that reflect the distribution of multi-density dataset are used. Experimental results show the algorithm can identify the clusters of varying shapes, sizes, and densities, even in the presence of noise and outliers. It is more efficient than SNN and DBSCAN.","PeriodicalId":292956,"journal":{"name":"2008 Chinese Conference on Pattern Recognition","volume":"130 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-10-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"Semi-Supervised Clustering Algorithm for Multi-Density and Complex Shape Dataset\",\"authors\":\"Yangqiang Yu, Tian-qiang Huang, Gong-de Guo, Kai Li\",\"doi\":\"10.1109/CCPR.2008.15\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"There are many complicated data in real world, clustering analysis should be able to find the clusters of different shapes and densities. The existing typical clustering algorithms do not perform well on multi-density data. A semi-supervised clustering algorithm for multi-density dataset SCMD is proposed. The pairwise constraints: must-link and cannot-link that reflect the distribution of multi-density dataset are used. Experimental results show the algorithm can identify the clusters of varying shapes, sizes, and densities, even in the presence of noise and outliers. It is more efficient than SNN and DBSCAN.\",\"PeriodicalId\":292956,\"journal\":{\"name\":\"2008 Chinese Conference on Pattern Recognition\",\"volume\":\"130 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2008-10-31\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2008 Chinese Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CCPR.2008.15\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 Chinese Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CCPR.2008.15","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Semi-Supervised Clustering Algorithm for Multi-Density and Complex Shape Dataset
There are many complicated data in real world, clustering analysis should be able to find the clusters of different shapes and densities. The existing typical clustering algorithms do not perform well on multi-density data. A semi-supervised clustering algorithm for multi-density dataset SCMD is proposed. The pairwise constraints: must-link and cannot-link that reflect the distribution of multi-density dataset are used. Experimental results show the algorithm can identify the clusters of varying shapes, sizes, and densities, even in the presence of noise and outliers. It is more efficient than SNN and DBSCAN.