• TUCS Publication Series
• How to Publish in TUCS Series
• Publication Search
• Publication Graph
• Publication Input
• Publication Input Guide
• JuFo Browser

Accelerating GLA with an M-Tree

Olli Luoma, Johannes Tuikkala, Olli Nevalainen, Accelerating GLA with an M-Tree. In: Cemal Ardil (Ed.), Proceedings of the Second World Enformatika Congress (WEC'05), ENFORMATIKA 1, 196-199, 2005.

Abstract:

In this paper, we propose a novel improvement for the generalized
Lloyd Algorithm (GLA). Our algorithm makes use of an M-tree index
built on the codebook which makes it possible to reduce the number
of distance computations when the nearest code words are searched.
Our method does not impose the use of any specific distance function,
but works with any metric distance, making it more general than many
other fast GLA variants. Finally, we present the positive results of
our performance experiments.

BibTeX entry:

@INPROCEEDINGS{inpLuTuNe05a,
  title = {Accelerating GLA with an M-Tree},
  booktitle = {Proceedings of the Second World Enformatika Congress (WEC'05)},
  author = {Luoma, Olli and Tuikkala, Johannes and Nevalainen, Olli},
  volume = {1},
  number = {1},
  series = {ENFORMATIKA},
  editor = {Ardil, Cemal},
  pages = {196-199},
  year = {2005},
}

Belongs to TUCS Research Unit(s): Algorithmics and Computational Intelligence Group (ACI)

Edit publication