Time space tradeoffs in GA based feature selection for workload characterization

  • Authors:
  • Dan E. Tamir;Clara Novoa;Daniel Lowell

  • Affiliations:
  • Department of Computer Science, Texas State University, San Marcos, Texas;Department of Computer Science, Texas State University, San Marcos, Texas;Department of Computer Science, Texas State University, San Marcos, Texas

  • Venue:
  • IEA/AIE'10 Proceedings of the 23rd international conference on Industrial engineering and other applications of applied intelligent systems - Volume Part II
  • Year:
  • 2010

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper reports the results of a research effort that explores time/space tradeoffs inherent to genetic algorithms (GA). The study analyzes redundancy in the GA search space and lays out a schema for efficient utilization of record keeping in the form of a cache to minimize redundancy. The application used for evaluation of the record keeping procedure is feature selection for computer workload characterization. The experimental results demonstrate the utility of record keeping in the GA domain, and show a significant reduction in execution time with virtually the same solution quality.