Highly scalable and robust rule learner: performance evaluation and comparison.
Business intelligence and bioinformatics applications increasingly require the mining of datasets consisting of millions of data points, or crafting real-time enterprise-level decision support systems for large corporations and drug companies. In all cases, there needs to be an underlying data mining system, and this mining system must be highly scalable. To this end, we describe a new rule learner called DataSqueezer. The learner belongs to the family of inductive supervised rule extraction algorithms. DataSqueezer is a simple, greedy, rule builder that generates a set of production rules from labeled input data. In spite of its relative simplicity, DataSqueezer is a very effective learner. The rules generated by the algorithm are compact, comprehensible, and have accuracy comparable to rules generated by other state-of-the-art rule extraction algorithms. The main advantages of DataSqueezer are very high efficiency, and missing data resistance. DataSqueezer exhibits log-linear asymptotic complexity with the number of training examples, and it is faster than other state-of-the-art rule learners. The learner is also robust to large quantities of missing data, as verified by extensive experimental comparison with the other learners. DataSqueezer is thus well suited to modern data mining and business intelligence tasks, which commonly involve huge datasets with a large fraction of missing data.
Department of Electrical and Computer Engineering, University of Alberta, Edmonton AB T6G 2VF, Canada.
Lukasz A
LA
Kurgan
Krzysztof J
KJ
Cios
Scott
S
Dick
D000465:Algorithms; D001185:Artificial Intelligence; D003628:Database Management Systems; D016208:Databases, Factual; D003661:Decision Support Techniques; D016247:Information Storage and Retrieval / Q000379:methods*