Investigating data preprocessing methods for circuit complexity models
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 curves 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.
data preprocessing boolean function complexity machine learning feed-forward neural network pattern recognition computer-aided design