So there's a fair amount of interconnection between a node's neighbors.

So just getting it correct to a couple of digits is probably sufficient.

Cluster ordered dither

So we'd like to have a way of getting a pretty good answer in time a lot less than this.

And the answer is 2.

And if you do that, you end up with K minus one clusters instead of k clusters.

Next I want to focus for a little while on the notion of a clustering coefficient.

It's a town or so we thought.

This is a nice town.

I am going to say that the clustering coefficient for graph is just the average of the clustering coefficients of the nodes in the graph.

I actually have some friends who work on this too.

My town is not what it used to be.

Suppose we're given the following data points in a 2 dimensional space.

Suppose you are given data like this, and you wish to learn that there's 2 clusters a cluster over here and a cluster over here.

And second, to narrow this down, it feels that there are clusters of data the way I do it.

K Means is an iterative algorithm and it does two things.

C6 equals to and similarly well c10 equals, too, right?

City of lights.

let's go through how this is often defined.

ModiCity.

MAD Growth on Columbus Circle. ReefCity.

A Web of Time.

Daily Battles.

It's a city?

This is my town.

City of gold.

This is my city.

All the data points on the left correspond to the red cluster, and the ones on the right to the green cluster.

So as a concrete example, let's say that one of my cluster centroids, let's say cluster centroid two, has training examples, you know, 1, 5, 6, and 10 assigned to it.

The last question asked, what is the maximum clustering coefficient for a node in B?

I'm going to do. The first step is to randomly initialize two points, called the cluster centroids.

Next is lower case k.

And so in the earlier diagram, the cluster centroids corresponded to the

Does this bus go to the center of town?

I didn't have money to go to a movie. But I found that on the

He actually had a car accident.

Yeah. My parents bought a place on Elm Street.

Mister... Mister, how can I get to Old Arbat?

Airline, train, hotels, hospitals.

Apparently, it's all over town.

City of Angels...

K means estimates for a fixed number of k. Here k 2.

So the optimal cluster center would be the halfway point in the middle.

It's likely somewhere over here where I drew the red dot.

So, let me do that now.