need to
be tokenized. You solved my problem!!!
Thank you all very much!
Regards,
Lorenzo
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
ltiple field values at once.
Please help me! Thank you in advance.
Lorenzo
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
think you
should consider converting the files to XML. Otherwise post a sketch of your
indexing code to get some help.
Lorenzo
On 4/21/06, Malcolm Clark <[EMAIL PROTECTED]> wrote:
>
> Hi all,
> I didn't know whether to add this to the thread asking about TREC indexing
> or st
age (in different
directories)?
Thank you in advance.
Lorenzo
-
To unsubscribe, e-mail: [EMAIL PROTECTED]
For additional commands, e-mail: [EMAIL PROTECTED]
on a
specific Similarity implementation?), I have to tell you that It wouldn't be
so easy to integrate LSI into the Lucene's APIs.
Lorenzo
On 12/1/05, Chandana <[EMAIL PROTECTED]> wrote:
>
> Have any one implemented LSI in Lucene?
> Kindly let me know how hard/easy it is.
>
> thanks
> chandana
>
>
Clustering is an intensive task. Carrot2 is an excellent framework that
clusters documents and even labels them, and it takes a few seconds (up to
two seconds) to cluster 100 search results snippets.
If you are going to cluster entire documents you'll have to wait longer.
Lorenzo
On 11/
ocuments. But how to choose the initial subset? Maybe just searching the
index and then using the first n documents retrieved.
Any idea?
Lorenzo
On 10/7/05, Paul Libbrecht <[EMAIL PROTECTED]> wrote:
>
>
> I've met other persons with such needs and we would also be interested.
ammar. Can someone help me with the right
syntax?
Thanks,
Lorenzo
, I'm just
trying to offer a simpler (much simpler!) clustering opportunity for lucene
users.
Hope I can get some good advices from you!
ciao,
Lorenzo
On 6/8/05, Dawid Weiss <[EMAIL PROTECTED]> wrote:
>
>
> You should state your requirements clearly:
>
> 1. What d
ome
tests.
bye
Lorenzo
Daniel, could you explain to me why you are using em clustering? Is there
any best field or case for that technique?
I don't have any em experience and would like to know something about that
(just studying some papers...)
Thanks,
Lorenzo
k, based on a tf idf
analysis (not thinking of k-means or EM 'til now).
The most interesting problem is creating the architecture for such a system,
being general purpose but also very efficient.
Thanks,
Lorenzo
On 6/8/05, Daniel Stephan <[EMAIL PROTECTED]> wrote:
>
> I am curr
SoC if we find some other people interested in it.
Lorenzo
On 6/7/05, Lorenzo <[EMAIL PROTECTED]> wrote:
>
> I'm writing this message trying to find some people interested in creating
> a 'general purpose' lucene search results' clustering extension.
> I w
ring
implementation. I know that maybe each project need a different
implementation but that would be a useful basis for everyone to develop his
own project.
Is anyone interested in it?
Lorenzo
; in addition to
that mergeFactor sets at the same time the maximum number of segments that
will be present in the index. When the number is equal to mergeFactor Lucene
tries to merge all the segments into a new one.
Ciao,
Lorenzo
On 5/8/05, Barbara Krausz <[EMAIL PROTECTED]> wrote:
&
15 matches
Mail list logo