Mining Classification Rules from Datasets with Large Number of Many-Valued Attributes

Decision tree induction algorithms scale well to large datasets for their univariate and divide-and-conquer approach. However, they may fail in discovering effective knowledge when the input dataset consists of a large number of uncorrelated many-valued attributes. In this paper we present an algorithm, Noah, that tackles this problem by applying a multivariate search. Performing a multivariate search leads to a much larger consumption of computation time and memory, this may be prohibitive for large datasets. We remedy this problem by exploiting effective pruning strategies and efficient data structures. We applied our algorithm to a real marketing application of cross-selling. Experimental results revealed that the application database was too complex for C4.5 as it failed to discover any useful knowledge. The application database was also too large for various well known rule discovery algorithms which were not able to complete their task. The pruning techniques used in Noah are gen...

• Type: Conference
• Year: 2000
• Where: EDBT
• Authors: Giovanni Giuffrida, Wesley W. Chu, Dominique M. Hanssens
• Keywords: Computer Science, Database, EDBT 2000, Large Datasets, Multivariate Search, Uncorrelated Many-valued Attributes