Space decomposition in data mining - a clustering approach
O. Maimon, L. Rokach, Inbal Lavi · 2003
Decomposition may divide the database horizontally (subsets of rows or tuples) or vertically. It may be aimed at minimizing space and time needed for the classification of a dataset (e.g. sampling, windowing) or rather attempt to improve accuracy (e.g. bagging, boosting). This paper presents a horizontal space-decomposition algorithm, exploiting the K-means clustering algorithm. It is aimed at decreasing error rate compared to the simple classifier embedded in it while being rather understandable.