{"title":"APS:不完全回忆下的agent学习","authors":"D. Dudek, Michal Kubisz, Aleksander Zgrzywa","doi":"10.1109/ISDA.2005.26","DOIUrl":null,"url":null,"abstract":"We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.","PeriodicalId":345842,"journal":{"name":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2005-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"APS: agent's learning with imperfect recall\",\"authors\":\"D. Dudek, Michal Kubisz, Aleksander Zgrzywa\",\"doi\":\"10.1109/ISDA.2005.26\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.\",\"PeriodicalId\":345842,\"journal\":{\"name\":\"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2005-09-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISDA.2005.26\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"5th International Conference on Intelligent Systems Design and Applications (ISDA'05)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISDA.2005.26","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We present a new method of incremental, statistical learning, which is suitable for knowledge-based systems, especially software agents. The method is based on the imperfect recall assumption, according to which an agent does not store all the past observations. However it does preserve general rules concerning the past, that can be potentially useful for improving agent's action. During its performance an agent stores observations in the history. When system resources are idle and the size of the history is sufficient as for its statistical significance, the stored facts are analysed by means of data mining techniques, and disposed afterwards. The discovered rules are combined with the former rule base, so that the final rule set is approximately the same, as if it was obtained on the whole history.