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

Fuzzy clustering with high contrast

โœ Scribed by P.J. Rousseeuw; E. Trauwaert; L. Kaufman

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
671 KB
Volume
64
Category
Article
ISSN
0377-0427

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fuzzy clustering with supervision
Fuzzy clustering with supervision
โœ Witold Pedrycz; George Vukovich ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 567 KB
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

Fuzzy clustering with structural constra
Fuzzy clustering with structural constraints
โœ Victor Chepoi; Dan Dumitrescu ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 510 KB

In this paper we propose a generalization of the standard clustering problem, which we call Structural Constrained Clustering (SCC) problem. In SCC problem, the cluster interconnections are given by a binary relation R. If this relation is empty then SCC problem reduces to the standard classificatio

Fuzzy clustering with squared Minkowski
Fuzzy clustering with squared Minkowski distances
โœ Patrick J.F. Groenen; Krzysztof Jajuga ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 129 KB

This paper presents a new fuzzy clustering model based on a root of the squared Minkowski distance which includes squared and unsquared Euclidean distances and the L1-distance. An algorithm is presented that is based on iterative majorization and yields a convergent series of monotone nonincreasing