Beefy Boxes and Bandwidth Generously Provided by pair Networks
go ahead... be a heretic
 
PerlMonks  

comment on

( #3333=superdoc: print w/replies, xml ) Need Help??

(Updated 20041011. Editing pass: clarified wording.)

There seem to be two points of view in this debate. The first is that the front page ought to be reserved for only the best content. The second is that the front page should emphasize the freshest content.

Why can't we say that the front page is reserved for the most interesting nodes, where a node's "interest" is determined as a function of both its "bestness" and its freshness? In other words, why can't newer nodes have an easier time getting on the front page? And, as front-page nodes age, why can't we require them to earn their continued placement in the prime real estate? If a node doesn't pull in enough reputation to say on the front page, let's take if off.

More specifically:

  1. Let's analyze the database and determine the distribution of node reputations w.r.t. age for ages in the range of new (0 hours hold) through semi-recent (say, 96 hours old).
  2. Based on our analysis, let's create a node-interest-index function f. Given a node n, let f(n) be the number of standard deviations above or below the mean that n's reputation is w.r.t. nodes of similar age.
  3. Let's set the front-page threshold at X and populate the front page with nodes n for which f(n) > X. The idea is that eligible nodes (e.g., those nominated by human front paging) will be promoted to the front page only if/after their interest index exceeds X. Similarly, nodes on the front page will be removed when their index falls below X minus a hysteresis constant H.

The key characteristic of this approach is that its easier for newer nodes to hit the front page, but they only stay if they earn their place. At any given time, the front page will be populated with a smoothly blended and gently stirred mix of the newest nodes and older, higher-quality nodes – but everything should be of high interest. Newer nodes will tend to cycle through quicker, but the better ones will earn extended stays the front page.

This seems like a solution that satisfies both points of view. What do you think about this approach?


In reply to Re: Too much Front Paging by tmoertel
in thread Too much Front Paging by tachyon

Title:
Use:  <p> text here (a paragraph) </p>
and:  <code> code here </code>
to format your post; it's "PerlMonks-approved HTML":



  • Posts are HTML formatted. Put <p> </p> tags around your paragraphs. Put <code> </code> tags around your code and data!
  • Titles consisting of a single word are discouraged, and in most cases are disallowed outright.
  • Read Where should I post X? if you're not absolutely sure you're posting in the right place.
  • Please read these before you post! —
  • Posts may use any of the Perl Monks Approved HTML tags:
    a, abbr, b, big, blockquote, br, caption, center, col, colgroup, dd, del, div, dl, dt, em, font, h1, h2, h3, h4, h5, h6, hr, i, ins, li, ol, p, pre, readmore, small, span, spoiler, strike, strong, sub, sup, table, tbody, td, tfoot, th, thead, tr, tt, u, ul, wbr
  • You may need to use entities for some characters, as follows. (Exception: Within code tags, you can put the characters literally.)
            For:     Use:
    & &amp;
    < &lt;
    > &gt;
    [ &#91;
    ] &#93;
  • Link using PerlMonks shortcuts! What shortcuts can I use for linking?
  • See Writeup Formatting Tips and other pages linked from there for more info.
  • Log In?
    Username:
    Password:

    What's my password?
    Create A New User
    Chatterbox?
    and the web crawler heard nothing...

    How do I use this? | Other CB clients
    Other Users?
    Others rifling through the Monastery: (6)
    As of 2020-05-29 05:07 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?
      If programming languages were movie genres, Perl would be:















      Results (166 votes). Check out past polls.

      Notices?