EXPERIMENTS WITH A VERY EFFICIENT HEURISTIC FOR CLUSTERING PROBLEMS

被引：3

作者：

STANFEL, LE

机构：

[1] Department of Industrial Engineering, University of Texas at Arlington, Arlington

来源：

INFORMATION SYSTEMS | 1979年 / 4卷 / 04期

关键词：

D O I：

10.1016/0306-4379(79)90022-X

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

A method is described for solving certain nonlinear clustering problems. While operating in polynomial time the method is not an algorithm and counter examples are cited, along with a linear programming methodology for constructing them. The success of the procedure when applied to real problems is discussed and some theoretical lines of investigation suggested for establishing circumstances under which convergence may be guaranteed. Finally, applications to important problems in the information sciences are reviewed, and the case of large sets of objects discussed. © 1979.

引用

页码：285 / 292

页数：8

共 15 条

[1] Stanfel, Chandrasekharan, Clustering problems, Presented at Den femte Nordiske Operasjonsanalysekongress, (1975)
[2] Karp, Reducibility among combinatorial problems, Tech. Rep., (1972)
[3] Jensen, A Dynamic Programming Algorithm for Cluster Analysis, Operations Research, 17, 6, pp. 1034-1057, (1969)
[4] Duran, Odell, Cluster Analysis—A Survey, (1975)
[5] Hadley, Nonlinear and Dynamic Programming, (1964)
[6] Sneath, Sokal, Numerical Taxonomy, (1973)
[7] Salton, Automatic Information Organization and Retrieval, (1968)
[8] Price, Schiminovich, A clustering experiment: first step towards a computer-generated classification scheme, Inform. Stor. Ret., 4, pp. 271-280, (1968)
[9] Langefors, Theoretical Analysis of Information Systems, (1973)
[10] Needham, Jones, KEYWORDS AND CLUMPS: Recent work on information retrieval at the Cambridge Language Research Unit, Journal of Documentation, 21, 1, pp. 5-15, (1964)

← 1 2 →