Data Mining: Fast Algorithms vs. Fast Results

  • Raghu Ramakrishnan
Conference paper

DOI: 10.1007/978-3-540-39592-8_3

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2871)
Cite this paper as:
Ramakrishnan R. (2003) Data Mining: Fast Algorithms vs. Fast Results. In: Zhong N., Raś Z.W., Tsumoto S., Suzuki E. (eds) Foundations of Intelligent Systems. ISMIS 2003. Lecture Notes in Computer Science, vol 2871. Springer, Berlin, Heidelberg

Abstract

Exploratory data analysis is typically an iterative, multi-step process in which data is cleaned, scaled, integrated, and various algorithms are applied to arrive at interesting insights. Most algorithmic research has concentrated on algorithms for a single step in this process, e.g., algorithms for constructing a predictive model from training data. However, the speed of an individual algorithm is rarely the bottleneck in a data mining project. The limiting factor is usually the difficulty of understanding the data, exploring numerous alternatives, and managing the analysis process and intermediate results. The alternatives include the choice of mining techniques, how they are applied, and to what subsets of data they are applied, leading to a rapid explosion in the number of potential analysis steps.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Raghu Ramakrishnan
    • 1
  1. 1.Computer Sciences DepartmentUniversity of WisconsinMadisonUSA

Personalised recommendations