Fig. 2
The example dataset for the algorithm is a 2D moonshape dataset. (a) A clustered moon dataset. (b) Find the convex points by Quick hull convex algorithm. (c) The initial hyperrectangles are generated by connecting neighboring convex hull points according to the principal dimension. (d) Generate a dendrogram by treating hyperrectangles as leaf nodes. (e) Find the stop criterion. (f) Merge neighboring hyperrectangles to generate an optimal number of hyperrectangles. (g) Find the cut line. (h) Cut redundant areas. (i) Results of interpretable hyperrectangles.
