Space-conserving agglomerative algorithms |
| |
| Authors: | Zhenmin Chen John W. Van Ness |
| |
| Affiliation: | (1) Present address: Department of Statistics, Florida International University, University Park, 33199 Miami, FL, USA;(2) Present address: Programs in Mathematical Sciences, The University of Texas at Dallas, Box 830688, 75083 Richardson, TX, USA |
| |
| Abstract: | This paper evaluates a general, infinite family of clustering algorithms, called the Lance and Williams algorithms, with respect to the space-conserving criterion. An admissible clustering criterion is defined using the space conserving idea. Necessary and sufficient conditions for Lance and Williams clustering algorithms to satisfy space-conserving admissibility are provided. Space-dilating, space-contracting, and well-structured clustering algorithms are also discussed.The work of J. Van Ness was supported by NSF Grant #DMS 9201075. |
| |
| Keywords: | Space-conserving clustering Agglomerative clustering Lance and Williams algorithm Admissible Well-structured clustering |
| 本文献已被 SpringerLink 等数据库收录！ |
|
