Speeding up the search for optimal partitions

摘要

Numerical value range partitioning is an inherent part of inductive learning.In classification problems,a common partition ranking method is to use an attribute evaluation function to assign a goodness score to each candidate.Optimal cut point selection constitutes a potential efficiency bottleneck,which is often circumvented by using heuristic methods.