๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Fast isodata clustering algorithms

โœ Scribed by N.B. Venkateswarlu; P.S.V.S.K. Raju

Publisher
Elsevier Science
Year
1992
Tongue
English
Weight
678 KB
Volume
25
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Parallel clustering algorithms
Parallel clustering algorithms
โœ Xiaobo Li; Zhixi Fang ๐Ÿ“‚ Article ๐Ÿ“… 1989 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 833 KB
Fast algorithm for identifying clusters
Fast algorithm for identifying clusters in digitized images
โœ S.E. Sobottka; R.J. Chandross; G.G. Cornick; B.D. Justice; R.S. Stewart; J.A. Th ๐Ÿ“‚ Article ๐Ÿ“… 1988 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 347 KB

A fast algorithm for identifying clusters of intense pixels in digitized two-dimensional images is described. Measurements show a decrease by several orders of magnitude over times required by an algorithm by Stoddard.

Fuzzy clustering with evolutionary algor
Fuzzy clustering with evolutionary algorithms
โœ Frank Klawonn; Annette Keller ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 220 KB ๐Ÿ‘ 1 views

Objective function-based fuzzy clustering aims at finding a fuzzy partition by optimizing a ลฝ . function that evaluates a fuzzy assignment of a given data set to clusters that are characterized by a set of parameters, the so-called prototypes. The iterative optimization technique usually requires th