Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Julia Programming Projects

You're reading from   Julia Programming Projects Learn Julia 1.x by building apps for data analysis, visualization, machine learning, and the web

Arrow left icon
Product type Paperback
Published in Dec 2018
Publisher Packt
ISBN-13 9781788292740
Length 500 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Adrian Salceanu Adrian Salceanu
Author Profile Icon Adrian Salceanu
Adrian Salceanu
Arrow right icon
View More author details
Toc

Table of Contents (13) Chapters Close

Preface 1. Getting Started with Julia Programming FREE CHAPTER 2. Creating Our First Julia App 3. Setting Up the Wiki Game 4. Building the Wiki Game Web Crawler 5. Adding a Web UI for the Wiki Game 6. Implementing Recommender Systems with Julia 7. Machine Learning for Recommender Systems 8. Leveraging Unsupervised Learning Techniques 9. Working with Dates, Times, and Time Series 10. Time Series Forecasting 11. Creating Julia Packages 12. Other Books You May Enjoy

Unsupervised machine learning with clustering


Julia's package ecosystem provides a dedicated library for clustering. Unsurprisingly, it's called Clustering.We can simply executepkg> add Clusteringto install it. TheClusteringpackage implements a few common clustering algorithms—k-means,affinity propagation,DBSCAN,andkmedoids.

The k-means algorithm

The k-means algorithm is one of the most popular ones, providing a balanced combination of good results and good performance in a wide range of applications. However, one complication is that we're required to give it the number of clusters beforehand. More exactly, this number, called k (hence the first letter of the name of the algorithm), represents the number of centroids. A centroid is a point that is representative of each cluster.

The k-means algorithm applies an iterative approach—it places the centroids using the algorithm defined by the seeding procedure, then it assigns each point to its corresponding centroid, the mean to which is closest...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $19.99/month. Cancel anytime
Banner background image