%0 Journal Article
	%A Olli Luoma and  Johannes Tuikkala and  Olli Nevalainen
	%D 2007
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 4, 2007
	%T Accelerating GLA with an M-Tree 
	%U https://publications.waset.org/pdf/80
	%V 4
	%X 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. 
	%P 1109 - 1112