Fuzzy Clustering by Hyperbolic Smoothing

07/09/2022
by   David Masis, et al.
0

We propose a novel method for building fuzzy clusters of large data sets, using a smoothing numerical approach. The usual sum-of-squares criterion is relaxed so the search for good fuzzy partitions is made on a continuous space, rather than a combinatorial space as in classical methods <cit.>. The smoothing allows a conversion from a strongly non-differentiable problem into differentiable subproblems of optimization without constraints of low dimension, by using a differentiable function of infinite class. For the implementation of the algorithm we used the statistical software R and the results obtained were compared to the traditional fuzzy C–means method, proposed by Bezdek.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/09/2020

Modified Possibilistic Fuzzy C-Means Algorithm for Clustering Incomplete Data Sets

Possibilistic fuzzy c-means (PFCM) algorithm is a reliable algorithm has...
research
07/11/2012

Similarity-Driven Cluster Merging Method for Unsupervised Fuzzy Clustering

In this paper, a similarity-driven cluster merging method is proposed fo...
research
10/20/2016

An Extended Neo-Fuzzy Neuron and its Adaptive Learning Algorithm

A modification of the neo-fuzzy neuron is proposed (an extended neo-fuzz...
research
06/29/2022

Simplicial depths for fuzzy random variables

The recently defined concept of a statistical depth function for fuzzy s...
research
05/31/2022

A New Approach to Solve the Fuzzy Nonlinear Unconstraint Optimization Problem

This paper investigates fuzzy nonlinear system equations using an optimi...
research
12/08/2016

A fuzzy approach for segmentation of touching characters

The problem of correctly segmenting touching characters is an hard task ...

Please sign up or login with your details

Forgot password? Click here to reset