{"title":"用交叉熵方法建立核Fisher判别模型","authors":"B. Santosa, Andiek Sunarto","doi":"10.1109/SoCPaR.2009.138","DOIUrl":null,"url":null,"abstract":"In this paper, the cross-entropy (CE) method is proposed to solve non-linear discriminant analysis or Kernel Fisher discriminant (CE-KFD) analysis. CE through certain steps can find the optimal or near optimal solution with a fast rate of convergence for optimization problem. While, KFD is to solve problem of Fisher’s linear discriminant in a kernel feature space F by maximizing between class variance and minimizing within class variance. Through the numerical experiments, we found that CE-KFD demonstrates the high accuracy of the results compared to the traditional methods, Fisher LDA and kernel Fisher (KFD) with eigen decomposition method.","PeriodicalId":284743,"journal":{"name":"2009 International Conference of Soft Computing and Pattern Recognition","volume":"13 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-12-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Development of Kernel Fisher Discriminant Model Using the Cross-Entropy Method\",\"authors\":\"B. Santosa, Andiek Sunarto\",\"doi\":\"10.1109/SoCPaR.2009.138\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, the cross-entropy (CE) method is proposed to solve non-linear discriminant analysis or Kernel Fisher discriminant (CE-KFD) analysis. CE through certain steps can find the optimal or near optimal solution with a fast rate of convergence for optimization problem. While, KFD is to solve problem of Fisher’s linear discriminant in a kernel feature space F by maximizing between class variance and minimizing within class variance. Through the numerical experiments, we found that CE-KFD demonstrates the high accuracy of the results compared to the traditional methods, Fisher LDA and kernel Fisher (KFD) with eigen decomposition method.\",\"PeriodicalId\":284743,\"journal\":{\"name\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"volume\":\"13 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-12-04\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference of Soft Computing and Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SoCPaR.2009.138\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference of Soft Computing and Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SoCPaR.2009.138","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Development of Kernel Fisher Discriminant Model Using the Cross-Entropy Method
In this paper, the cross-entropy (CE) method is proposed to solve non-linear discriminant analysis or Kernel Fisher discriminant (CE-KFD) analysis. CE through certain steps can find the optimal or near optimal solution with a fast rate of convergence for optimization problem. While, KFD is to solve problem of Fisher’s linear discriminant in a kernel feature space F by maximizing between class variance and minimizing within class variance. Through the numerical experiments, we found that CE-KFD demonstrates the high accuracy of the results compared to the traditional methods, Fisher LDA and kernel Fisher (KFD) with eigen decomposition method.