|There's more than one way to do things|
Re: What is the best way to store and look-up a "similarity vector"?by BrowserUk (Pope)
|on Nov 14, 2013 at 17:07 UTC||Need Help??|
But is that how a project like Panopticlick calculates "similarity" across bit-vectors?
I've no idea about pana-pano, that thing, but ostensibly, it can be as simple as counting the number of matching bits (properties):
For parts/product catalogue type applications, bit-mapped data records can be very effective and efficient, because their attributes tend to have a fixed (and limited) number of values. Ie. Half a dozen colors; half a dozen sizes; 2 or 3 finishes; etc. That means each choice can be represented by a bit position in a vector. Selection can be extremely fast.
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.