mplement something similar.
>
> Cheers,
> Dan
>
But if f(D) is dependent on the query, how can it be precomputed and cached?
Can I get a sorted hits enumerator from IndexReader, and just compute the scores
of the top N
W.
Hi Peter,
But the voting is query depedant, so just add a sortable vote field may not be
enough?
For example, query 'Q1' and 'Q2' can reach result 'R1', and 'Q2' can reach
result 'R2', more votes for 'R1
the returned documents number is big, will it be a performance issue?
Regards,
Xiong
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
karl wettin gmail.com> writes:
>
>
> 15 mar 2007 kl. 11.21 skrev xiong:
>
> > Just like google: the more user clicks of search results,
> > the higher rank they are.
>
> Are you really sure Google does this? It would surprise me if they did.
>
I&
Hi there,
Just like google: the more user clicks of search results,
the higher rank they are.
How to implement this in lucene?
I've read the javadoc of org.apache.lucene.search package,
but still dont know how.
Some sample code will be great.
Thanks in advance,
