High-Performance Commercial Data Mining: A Multistrategy Machine Learning Application

  • Authors:

  • William H. Hsu;Michael Welge;Tom Redman;David Clutter

  • Affiliations:

  • Department of Computing and Information Sciences, Kansas State University, Manhattan, KS 66506&semi/ Automated Learning Group, National Center for Supercomputing Applications (NCSA), Champaign, IL ...;Automated Learning Group, National Center for Supercomputing Applications (NCSA), Champaign, IL 61820. welge@ncsa.uiuc.edu;Automated Learning Group, National Center for Supercomputing Applications (NCSA), Champaign, IL 61820. redman@ncsa.uiuc.edu;Automated Learning Group, National Center for Supercomputing Applications (NCSA), Champaign, IL 61820. clutter@ncsa.uiuc.edu

  • Venue:
  • Data Mining and Knowledge Discovery
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present an application of inductive concept learning and interactive visualization techniques to a large-scale commercial data mining project. This paper focuses on design and configuration of high-level optimization systems (wrappers) for relevance determination and constructive induction, and on integrating these wrappers with elicited knowledge on attribute relevance and synthesis. In particular, we discuss decision support issues for the application (cost prediction for automobile insurance markets in several states) and report experiments using iD2K, a Java-based visual programming system for data mining and information visualization, and several commercial and research tools. We describe exploratory clustering, descriptive statistics, and supervised decision tree learning in this application, focusing on a parallel genetic algorithm (GA) system, iJenesis, which is used to implement relevance determination (attribute subset selection). Deployed on several high-performance network-of-workstation systems (Beowulf clusters), iJenesis achieves a linear speedup, due to a high degree of task parallelism. Its test set accuracy is significantly higher than that of decision tree inducers alone and is comparable to that of the best extant search-space based wrappers.