Performance analysis for clustering algorithms (Q2224130)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 7305402
Language Label Description Also known as
default for all languages
No label defined
    English
    Performance analysis for clustering algorithms
    scientific article; zbMATH DE number 7305402

      Statements

      Performance analysis for clustering algorithms (English)
      0 references
      0 references
      0 references
      0 references
      3 February 2021
      0 references
      Summary: There are lots of algorithms for optimal clustering. The main part of clustering algorithms includes the K-means, fuzzy c-means (FCM) and evolution algorithm. The main purpose of this paper was to research the performance and characteristics of these three types of algorithms. One criteria (clustering validity index), namely TRW, was used in the optimisation of classification and eight real-world datasets (glass, wine, ionosphere, biodegradation, connectionist bench, hill-valley, musk, madelon datasets), whose dimension became higher, were applied. We made a performance analysis and concluded that it was easy of the K-means and FCM to fall into a local minimum, and the hybrid algorithm was found more reliable and more efficient, especially on difficult tasks with high dimension.
      0 references
      optimal clustering
      0 references
      K-means clustering
      0 references
      fuzzy c-means
      0 references
      FCM clustering
      0 references
      hybrid differential evolution
      0 references
      performance analysis
      0 references
      high dimension
      0 references
      performance evaluation
      0 references
      clustering algorithms
      0 references

      Identifiers