Huang-Chi Chen, Yih-Lon Lin, Yeong-Jeu Sun, J. Hsieh
{"title":"改进Rosenblatt的感知机算法和Novikoff定理","authors":"Huang-Chi Chen, Yih-Lon Lin, Yeong-Jeu Sun, J. Hsieh","doi":"10.1109/ICIT.2002.1189361","DOIUrl":null,"url":null,"abstract":"A modified Rosenblatt's perceptron algorithm (1959) and Novikoff's theorem (1962) for binary classification problem is presented in this paper. For a linearly separable training set, the modified Rosenblatt's perceptron algorithm could get better convergence result. An example is provided to illustrate our main result.","PeriodicalId":344984,"journal":{"name":"2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02.","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2002-12-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Modified Rosenblatt's perceptron algorithm and Novikoff's theorem\",\"authors\":\"Huang-Chi Chen, Yih-Lon Lin, Yeong-Jeu Sun, J. Hsieh\",\"doi\":\"10.1109/ICIT.2002.1189361\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A modified Rosenblatt's perceptron algorithm (1959) and Novikoff's theorem (1962) for binary classification problem is presented in this paper. For a linearly separable training set, the modified Rosenblatt's perceptron algorithm could get better convergence result. An example is provided to illustrate our main result.\",\"PeriodicalId\":344984,\"journal\":{\"name\":\"2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02.\",\"volume\":\"2 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-12-11\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICIT.2002.1189361\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2002 IEEE International Conference on Industrial Technology, 2002. IEEE ICIT '02.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICIT.2002.1189361","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Modified Rosenblatt's perceptron algorithm and Novikoff's theorem
A modified Rosenblatt's perceptron algorithm (1959) and Novikoff's theorem (1962) for binary classification problem is presented in this paper. For a linearly separable training set, the modified Rosenblatt's perceptron algorithm could get better convergence result. An example is provided to illustrate our main result.