A new stochastic gradient descent possibilistic clustering algorithm

DOI10.3233/AIC-210125zbMATH Open1505.62487OpenAlexW3207704231MaRDI QIDQ5106261

Angeliki Koutsimpela, Konstantinos Koutroumbas

Publication date: 16 September 2022

Published in: AI Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3233/aic-210125

zbMATH Keywords

clusteringstochastic gradient descentpossibilistic clusteringonline clusteringonline k-means

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Online algorithms; streaming algorithms (68W27)

Cites Work

• Local convergence of the fuzzy c-means algorithms
• Pattern classification.
• FUZZY SHELL-CLUSTERING AND APPLICATIONS TO CIRCLE DETECTION IN DIGITAL IMAGES
• A Convergence Theorem for the Fuzzy ISODATA Clustering Algorithms
• Optimization Methods for Large-Scale Machine Learning
• Least squares quantization in PCM
• A Stochastic Approximation Method

Related Items (1)

The Complete Gradient Clustering Algorithm: properties in practical applications

This page was built for publication: A new stochastic gradient descent possibilistic clustering algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5106261)