How to use the algorithm for the comparison of two lists of features?

[GoogleCodeExporter]

I wonder if you would have some pointer to use the all pair comparison code
between two lists instead of within one list

Original issue reported on code.google.com by pombreda...@gmail.com on 21 Jul 2009 at 11:38

[GoogleCodeExporter]

Hi, I'm not sure I understand the question.  Can you clarify?

Original comment by roberto....@gmail.com on 3 Jan 2010 at 4:00

[GoogleCodeExporter]

Original comment by roberto....@gmail.com on 23 Jan 2010 at 6:40

• Changed state: Invalid

[GoogleCodeExporter]

Roberto: Sorry for teh late reply but for whatever reason, the first 
notification
about your Jan 2nd question got lost in my spam filter.
What I meant is the ability to provide as an input not one dataset but two 
dataset.
In this setting, one dataset would be some "reference" and the second dataset a
"query" dataset. 
The goal would be to find all items in the "query" set that are similar to 
items in
the "reference" data set above a certain threshold: basically returning the
similarity intersection between the two sets as opposed to the current setting 
where
only pairs within the same are considered. I guess one way could be to merge 
the sets
and discard pairs returned from the same set, though that does seem pretty 
naive.  

Original comment by pombreda...@gmail.com on 26 Jan 2010 at 6:53