dendroid

dendroid

A fine software solution

Menu

  • About
  • Blog
  • Contact Us
  • Home
K-Means Clustering algorithm explained

mathematics

K-Means Clustering algorithm explained

K-Means Clustering algorithm explained

K-means clustering is used in data mining to analyze clusters. Method divides n observations into k clusters, deciding by distance from nearest mean. It tries to find centers of natural clusters in data by iterative improvement. After defining all clusters, clustering

daniel.dupal 9. May 201112. February 2016 tech No Comments Read more

Hidden Markov Models

Hidden Markov Models

The easiest way to treat sequential data would be simply to ignore the sequential aspects and treat the observations as independent and identically distributed (i.i.d.)[Bishop 2006] as shown in Figure 1. However, this approach would fail to exploit sequential patterns.

daniel.dupal 3. May 20114. March 2016 tech No Comments Read more

Recent Posts

  • Insta Feed Widget – WordPress
  • Start using Command Objects in Grails
  • Grails – Groovy On Rails first project
  • BPM Debug Helper – Mozilla add-on
  • Real view cameras

Categories

  • tech

Meta

  • Log in
  • Entries feed
  • Comments feed
  • WordPress.org
Copyright © 2025 dendroid. Powered by WordPress.
This website uses cookies to improve your experience. We'll assume you're ok with this, but you can opt-out if you wish.Accept Reject Read More
Privacy & Cookies Policy

Necessary Always Enabled