Fig. 2From: Graph clustering-based discretization of splitting and merging methods (GraphS and GraphM)Proposed framework. The framework of the graph clustering-based discretization. A graph clustering-based algorithm first creates the affinity matrix to represent a graph; then, generates a discretization scheme of each numeric attribute. Finally, the numeric attributes are transformed into the nominal attributes by applying the dicretization schemesBack to article page