Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

On a robust approach to search for cluster centers

From MaRDI portal
Publication:2069689
Jump to:navigation, search

DOI10.1134/S0005117921100118zbMath1493.62400OpenAlexW3215891332MaRDI QIDQ2069689

Z. M. Shibzukhov

Publication date: 21 January 2022

Published in: Automation and Remote Control (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s0005117921100118


zbMATH Keywords

robust algorithmMahalanobis distanceiterative reweightingcluster centerrobust mean


Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30)


Related Items (1)

Clustering algorithm based on feature space partitioning



Cites Work

  • Aggregation functions based on penalties
  • A deterministic annealing approach to clustering
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: On a robust approach to search for cluster centers

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2069689&oldid=14557264"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 21:39.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki