Benchmarking data mining algorithms

  • Authors:
  • Balaji Rajagopalan;Ravi Krovi

  • Affiliations:
  • Oakland University;University of Akron

  • Venue:
  • Data warehousing and web engineering
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Data mining is the process of sifting through the mass of organizational (internal and external) data to identify patterns critical for decision support. Successful implementation of the data mining effort requires a careful assessment of the various tools and algorithms available. The basic premise of this study is that machine-learning algorithms, which are assumption free, should outperform their traditional counterparts when mining business databases. The objective of this study is to test this proposition by investigating the performance of the algorithms for several scenarios. The scenarios are based on simulations designed to reflect the extent to which typical statistical assumptions are violated in the business domain. The results of the computational experiments support the proposition that machine learning algorithms generally outperform their statistical counterparts under certain conditions. These can be used as prescriptive guidelines for the applicability of data mining techniques.