6533b82cfe1ef96bd128e9ab

RESEARCH PRODUCT

CN2-R: Faster CN2 with randomly generated complexes

Janis Zuters

subject

Weighted Majority AlgorithmTheoretical computer scienceRule inductionComputer sciencePopulation-based incremental learningStability (learning theory)Online machine learningProbabilistic analysis of algorithmsAlgorithm designStar (graph theory)Algorithm

description

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.

yearjournalcountryeditionlanguage
2011-08-012011 16th International Conference on Methods & Models in Automation & Robotics
https://doi.org/10.1109/mmar.2011.6031363