Abstract
Many problems that appear in different contexts are conceptually similar and so are amenable to solution by a common technique. Three such technical Information Systems (IS) problems are: (1) segmentation of computer programs; (2) attribute discretization for decision tree induction; and (3) design of hash tables in database systems. In this paper we show how each of these seemingly different problems can be formulated as a sequential (set) partitioning problem, and solved using a parametric linear programming (LP) procedure. This approach provides optimal solutions unlike previous solution approaches which were either greedy heuristics or limited to solving only a specific problem situation. Given the likelihood that other applications of the sequential partitioning problem exist in IS, the material presented here could be useful to other researchers in formulating the problem at an appropriate level of abstraction so that available optimal solution approaches can be identified. In addition to providing a common solution method, parametric LP frees the user from having to make premature decisions regarding the number of groups for the partition, and this decision can be delayed post solution.
