Applications of clustering to information system design

Abstract Given the difficulty of designing and creating information systems of many components and interconnections, it is commonplace to find these tasks accomplished by means of a partition into subsystems. Later the distinct subsystems are made to interface with one another and an overall system is achieved. The purpose of the present paper is to point out the availability of methods for effecting the partition in optimal or approximately optimal ways. Clustering algorithms for the specific case of information systems are obtained and exemplified.

[1]  B. S. Duran,et al.  Cluster Analysis: A Survey , 1974 .

[2]  S. C. Johnson.  Hierarchical clustering schemes , 1967, Psychometrika.

[3]  H. A. Spang.  Distributed Computer Systems for Control , 1976 .

[4]  Keinosuke Fukunaga,et al.  A Branch and Bound Clustering Algorithm , 1975, IEEE Transactions on Computers.

[5]  Samuel Schiminovich,et al.  A clustering experiment: First step towards a computer-generated classification scheme , 1968, Inf. Storage Retr..

[6]  Robert E. Jensen,et al.  A Dynamic Programming Algorithm for Cluster Analysis , 1969, Oper. Res..

[7]  James V. Hansen,et al.  ISMS: Computer-Aided Analysis for Design of Decision-Support Systems , 1979 .

[8]  H. Crowder,et al.  Cluster Analysis: An Application of Lagrangian Relaxation , 1979 .

[9]  Calvin C. Gotlieb,et al.  Semantic Clustering of Index Terms , 1968, J. ACM.

[10]  Brian W. Kernighan,et al.  An efficient heuristic procedure for partitioning graphs , 1970, Bell Syst. Tech. J..

[11]  Larry E. Stanfel,et al.  A counter-example to a clustering heuristic , 1981, Inf. Syst..

[12]  Seweryna Łuszczewska-Romahnowa.  Classification as a kind of distance function. Natural classifications , 1961 .

[13]  John A. Hartigan,et al.  Clustering Algorithms , 1975 .

[14]  Larry E. Stanfel,et al.  A Lagrangian treatment of certain nonlinear clustering problems , 1981 .

[15]  Harvey J. Everett.  Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of Resources , 1963 .

[16]  M. Rao.  Cluster Analysis and Mathematical Programming , 1971 .

[17]  G. Nemhauser,et al.  Integer Programming , 2020 .

[18]  Michael R. Anderberg,et al.  Cluster Analysis for Applications , 1973 .

[19]  Gerard Salton,et al.  Generation and search of clustered files , 1978, TODS.

[20]  Larry E. Stanfel,et al.  Experiments with a very efficient heuristic for clustering problems , 1979, Inf. Syst..

[21]  James A. Senn.  Information Systems in Management , 1978 .