Performance evaluation of attribute-oriented algorithms for knowledge discovery from databases

Practical tools for knowledge discovery from databases must be efficient enough to handle large data sets found in commercial environments. Attribute-oriented induction has proved to be a useful method for knowledge discovery. Three algorithms are AOI, LCHR and GDBR. We have implemented efficient versions of each algorithm and empirically compared them on large commercial data sets. These tests show that GDBR is consistently faster than AOI and LCHR. GDBR´s times increase linearly with increased input size, while times for AOI and LCHR increase non-linearly when memory is exceeded. Through better memory management, however, AOI can be improved to provide some advantages