MaxMin Linear Initialization for Fuzzy C-Means

Abstract : Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters, as is the case in text categorization. Thus, we need more flexible clustering. Fuzzy clustering methods, where each data point can belong to several clusters, are an interesting alternative. Yet, seeding iterative fuzzy algorithms to achieve high quality clustering is an issue. In this paper, we propose a new linear and efficient initialization algorithm MaxMin Linear to deal with this problem. Then, we validate our theoretical results through extensive experiments on a variety of numerical real-world and artificial datasets. We also test several validity indices, including a new validity index that we propose, Transformed Standardized Fuzzy Difference (TSFD).
Complete list of metadatas

Cited literature [1 references]  Display  Hide  Download
Contributor : Jérôme Darmont <>
Submitted on : Monday, July 30, 2018 - 4:32:58 PM
Last modification on : Wednesday, October 31, 2018 - 12:24:26 PM
Long-term archiving on : Wednesday, October 31, 2018 - 2:21:47 PM


Files produced by the author(s)


  • HAL Id : hal-01771204, version 1
  • ARXIV : 1808.00197



Aybükë Oztürk, Stéphane Lallich, Jérôme Darmont, Sylvie Yona Waksman. MaxMin Linear Initialization for Fuzzy C-Means. 14th International Conference on Machine Learning and Data Mining (MLDM 2018), Jul 2018, New York, United States. pp.1-15. ⟨hal-01771204⟩



Record views


Files downloads