𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Fuzzy clustering algorithms based on the maximum likelihood priciple

✍ Scribed by E. Trauwaert; L. Kaufman; P. Rousseeuw


Publisher
Elsevier Science
Year
1991
Tongue
English
Weight
739 KB
Volume
42
Category
Article
ISSN
0165-0114

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Gaussian clustering method based on maxi
✍ Rui-Ping Li; Masao Mukaidono πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 390 KB

A new method of fuzzy clustering is proposed. This is a complete Gaussian membership function derived by means of the maximum-entropy interpretation. Compared to the traditional fuzzy c-means (FCM) method, our approach exhibits the following two advantages: (1) having clearer physical meaning and we

Algorithms of nonlinear document cluster
✍ Kiyotaka Mizutani; Ryo Inokuchi; Sadaaki Miyamoto πŸ“‚ Article πŸ“… 2008 πŸ› John Wiley and Sons 🌐 English βš– 553 KB

Fuzzy multiset is applicable as a model of information retrieval because it has the mathematical structure that expresses the number and the degree of attribution of an element simultaneously. Therefore, fuzzy multisets can be used also as a suitable model for document clustering. This paper aims at

Fuzzy clustering algorithms based on res
✍ Xiangwei Kong; Renying Wang; Guoping Li πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 124 KB

This paper presents an idea of clustering resolution. On the basis of the idea, fuzzy clustering algorithms based on resolution are deduced, which naturally comprise a set of clustering algorithms. Thus, c-means algorithm and fuzzy c-means algorithms are actually special examples in the set. As an a

Comments on β€˜non-convergence of the appr
✍ Lennart Ljung πŸ“‚ Article πŸ“… 1980 πŸ› Elsevier Science 🌐 English βš– 130 KB

The following three comments and claims are made: 1. The 'approximate maximum likelihood method ' [called RELS in (S6derstr6m et al., 1978)] may work well in applications even though it has been proven that it does not always converge. 2. It was incorrect in (\* Ljung et al., 1975) to call the 'si

A tabu search-based algorithm for the fu
✍ Khaled S Al-Sultan; Chawki A Fedjki πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 597 KB

The Fuzzy Clustering Problem (FCP) is a mathematical program which is difficult to solve since it is nonconvex, which implies possession of many local minima. The fuzzy C-means heuristic is the widely known approach to this problem, but it is guaranteed only to yield local minima. In this paper, we