{"title":"模糊聚类有效性的性能度量","authors":"Hyun-Sook Rhee, Kyung-Whan Oh","doi":"10.1109/AFSS.1996.583633","DOIUrl":null,"url":null,"abstract":"The primary concern with the use of any clustering is how well it has identified the structure that is present in the data. This is the \"cluster validity problem\". In this paper, we define G as a measure of the quality of clustering which is based on the mini-max filter concept and fuzzy theory. It measures the overall average compactness and separation of a fuzzy c-partition and explore the properties of G, and we define I/sub G/ as a more suitable measure to compare the clustering result of one fuzzy c/sub 1/-partition with another c/sub 2/-partition of a data set. We show the measure I/sub G/ can be used to select an optimal number of clusters.","PeriodicalId":197019,"journal":{"name":"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1996-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"A performance measure for the fuzzy cluster validity\",\"authors\":\"Hyun-Sook Rhee, Kyung-Whan Oh\",\"doi\":\"10.1109/AFSS.1996.583633\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The primary concern with the use of any clustering is how well it has identified the structure that is present in the data. This is the \\\"cluster validity problem\\\". In this paper, we define G as a measure of the quality of clustering which is based on the mini-max filter concept and fuzzy theory. It measures the overall average compactness and separation of a fuzzy c-partition and explore the properties of G, and we define I/sub G/ as a more suitable measure to compare the clustering result of one fuzzy c/sub 1/-partition with another c/sub 2/-partition of a data set. We show the measure I/sub G/ can be used to select an optimal number of clusters.\",\"PeriodicalId\":197019,\"journal\":{\"name\":\"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1996-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AFSS.1996.583633\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Soft Computing in Intelligent Systems and Information Processing. Proceedings of the 1996 Asian Fuzzy Systems Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AFSS.1996.583633","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A performance measure for the fuzzy cluster validity
The primary concern with the use of any clustering is how well it has identified the structure that is present in the data. This is the "cluster validity problem". In this paper, we define G as a measure of the quality of clustering which is based on the mini-max filter concept and fuzzy theory. It measures the overall average compactness and separation of a fuzzy c-partition and explore the properties of G, and we define I/sub G/ as a more suitable measure to compare the clustering result of one fuzzy c/sub 1/-partition with another c/sub 2/-partition of a data set. We show the measure I/sub G/ can be used to select an optimal number of clusters.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
