From wikipedia
k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining. k-means clustering aims to partition n observations into k clusters in which each observation belongs to the cluster with the nearest mean, serving as a prototype of the cluster. This results in a partitioning of the data space into Voronoi cells.
| CLIWOC15.csv | |
| *.shp | |
| ne* | |
| .RData* | |
| .Rhistory |
| CLIWOC15.csv | |
| *.shp | |
| ne* | |
| .RData* | |
| .Rhistory |
| CLIWOC15.csv | |
| *.shp | |
| ne* | |
| .RData* | |
| .Rhistory |
Daily changes in the Amsterdam Exchange for each year in the past 20 years. Data from Yahoo finance.
Daily changes in the Amsterdam Exchange for each year in small multiples per month. Data from Yahoo finance.
Average house value ('WOZ waarde') in the city of Utrecht (2013). Data from Statistics Netherlands (CBS).
Small multiples for the minimum and maximum monthly changes in the Amsterdam Exchange. Data from Yahoo finance.
| height: 720 | |
| license: MIT | |
| border: no |
| *.dbf | |
| *.prj | |
| *.shp | |
| *.shx | |
| lamppost.json |