TY - JOUR

T1 - Applications of sequential set partitioning

T2 - A set of technical information systems problems

AU - Osei-Bryson, Kweku Muata

AU - Joseph, Anito

N1 - Funding Information:
We thank the anonymous referees for their valuable comments that enabled us to improve the quality of this paper. This research was supported in part by a Grant from the 2004 Summer Research Program of the School of Business of Virginia Commonwealth University.
Copyright:
Copyright 2008 Elsevier B.V., All rights reserved.

PY - 2006/10

Y1 - 2006/10

N2 - 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.

AB - 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.

KW - Attribute discretization

KW - Concurrency control

KW - Knowledge discovery

KW - Lock tables

KW - Parametric linear programming

KW - Program segmentation

UR - http://www.scopus.com/inward/record.url?scp=30044444798&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=30044444798&partnerID=8YFLogxK

U2 - 10.1016/j.omega.2005.01.008

DO - 10.1016/j.omega.2005.01.008

M3 - Article

AN - SCOPUS:30044444798

VL - 34

SP - 492

EP - 500

JO - Omega

JF - Omega

SN - 0305-0483

IS - 5

ER -