Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid
 
PerlMonks  

Re: Optimizing a naive clustering algorithm

by RichardK (Vicar)
on Apr 15, 2014 at 17:38 UTC ( #1082370=note: print w/ replies, xml ) Need Help??


in reply to Optimizing a naive clustering algorithm

I haven't read about the concept (yet!) so I'm just commenting on your code.

Copying and manipulating those hashes in max_diff is going to be slow, lots of memory copies, and if I've understood correctly you don't need to do it that way. Wouldn't something like this give you the number you need?

sub max_diff { ... my $count = 0; for (keys %{$hash1}) { $count++ unless exists $hash2->{$_}; } for (keys %{$hash2}) { $count++ unless exists $hash1->{$_}; } return $count;


Comment on Re: Optimizing a naive clustering algorithm
Download Code
Re^2: Optimizing a naive clustering algorithm
by BUU (Prior) on Apr 15, 2014 at 18:23 UTC
    Ha, yes, I think you're right. I don't think it solves the overall problem but its a good catch.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (13)
As of 2015-07-02 10:46 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (34 votes), past polls