Fisher: A turbo pascal unit for optimal partitions
1990; Elsevier BV; Volume: 16; Issue: 5 Linguagem: Inglês
10.1016/0098-3004(90)90029-s
ISSN1873-7803
Autores Tópico(s)Advanced Clustering Algorithms Research
ResumoAn algorithm for calculating optimal partitions of one-dimensional data sets was described by Fisher in 1958, and a few FORTRAN implementations of the algorithm have been released. A Turbo Pascal implementation of the Fisher algorithm is presented which is capable of partitioning a data set of 1000 objects into 20 groups in about 5 min on a microcomputer. An efficient method of calculating running absolute deviations from medians, and a test for determining the uniqueness of the solution are provided.
Referência(s)