%0 Conference Paper %1 ZhengWebb98a %A Zheng, Z. %A Webb, G. I. %B Lecture Notes in Computer Science Vol. 1502: Advanced Topics in Artificial Intelligence, Selected Papers from the Eleventh Australian Joint Conference on Artificial Intelligence (AI '98) %C Berlin %D 1998 %E Antoniou, G. %E Slaney, J.K. %I Springer-Verlag %K Attribute Committees MultiBoosting, Selection Stochastic %P 321-332 %T Stochastic Attribute Selection Committees %X Classifier committee learning methods generate multiple classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Two such methods, Bagging and Boosting, have shown great success with decision tree learning. They create different classifiers by modifying the distribution of the training set. This paper studies a different approach: Stochastic Attribute Selection Committee learning of decision trees. It generates classifier committees by stochastically modifying the set of attributes but keeping the distribution of the training set unchanged. An empirical evaluation of a variant of this method, namely Sasc, in a representative collection of natural domains shows that the SASC method can significantly reduce the error rate of decision tree learning. On average Sasc is more accurate than Bagging and less accurate than Boosting, although a one-tailed sign�test fails to show that these differences are significant at a level of 0.05. In addition, it is found that, like Bagging, Sasc is more stable than Boosting in terms of less frequently obtaining significantly higher error rates than C4.5 and, when error is raised, producing lower error rate increases. Moreover, like Bagging, Sasc is amenable to parallel and distributed processing while Boosting is not.

@inproceedings{ZhengWebb98a, abstract = {Classifier committee learning methods generate multiple classifiers to form a committee by repeated application of a single base learning algorithm. The committee members vote to decide the final classification. Two such methods, Bagging and Boosting, have shown great success with decision tree learning. They create different classifiers by modifying the distribution of the training set. This paper studies a different approach: Stochastic Attribute Selection Committee learning of decision trees. It generates classifier committees by stochastically modifying the set of attributes but keeping the distribution of the training set unchanged. An empirical evaluation of a variant of this method, namely Sasc, in a representative collection of natural domains shows that the SASC method can significantly reduce the error rate of decision tree learning. On average Sasc is more accurate than Bagging and less accurate than Boosting, although a one-tailed sign�test fails to show that these differences are significant at a level of 0.05. In addition, it is found that, like Bagging, Sasc is more stable than Boosting in terms of less frequently obtaining significantly higher error rates than C4.5 and, when error is raised, producing lower error rate increases. Moreover, like Bagging, Sasc is amenable to parallel and distributed processing while Boosting is not.}, added-at = {2016-03-20T05:42:04.000+0100}, address = {Berlin}, audit-trail = {*}, author = {Zheng, Z. and Webb, G. I.}, biburl = {https://www.bibsonomy.org/bibtex/2be7ca98ac7b8e73c32249ccc4d7cfe1a/giwebb}, booktitle = {Lecture Notes in Computer Science Vol. 1502: Advanced Topics in Artificial Intelligence, Selected Papers from the Eleventh Australian Joint Conference on Artificial Intelligence (AI '98)}, editor = {Antoniou, G. and Slaney, J.K.}, interhash = {e86cf30303357b1d4c11b954bfc6ad7d}, intrahash = {be7ca98ac7b8e73c32249ccc4d7cfe1a}, keywords = {Attribute Committees MultiBoosting, Selection Stochastic}, location = {Brisbane, Australia}, pages = {321-332}, publisher = {Springer-Verlag}, timestamp = {2016-03-20T05:42:04.000+0100}, title = {Stochastic Attribute Selection Committees}, year = 1998 }