Finding groups with a simple genetic algorithm* |
| |
| Authors: | Linton C. Freeman |
| |
| Affiliation: | IRU in Mathematical Behavioral Science , University of California , Social Science Tower, Irvine, CA, 92717 |
| |
| Abstract: | A new solution to the old problem of partitioning a matrix of social proximities into groups is proposed. It draws on a heuristic developed in computer science, the simple genetic algorithm. The algorithm is described and its utility is demonstrated with applications to three standard data sets. |
| |
| Keywords: | |
|
|
