{"title":"随机SPI分类:不确定环境下更好的模型","authors":"Yong Qi, Weihua Li, Zhonghua Li","doi":"10.1109/ICMECG.2009.32","DOIUrl":null,"url":null,"abstract":"This paper addresses the problem of learning optimal classifiers that maximally improve the robustness and accuracy in uncertain environment included a large number of noise and missing values. Recent solutions to the efficiently vertex weight evaluation, such as the Bayes Network, rely on statistics methods, without sufficient robust guarantees. We show how a globally optimal solution can be obtained by formulating predicates and statistical training set evaluation in Markov Logic Network. We then propose a classification algorithm which adopts random selection of the instances and features in Random Statistical Predicate Invention (RSPI) classification model. In a set of experiments on UCI datasets about credit card and CRM information we show that the proposed RSPI can achieve significant gains in robustness of model, compared to decision trees algorithms or other random classification methods.","PeriodicalId":252323,"journal":{"name":"2009 International Conference on Management of e-Commerce and e-Government","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"A Classification with Random SPI: Better Models in Uncertain Environment\",\"authors\":\"Yong Qi, Weihua Li, Zhonghua Li\",\"doi\":\"10.1109/ICMECG.2009.32\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper addresses the problem of learning optimal classifiers that maximally improve the robustness and accuracy in uncertain environment included a large number of noise and missing values. Recent solutions to the efficiently vertex weight evaluation, such as the Bayes Network, rely on statistics methods, without sufficient robust guarantees. We show how a globally optimal solution can be obtained by formulating predicates and statistical training set evaluation in Markov Logic Network. We then propose a classification algorithm which adopts random selection of the instances and features in Random Statistical Predicate Invention (RSPI) classification model. In a set of experiments on UCI datasets about credit card and CRM information we show that the proposed RSPI can achieve significant gains in robustness of model, compared to decision trees algorithms or other random classification methods.\",\"PeriodicalId\":252323,\"journal\":{\"name\":\"2009 International Conference on Management of e-Commerce and e-Government\",\"volume\":\"40 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2009-09-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2009 International Conference on Management of e-Commerce and e-Government\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICMECG.2009.32\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 International Conference on Management of e-Commerce and e-Government","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICMECG.2009.32","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Classification with Random SPI: Better Models in Uncertain Environment
This paper addresses the problem of learning optimal classifiers that maximally improve the robustness and accuracy in uncertain environment included a large number of noise and missing values. Recent solutions to the efficiently vertex weight evaluation, such as the Bayes Network, rely on statistics methods, without sufficient robust guarantees. We show how a globally optimal solution can be obtained by formulating predicates and statistical training set evaluation in Markov Logic Network. We then propose a classification algorithm which adopts random selection of the instances and features in Random Statistical Predicate Invention (RSPI) classification model. In a set of experiments on UCI datasets about credit card and CRM information we show that the proposed RSPI can achieve significant gains in robustness of model, compared to decision trees algorithms or other random classification methods.