cross-posted from: https://lemmy.dbzer0.com/post/11252604

I found this link aggregator that someone made for a personal project and they had an exciting idea for a sorting algorithm whose basic principle is the following:

  1. Upvotes show you more links from other people who have upvoted that content
  2. Downvotes show you fewer links from other people who have upvoted that content

I thought the idea was interesting and wondered if something similar could be implemented in the fediverse.

They currently don’t have plans of open-sourcing their work which is fine but I think it shouldn’t be too hard to try and replicate something similar here right?

They have the option to try this out in guest mode where you don’t have to sign in, but it seems to be giving me relevant content after upvoting only 3 times.

There is more information on their website if you guys are interested.

Edit: Changed title to something more informative

  • taladar
    link
    fedilink
    arrow-up
    2
    ·
    11 months ago

    It requires the information who upvoted and downvoted what, I don’t think that is available to the client, is it?

    • slacktoid@lemmy.ml
      link
      fedilink
      English
      arrow-up
      2
      ·
      11 months ago

      It is in theory. I dont think its a practical lookup tho but it could be amortized to make it workable.

      Tho i would just slap AI on it and call it a day /s