Re^2: Super Search by Reputation

I understood your point. Mine was that there are better ways to approach this. New Monks may not know who the most prolific and helpful Monks are, but e.g. we could take the top 25 Monks based on XP that have been active recently and offer an option to only show nodes by them. I'm certain that would prove more useful than trying to use noderep directly (of course ruffling feathers, ego, etc. are potential downsides to this approach).

Elda Taluta; Sarks Sark; Ark Arks

Comment on Re^2: Super Search by Reputation

Replies are listed 'Best First'.
Re^3: Super Search by Reputation by Your Mother (Archbishop) on Jan 30, 2010 at 00:06 UTC
Your suggestion, being XP based, is basically a reflection of the reputation approach. Reputation searching would miss gems but it would be extremely helpful overall. Setting a threshold might be nice. Only nodes 10+. That would miss few, if any, of the gems while weeding out lots of noise. If I ask an Excel question, I probably want an answer from jmcnamara. If I ask an inline C question, I probably want an answer from syphilis. If I ask a Moose question, I probably want an answer from stvn. If I ask an Ajax question, I am vain enough to suggest I probably want an answer from myself. None of these monks is in the top 25 or even 50.	[reply]
Re^4: Super Search by Reputation by Argel (Prior) on Jan 30, 2010 at 00:38 UTC
++ The benefit of using noderep in an indrect manner is that very prolific and helpful high ranking Monks will often have a combination of high noderep and low noderep posts even though the quality of the answers will usually always be very good. So filtering on the Monk instead of noderep will in theory generate better results. Maybe a combination approach would work -- show all nodes with noderep > 15 but also show nodes with noderep > 0 for a select list of Monks. Elda Taluta; Sarks Sark; Ark Arks	[reply]


Think about Loose Coupling
	PerlMonks