A Self-Tuning Version for the Fuzzy-Possibilistic Product Partition c-Means Algorithm

The fuzzy-possibilistic product partition c-means (FPPPCM) algorithm was proposed as a robust solution to the c-means clustering problem, in which outlier data behave similarly to distant objects in gravity systems. Although FPP-PCM reliably provides fine partitions when its parameters are well chosen, things can be difficult when it is not initialized properly. To avoid such cases, this paper proposes a self-tuning version of the FPPPCM algorithm, which incorporates some cluster size controlling variables into the objective function that allow for the adjustment of the so-called possibilistic penalty terms during the alternative optimization process. The proposed method was evaluated using four standard test datasets in three different scenarios: (1) no added noise; (2) a single outlier added; (3) multiple noisy items added. The partitions provided by the proposed algorithm were evaluated based on cluster purity, normalized mutual information and adjusted Rand index, and was compared with the outcome of previous clustering models. The proposed method performed better or at least at the same quality level at previous ones, while reducing the number of parameters the user is responsible for.

Authors

Institutions

Publication Details

Published
2024-10-06
DOI
https://doi.org/10.1109/smc54092.2024.10831046
Primary Topic
Multi-Criteria Decision Making
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A Self-Tuning Version for the Fuzzy-Possibilistic Product Partition c-Means Algorithm

Levente Kovács, László Szilágyi, Vladik Kreinovich, Mirtill-Bogláirka Naghil
Multi-Criteria Decision Making
article

A Self-Tuning Version for the Fuzzy-Possibilistic Product Partition c-Means Algorithm

Levente Kovács, László Szilágyi, Vladik Kreinovich, Mirtill-Bogláirka Naghil
article en

Abstract

The fuzzy-possibilistic product partition c-means (FPPPCM) algorithm was proposed as a robust solution to the c-means clustering problem, in which outlier data behave similarly to distant objects in gravity systems. Although FPP-PCM reliably provides fine partitions when its parameters are well chosen, things can be difficult when it is not initialized properly. To avoid such cases, this paper proposes a self-tuning version of the FPPPCM algorithm, which incorporates some cluster size controlling variables into the objective function that allow for the adjustment of the so-called possibilistic penalty terms during the alternative optimization process. The proposed method was evaluated using four standard test datasets in three different scenarios: (1) no added noise; (2) a single outlier added; (3) multiple noisy items added. The partitions provided by the proposed algorithm were evaluated based on cluster purity, normalized mutual information and adjusted Rand index, and was compared with the outcome of previous clustering models. The proposed method performed better or at least at the same quality level at previous ones, while reducing the number of parameters the user is responsible for.

The University of Texas at El Paso (US), Buda Health Center (HU)
Openalex Percentile: Top 68%
Multi-Criteria Decision Making
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A Self-Tuning Version for the Fuzzy-Possibilistic Product Partition c-Means Algorithm — Levente Kovács, László Szilágyi, et al. · (2024) | TGRS Research Map | TGRS