Category:Cluster analysis algorithms

This category contains algorithms used for cluster analysis.

Pages in category "Cluster analysis algorithms"

The following 42 pages are in this category, out of 42 total.

Next items are not visible in browsers without Javascript

A

  • Affinity propagation
  • Automatic clustering algorithms

B

  • BFR algorithm
  • BIRCH

C

  • Canopy clustering algorithm
  • Chinese whispers (clustering method)
  • Cluster-weighted modeling
  • Cobweb (clustering)
  • Complete-linkage clustering
  • Constrained clustering
  • CURE algorithm

D

  • Data stream clustering
  • DBSCAN

E

  • Expectation–maximization algorithm

F

  • FLAME clustering
  • Fuzzy clustering

H

  • Hierarchical clustering
  • Hoshen–Kopelman algorithm

I

  • Information bottleneck method

J

  • Jenks natural breaks optimization

K

  • K q-flats
  • K-means clustering
  • K-means++
  • K-medians clustering
  • K-medoids
  • K-SVD

L

  • Linde–Buzo–Gray algorithm
  • Low-energy adaptive clustering hierarchy

M

  • Mean shift

N

  • Nearest-neighbor chain algorithm
  • Neighbor joining

O

  • OPTICS algorithm

P

  • Pitman–Yor process

Q

  • Quantum clustering

S

  • Self-organizing map
  • SimRank
  • Single-linkage clustering
  • Spectral clustering
  • SUBCLU

U

  • UPGMA

W

  • Ward's method
  • WPGMA
Next items are not visible in browsers without Javascript

This category content has been reduced to only pages contained in the ZIM file.

Categories:
  • Data mining algorithms
  • Cluster analysis
  • Statistical algorithms
This page is issued from Wikipedia. The text is available under Creative Commons Attribution-Share Alike 4.0 unless otherwise noted. Additional terms may apply for the media files.