Kittakorn Sriwanna

Learn More
Most discretization algorithms focus on the univariate case, which proceeds without considering interactions among attributes. Furthermore, they find the value of discretization criterion based on a greedy method that usually leads to a sub-optimal set of cut-points. In response, this paper introduces an evolutionary cut points search for graph(More)
  • 1