Bordin Saengthongloun, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai
{"title":"AC-Stream:使用多个类关联规则对数据流进行关联分类","authors":"Bordin Saengthongloun, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai","doi":"10.1109/JCSSE.2013.6567349","DOIUrl":null,"url":null,"abstract":"Data stream classification is one of the most interesting problems in the data mining community. Recently, the idea of associative classification was introduced to handle data streams. However, single rule classification over data streams like AC-DS implicitly has two flaws. Firstly, it tends to produce a large bias on simple rules. Secondly, it is not appropriate for data streams that are slowly changed from time to time. To overcome this problem, we propose an algorithm, namely AC-Stream, for classifying a data stream using multiple rules. AC-Stream is able to find k-rules for predicting unseen data. An interval estimated Hoeffding-bound is used as a gain to approximate the best number of rules, k. Compared to AC-DS and other traditional associative classifiers on large number of TICI datasets, ACStream is more effective in terms of average accuracy and F1 measurement.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"AC-Stream: Associative classification over data streams using multiple class association rules\",\"authors\":\"Bordin Saengthongloun, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai\",\"doi\":\"10.1109/JCSSE.2013.6567349\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Data stream classification is one of the most interesting problems in the data mining community. Recently, the idea of associative classification was introduced to handle data streams. However, single rule classification over data streams like AC-DS implicitly has two flaws. Firstly, it tends to produce a large bias on simple rules. Secondly, it is not appropriate for data streams that are slowly changed from time to time. To overcome this problem, we propose an algorithm, namely AC-Stream, for classifying a data stream using multiple rules. AC-Stream is able to find k-rules for predicting unseen data. An interval estimated Hoeffding-bound is used as a gain to approximate the best number of rules, k. Compared to AC-DS and other traditional associative classifiers on large number of TICI datasets, ACStream is more effective in terms of average accuracy and F1 measurement.\",\"PeriodicalId\":199516,\"journal\":{\"name\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"volume\":\"1 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/JCSSE.2013.6567349\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/JCSSE.2013.6567349","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
AC-Stream: Associative classification over data streams using multiple class association rules
Data stream classification is one of the most interesting problems in the data mining community. Recently, the idea of associative classification was introduced to handle data streams. However, single rule classification over data streams like AC-DS implicitly has two flaws. Firstly, it tends to produce a large bias on simple rules. Secondly, it is not appropriate for data streams that are slowly changed from time to time. To overcome this problem, we propose an algorithm, namely AC-Stream, for classifying a data stream using multiple rules. AC-Stream is able to find k-rules for predicting unseen data. An interval estimated Hoeffding-bound is used as a gain to approximate the best number of rules, k. Compared to AC-DS and other traditional associative classifiers on large number of TICI datasets, ACStream is more effective in terms of average accuracy and F1 measurement.