For discrete big data which have a limited range of values, Conventional machine learning methods cannot be applied because we see clutter and overlapping of classes in such data: many data points from different classes overlap. In this paper we introduce a solution for this problem through a novel heuristics method. By applying a running average (with a window-size= d) we could transform Discrete data to broad-range, Continuous values. When we have more than 2 columns and one of them is containing data about the tags of classification (Class Column), we could compare and sort the features (Non-class Columns) based on the R2 coefficient of the regression for running averages. The parameters tuning could help us to select the best features (the non-class columns which have the best correlation with the Class Column). “Window size” and “Ordering” could be tuned to achieve the goal. This optimization problem is hard and we need an Algorithm (or Heuristics) for simplifying this tuning. We demonstrate a novel heuristics, Called Simulated Distillation (SimulaD), which could help us to gain a somehow good results with this optimization problem.