Fuzzy clustering with Minkowski distance

Patrick Groenen (), U. Kaymak and J.M. van Rosmalen
Additional contact information
J.M. van Rosmalen: Erasmus Econometric Institute

No EI 2006-24 Revision_Date: 2009-07-29, Econometric Institute Report from Erasmus University Rotterdam, Econometric Institute

Abstract: Distances in the well known fuzzy c-means algorithm of Bezdek (1973) are measured by the squared Euclidean distance. Other distances have been used as well in fuzzy clustering. For example, Jajuga (1991) proposed to use the L_1-distance and Bobrowski and Bezdek (1991) also used the L_infty-distance. For the more general case of Minkowski distance and the case of using a root of the squared Minkowski distance, Groenen and Jajuga (2001) introduced a majorization algorithm to minimize the error. One of the advantages of iterative majorization is that it is a guaranteed descent algorithm, so that every iteration reduces the error until convergence is reached. However, their algorithm was limited to the case of Minkowski parameter between 1 and 2, that is, between the L_1-distance and the Euclidean distance. Here, we extend their majorization algorithm to any Minkowski distance with Minkowski parameter greater than (or equal to) 1. This extension also includes the case of the L_infty-distance. We also investigate how well this algorithm performs and present an empirical application.

Date: 2006-07-06

Downloads: (external link)
http://hdl.handle.net/1765/7873 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: http://EconPapers.repec.org/RePEc:dgr:eureir:1765007873

Access Statistics for this paper

More papers in Econometric Institute Report from Erasmus University Rotterdam, Econometric Institute
Series data maintained by Anneke Kop ().