{"title":"未见病例分类中两种部分匹配策略的比较","authors":"J. Grzymala-Busse, G. Sudre","doi":"10.1109/GRC.2006.1635921","DOIUrl":null,"url":null,"abstract":"This paper compares two partial matching strate- gies, selective and mixed, for classification of unseen cases. The selective partial matching is a novel approach for classification, while mixed partial matching was implemented in the LERS classification system several years ago. Though results of our experiments show that neither strategy is better than the other, an important conclusion is that it is crucial to implement both strategies since the correct choice of one of these strategies, for a specific data set, results in substantial improvement of the final classification.","PeriodicalId":400997,"journal":{"name":"2006 IEEE International Conference on Granular Computing","volume":"41 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-05-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A comparison of two partial matching strategies for classification of unseen cases\",\"authors\":\"J. Grzymala-Busse, G. Sudre\",\"doi\":\"10.1109/GRC.2006.1635921\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper compares two partial matching strate- gies, selective and mixed, for classification of unseen cases. The selective partial matching is a novel approach for classification, while mixed partial matching was implemented in the LERS classification system several years ago. Though results of our experiments show that neither strategy is better than the other, an important conclusion is that it is crucial to implement both strategies since the correct choice of one of these strategies, for a specific data set, results in substantial improvement of the final classification.\",\"PeriodicalId\":400997,\"journal\":{\"name\":\"2006 IEEE International Conference on Granular Computing\",\"volume\":\"41 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-05-10\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE International Conference on Granular Computing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GRC.2006.1635921\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE International Conference on Granular Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GRC.2006.1635921","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A comparison of two partial matching strategies for classification of unseen cases
This paper compares two partial matching strate- gies, selective and mixed, for classification of unseen cases. The selective partial matching is a novel approach for classification, while mixed partial matching was implemented in the LERS classification system several years ago. Though results of our experiments show that neither strategy is better than the other, an important conclusion is that it is crucial to implement both strategies since the correct choice of one of these strategies, for a specific data set, results in substantial improvement of the final classification.