Beefy Boxes and Bandwidth Generously Provided by pair Networks
Think about Loose Coupling
 
PerlMonks  

Re: Hashes: Find similar entries!

by hdb (Monsignor)
on Dec 17, 2015 at 08:10 UTC ( [id://1150597]=note: print w/replies, xml ) Need Help??


in reply to Hashes: Find similar entries!

In a similar line of thought as Corion's I would rather consider distance than similarity. You could use the square root of sum of square of the differences of entries in your list (a.k.a. Euklidean distance) and then call the ones similar that are close with respect to that measure of distance.

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://1150597]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others goofing around in the Monastery: (1)
As of 2024-04-18 23:36 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found