MaxMin Linear Initialization for Fuzzy C-Means

August 01, 2018 ยท Declared Dead ยท ๐Ÿ› IAPR International Conference on Machine Learning and Data Mining in Pattern Recognition

๐Ÿ‘ป CAUSE OF DEATH: Ghosted
No code link whatsoever

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Aybรผkรซ Oztรผrk, Stรฉphane Lallich, Jรฉrรดme Darmont, Sylvie Yona Waksman arXiv ID 1808.00197 Category cs.LG: Machine Learning Cross-listed cs.DB, stat.ML Citations 0 Venue IAPR International Conference on Machine Learning and Data Mining in Pattern Recognition Last Checked 4 months ago
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).
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning

Died the same way โ€” ๐Ÿ‘ป Ghosted