Investigating data preprocessing methods for circuit complexity models

P. W. Chandana Prasad, Azam Beg

    Research output: Contribution to journalArticlepeer-review

    11 Citations (Scopus)

    Abstract

    Preprocessing the data is an important step while creating neural network (NN) applications because this step usually has a significant effect on the prediction performance of the model. This paper compares different data processing strategies for NNs for prediction of Boolean function complexity (BFC). We compare NNs' predictive capabilities with (1) no preprocessing (2) scaling the values in different curves based on every curve's own peak and then normalizing to [0, 1] range (3) applying z-score to values in all curves and then normalizing to [0, 1] range, and (4) logarithmically scaling all curves and then normalizing to [0, 1] range. The efficiency of these methods was measured by comparing RMS errors in NN-made BFC predictions for numerous ISCAS benchmark circuits. Logarithmic preprocessing method resulted in the best prediction statistics as compared to other techniques.

    Original languageEnglish
    Pages (from-to)519-526
    Number of pages8
    JournalExpert Systems with Applications
    Volume36
    Issue number1
    DOIs
    Publication statusPublished - Jan 2009

    Keywords

    • Boolean function complexity
    • Computer-aided design
    • Data preprocessing
    • Feed-forward neural network
    • Machine learning
    • Pattern recognition

    ASJC Scopus subject areas

    • General Engineering
    • Computer Science Applications
    • Artificial Intelligence

    Fingerprint

    Dive into the research topics of 'Investigating data preprocessing methods for circuit complexity models'. Together they form a unique fingerprint.

    Cite this