this post was submitted on 28 Dec 2023
21 points (81.8% liked)

Fediverse

17438 readers
371 users here now

A community dedicated to fediverse news and discussion.

Fediverse is a portmanteau of "federation" and "universe".

Getting started on Fediverse;

founded 4 years ago
MODERATORS
deadsuperhero@lemmy.ml
wakest@lemmy.ml
21
Could we use this sorting algorithm on Lemmy? (linklonk.com)
submitted 8 months ago* (last edited 8 months ago) by Danterious@lemmy.dbzer0.com to c/fediverse@lemmy.ml
9 comments fedilink hide all child comments
 

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

you are viewing a single comment's thread
view the rest of the comments
[โ€“] taladar@sh.itjust.works 2 points 8 months ago (1 children)

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

[โ€“] slacktoid@lemmy.ml 2 points 8 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