Skip to content

The project is mainly to demonstrate the performance in terms of convergence for Random Initialisation and K++ for K-Means Algorithm.

Notifications You must be signed in to change notification settings

Nanthini10/K-Means-on-Yahoo-Click-log

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
 
 
 
 

Repository files navigation

K-Means-for-Yahoo-Click-Log

Dataset can be obtained from https://webscope.sandbox.yahoo.com/catalog.php?datatype=r&did=49

The project is mainly to demonstrate the performance in terms of convergence for Random Initialisation and K++ for K-Means Algorithm.

K-Means is a clustering algorithm commonly used in unsupervised learning.

It aims at partitioning the dataset into K partitions.

Random Initialisation

  • The cluster centroids are picked at random from the data instances.

K++

  • Picks points that are as far away as possible

  • This helps in picking points in a smarter way

About

The project is mainly to demonstrate the performance in terms of convergence for Random Initialisation and K++ for K-Means Algorithm.

Topics

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages