Beefy Boxes and Bandwidth Generously Provided by pair Networks
Just another Perl shrine
 
PerlMonks  

Re^8: How would you code this?

by BrowserUk (Patriarch)
on Apr 08, 2016 at 19:24 UTC ( [id://1159959]=note: print w/replies, xml ) Need Help??


in reply to Re^7: How would you code this?
in thread How would you code this?

Kenneth, thanks for your continued explorations. I've been looking at this most of the day, and I think I finally made a decision.

Looking in detail at the differences between the original data (red), my original algorithm (blue); graff's agorithm (black) and your latest algorithm (green); there is one place where I think your algorithm is clearly superior: the bottom left corner of the top right zoom, where your algorithm splits the difference between mine and graff's; and I think is clearly a better reflection of the underlying trend of the original data.

However, as you pointed out, it does 'invent' points, which neither of the other two do. I also agree that in most other cases yours has a tendency to bias high.

So after much umming and aahing, I'm going with graffs algorithm. Thanks.


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". I knew I was on the right track :)
In the absence of evidence, opinion is indistinguishable from prejudice.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others contemplating the Monastery: (5)
As of 2024-04-20 02:26 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found