Computing nearest neighbors for moving points and applications to clustering

Tapas Kanungo; David M. Mount; Nathan S. Netanyahu; Christine Piatko; Ruth Silverman; Angela Y. Wu

Computing nearest neighbors for moving points and applications to clustering

Tapas Kanungo, David M. Mount, Nathan S. Netanyahu, Christine Piatko, Ruth Silverman, Angela Y. Wu

University of Maryland, College Park

Research output: Contribution to conference › Paper › peer-review

19 Scopus citations

Abstract

It was observed that after an initial phase of rapid movement of the center points, the k-means algorithm tends to settle into a long phase where the center points move very slowly. This suggests that a smart algorithm should attempt to update nearest neighbors incrementally after the center moves, rather than recompute them from scratch each time. An algorithm has been especially developed for this purpose, and is analyzed as a function of the distances that the centers move.

Original language	English
Pages	S931-S932
State	Published - 1999
Externally published	Yes
Event	Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms - Baltimore, MD, USA Duration: 17 Jan 1999 → 19 Jan 1999

Conference

Conference	Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms
City	Baltimore, MD, USA
Period	17/01/99 → 19/01/99

Cite this

@conference{b88f441eb4894dd3b4c90e6040c5f267,

title = "Computing nearest neighbors for moving points and applications to clustering",

abstract = "It was observed that after an initial phase of rapid movement of the center points, the k-means algorithm tends to settle into a long phase where the center points move very slowly. This suggests that a smart algorithm should attempt to update nearest neighbors incrementally after the center moves, rather than recompute them from scratch each time. An algorithm has been especially developed for this purpose, and is analyzed as a function of the distances that the centers move.",

author = "Tapas Kanungo and Mount, {David M.} and Netanyahu, {Nathan S.} and Christine Piatko and Ruth Silverman and Wu, {Angela Y.}",

year = "1999",

language = "אנגלית",

pages = "S931--S932",

note = "Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 17-01-1999 Through 19-01-1999",

}

TY - CONF

T1 - Computing nearest neighbors for moving points and applications to clustering

AU - Kanungo, Tapas

AU - Mount, David M.

AU - Netanyahu, Nathan S.

AU - Piatko, Christine

AU - Silverman, Ruth

AU - Wu, Angela Y.

PY - 1999

Y1 - 1999

N2 - It was observed that after an initial phase of rapid movement of the center points, the k-means algorithm tends to settle into a long phase where the center points move very slowly. This suggests that a smart algorithm should attempt to update nearest neighbors incrementally after the center moves, rather than recompute them from scratch each time. An algorithm has been especially developed for this purpose, and is analyzed as a function of the distances that the centers move.

AB - It was observed that after an initial phase of rapid movement of the center points, the k-means algorithm tends to settle into a long phase where the center points move very slowly. This suggests that a smart algorithm should attempt to update nearest neighbors incrementally after the center moves, rather than recompute them from scratch each time. An algorithm has been especially developed for this purpose, and is analyzed as a function of the distances that the centers move.

UR - http://www.scopus.com/inward/record.url?scp=0032785192&partnerID=8YFLogxK

M3 - ???researchoutput.researchoutputtypes.contributiontoconference.paper???

AN - SCOPUS:0032785192

SP - S931-S932

T2 - Proceedings of the 1999 10th Annual ACM-SIAM Symposium on Discrete Algorithms

Y2 - 17 January 1999 through 19 January 1999

ER -

Computing nearest neighbors for moving points and applications to clustering

Abstract

Conference

Other files and links

Fingerprint

Cite this