Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re: Super Search by Reputation

by graff (Chancellor)
on Jan 30, 2010 at 03:07 UTC ( #820446=note: print w/ replies, xml ) Need Help??


in reply to Super Search by Reputation

It seems to me that threads can vary widely in the amount of readership they attract (and number of votes they accumulate). Threads that get "front-paged" to The Monastery Gates tend to collect a lot more votes, regardless of any other factor. So basing anything on just the raw reputation scores is going to risk missing some good material that happens to be in relatively obscure threads.

Something that might prove effective would be a variation on the color-shading that we see in the Recent Threads display, where node age is the property of interest, and things are bolder/darker the more recent they are.

If the prominence scale for display is based on something like "relative node value within the thread" (possibly weighted by the overall magnitude of positive votes in the thread), the most prominent search results will usually (or often) be those that gave the best solution to a given problem (with perhaps some bias given to nodes/threads that attracted a lot of appreciative attention).

Given that this has already been done for node age, it might not be too hard to do it for node reputation.


Comment on Re: Super Search by Reputation

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others lurking in the Monastery: (3)
As of 2014-09-22 00:08 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    How do you remember the number of days in each month?











    Results (176 votes), past polls