## Abstract

We consider the problem of finding a set of attribute values that give a high quality binary segmentation of a database. The quality of a segmentation is defined by an objective function suitable for the user's objective, such as "mean squared error," "mutual information," or "χ^{2}," each of which is defined in terms of the distribution of a given target attribute. Our goal is to find value groups on a given conditional domain that split databases into two segments, optimizing the value of an objective function. Though the problem is intractable for general objective functions, there are feasible algorithms for finding high quality binary segmentations when the objective function is convex, and we prove that the typical criteria mentioned above are all convex. We propose two practical algorithms, based on computational geometry techniques, which find a much better value group than conventional heuristics.

Original language | English |
---|---|

Pages (from-to) | 1269-1279 |

Number of pages | 11 |

Journal | IEEE Transactions on Knowledge and Data Engineering |

Volume | 14 |

Issue number | 6 |

DOIs | |

Publication status | Published - 2002 Nov |

## Keywords

- Binary segmentation
- Categorical test
- Data mining
- Data reduction
- Decision tree
- Value groups

## ASJC Scopus subject areas

- Information Systems
- Computer Science Applications
- Computational Theory and Mathematics