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

Re: Querying Saints in our Book (2)

by LanX (Saint)
on May 17, 2016 at 13:31 UTC ( [id://1163204]=note: print w/replies, xml ) Need Help??


in reply to Querying Saints in our Book (2)

I'd exclude the chosen one who started with 1e6 XPs ahead of others ! ;-)

Cheers Rolf
(addicted to the Perl Programming Language and ☆☆☆☆ :)
Je suis Charlie!

Replies are listed 'Best First'.
Re^2: Querying Saints in our Book (2)
by chacham (Prior) on May 17, 2016 at 14:22 UTC

    He was excluded from the beginning, as his numbers really mess up the average.

      ahhh ... *_X are the corrected numbers .... got it.

      You might be interested in Median and other techniques to eliminate outliers.

      You could even cluster different user types ( "voters" vs "posters" )

      Personally I'd like to see a XP per response level stat ( Re^n: ), but accessing the DB is outside of your possibilities.

      Cheers Rolf
      (addicted to the Perl Programming Language and ☆☆☆☆ :)
      Je suis Charlie!

        Sure, using median might help, as would grouping. Any suggestions as to the criteria? :)

        I'd like to see a XP per response level stat ( Re^n: ), but accessing the DB is outside of your possibilities.

        Yeah, if only i had db access. It'd be fun to write and run all those queries.

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others musing on the Monastery: (1)
As of 2024-04-24 16:12 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found