Re: What index structure does kNN algorithm use in mahout?

Do you mean K-Means? On Jan 7, 2010, at 3:50 AM, xiao yang wrote: Like R-tree. Or it compares each record for every query? Thanks! Xiao -- Grant Ingersoll http://www.lucidimagination.com/ Search the Lucene ecosystem using Solr/Lucene:

Re: What index structure does kNN algorithm use in mahout?

kNN stands for k-nearest neighbor. On Fri, Jan 8, 2010 at 3:34 AM, Grant Ingersoll gsing...@apache.org wrote: Do you mean K-Means? On Jan 7, 2010, at 3:50 AM, xiao yang wrote: Like R-tree. Or it compares each record for every query? Thanks! Xiao -- Grant

Re: What index structure does kNN algorithm use in mahout?

On Jan 8, 2010, at 2:17 PM, Ted Dunning wrote: kNN stands for k-nearest neighbor. Yeah, I know. Just wasn't sure on the context of the question. On Fri, Jan 8, 2010 at 3:34 AM, Grant Ingersoll gsing...@apache.org wrote: Do you mean K-Means? On Jan 7, 2010, at 3:50 AM, xiao yang