Maps, functions, and arrows
Menu
  • Home
  • Table of contents
  • Cluster algorithms
  • Cortical learning algorithms
Mathematics $\cap$ Coding
Browse: Home » voronoi diagram

K-Means, coverings, and Voronoi diagrams

January 23, 2015 · by Mirko · in Algorithms, Cluster algorithms, Data analysis

This is the 4th of a series of posts on cluster-algorithms and ideas in data analysis. The $k$-Means algorithm computes a Voronoi partition of the data set such that each landmark is given by the centroid of the corresponding cell….

Tags

algorithm Ayasdi cluster cluster algorithm clustering code covering data analysis data visualization DBSCAN density-based generalized Reeb graph Gunnar Carlsson implementation k-means Mapper OPTICS python simplicial complex spatial data spatial pooling topological data analysis voronoi cell voronoi diagram witness complex

Search

Find me on Google Plus

Meta

  • Log in
  • Entries RSS
  • Comments RSS
  • WordPress.org

Recent Posts

  • Q&A – My experience as Numenta’s First Visiting Researcher
  • Finite-Sample Expressivity of Neural Networks
  • Compression after Lempel and Ziv (LZ78)
  • Sparse distributed representations and witness complexes
  • Mapper Python Implementation

Categories

Algorithms
Cluster algorithms
Code
Python
Cortical learning algorithms
Sparse Distributed Representations
Spatial Pooling
Data analysis
Topological data analysis
density-based
Uncategorized
Visualization

Copyright © 2021 Maps, functions, and arrows

Powered by WordPress and Origin