{"title":"Dynamic version spaces in machine learning","authors":"William Sverdlik, R. Reynolds","doi":"10.1109/TAI.1992.246421","DOIUrl":null,"url":null,"abstract":"A hybrid learning algorithm for discovering concepts with multiple disjuncts is presented. The algorithm, HYBAL, in incorporating both version spaces and genetic algorithms, extends the work of R.G. Reynolds (1990) to learning of Boolean concepts from an exponentially growing hypothesis space. Learning is accomplished via factoring the underlying version space into tractable subspaces, and then dynamically deriving concepts for the corresponding S set and G sets. In delaying the specification of a concept language until run time, it is demonstrated that HYBAL is capable of solving a larger class of Boolean functions than with traditional version spaces, where concepts are specified at compile time.<<ETX>>","PeriodicalId":265283,"journal":{"name":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings Fourth International Conference on Tools with Artificial Intelligence TAI '92","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/TAI.1992.246421","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9
Abstract
A hybrid learning algorithm for discovering concepts with multiple disjuncts is presented. The algorithm, HYBAL, in incorporating both version spaces and genetic algorithms, extends the work of R.G. Reynolds (1990) to learning of Boolean concepts from an exponentially growing hypothesis space. Learning is accomplished via factoring the underlying version space into tractable subspaces, and then dynamically deriving concepts for the corresponding S set and G sets. In delaying the specification of a concept language until run time, it is demonstrated that HYBAL is capable of solving a larger class of Boolean functions than with traditional version spaces, where concepts are specified at compile time.<>