## Fusion yields a small, but consistent, improvement in the effectiveness of searching if an appropriate combination of coefficients is chosen

## The principal computational cost of a similarity search is identifying the bits common to two bit-strings; once these are known, calculation of the actual coefficient (or multiple coefficients) is very fast

## Data fusion of this sort may hence provide a simple, but highly cost-effective, way of enhancing existing systems for chemical similarity searching

## Need to test with non-binary data

Previous slide | Next slide | Back to first slide | View graphic version |