A computer program for nonparametric cluster synthesis, using similarity rather than maximum likelihood as the basis for class membership, is presented. The algorithm utilizes recursive computations to develop a hierarchy or tree of nested clusters. The major components of the program are: (1) a (di
ISOETRP—an interactive clustering algorithm with new objectives
✍ Scribed by C.Y. Suen; Q.R. Wang
- Publisher
- Elsevier Science
- Year
- 1984
- Tongue
- English
- Weight
- 529 KB
- Volume
- 17
- Category
- Article
- ISSN
- 0031-3203
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
An interactive negotiation procedure for large scale systems with multiple objectives is proposed. It is assumed that there are multiple decision-makers, who have their own multiple objectives and who are dependent on each other via common resources or physical connections. The negotiation procedure
Major problems exist in both crisp and fuzzy clustering algorithms. The fuzzy c-means type of algorithms use weights determined by a power m of inverse distances that remains ÿxed over all iterations and over all clusters, even though smaller clusters should have a larger m. Our method uses a di ere