{"title":"A comparison of some connectionist compression schemes","authors":"Tom Gedeon, J. A. Catalán, J. Jin","doi":"10.1109/INES.1997.632431","DOIUrl":null,"url":null,"abstract":"In this paper we consider connectionist compression schemes using auto-associative networks, and demonstrate the advantages gained by imposing two different constraints on the allowed network weights, and comparison with pruning of the unconstrained auto-associative network.","PeriodicalId":161975,"journal":{"name":"Proceedings of IEEE International Conference on Intelligent Engineering Systems","volume":"35 5 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1997-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of IEEE International Conference on Intelligent Engineering Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INES.1997.632431","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In this paper we consider connectionist compression schemes using auto-associative networks, and demonstrate the advantages gained by imposing two different constraints on the allowed network weights, and comparison with pruning of the unconstrained auto-associative network.