TY - GEN
T1 - CN2-R
T2 - 2011 16th International Conference on Methods and Models in Automation and Robotics, MMAR 2011
AU - Zuters, Janis
PY - 2011
Y1 - 2011
N2 - Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.
AB - Among the rule induction algorithms, the classic CN2 is still one of the most popular ones; a great amount of enhancements and improvements to it is to witness this. Despite the growing computing capacities since the algorithm was proposed, one of the main issues is resource demand. The proposed modification, CN2-R, substitutes the star concept of the original algorithm with a technique of randomly generated complexes in order to substantially improve on running times without significant loss in accuracy.
UR - https://www.scopus.com/pages/publications/80054044545
U2 - 10.1109/MMAR.2011.6031363
DO - 10.1109/MMAR.2011.6031363
M3 - Conference paper
AN - SCOPUS:80054044545
SN - 9781457709128
T3 - 2011 16th International Conference on Methods and Models in Automation and Robotics, MMAR 2011
SP - 306
EP - 309
BT - 2011 16th International Conference on Methods and Models in Automation and Robotics, MMAR 2011
Y2 - 22 August 2011 through 25 August 2011
ER -