{"title":"使用最小长度编码解决机器学习问题的实验","authors":"A. Gammerman, T. Bellotti","doi":"10.1109/DCC.1992.227445","DOIUrl":null,"url":null,"abstract":"Describes a system called Emily which was designed to implement the minimal-length encoding principle for induction, and a series of experiments that was carried out with some success by that system. Emily is based on the principle that the formulation of concepts (i.e., theories or explanations) over a set of data can be achieved by the process of minimally encoding that data. Thus, a learning problem can be solved by minimising its descriptions.<<ETX>>","PeriodicalId":170269,"journal":{"name":"Data Compression Conference, 1992.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-03-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Experiments using minimal-length encoding to solve machine learning problems\",\"authors\":\"A. Gammerman, T. Bellotti\",\"doi\":\"10.1109/DCC.1992.227445\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Describes a system called Emily which was designed to implement the minimal-length encoding principle for induction, and a series of experiments that was carried out with some success by that system. Emily is based on the principle that the formulation of concepts (i.e., theories or explanations) over a set of data can be achieved by the process of minimally encoding that data. Thus, a learning problem can be solved by minimising its descriptions.<<ETX>>\",\"PeriodicalId\":170269,\"journal\":{\"name\":\"Data Compression Conference, 1992.\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-03-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Data Compression Conference, 1992.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/DCC.1992.227445\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Data Compression Conference, 1992.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/DCC.1992.227445","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Experiments using minimal-length encoding to solve machine learning problems
Describes a system called Emily which was designed to implement the minimal-length encoding principle for induction, and a series of experiments that was carried out with some success by that system. Emily is based on the principle that the formulation of concepts (i.e., theories or explanations) over a set of data can be achieved by the process of minimally encoding that data. Thus, a learning problem can be solved by minimising its descriptions.<>