Elkan's k-Means for Graphs

Details Elkan's k-Means for Graphs Elkan's k-Means for Graphs

2009-12-23

arxiv.org/abs/0912.4598v1

Computer Science

Artificial Intelligence

21 pages; submitted to MLJ

Scientific paper

This paper extends k-means algorithms from the Euclidean domain to the domain of graphs. To recompute the centroids, we apply subgradient methods for solving the optimization-based formulation of the sample mean of graphs. To accelerate the k-means algorithm for graphs without trading computational time against solution quality, we avoid unnecessary graph distance calculations by exploiting the triangle inequality of the underlying distance metric following Elkan's k-means algorithm proposed in \cite{Elkan03}. In experiments we show that the accelerated k-means algorithm are faster than the standard k-means algorithm for graphs provided there is a cluster structure in the data.

Affiliated with

Also associated with

No associations

Rating

Elkan's k-Means for Graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Elkan's k-Means for Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Elkan's k-Means for Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-362945