Show HN: WikiBinge – discover how all things are vaguely connected (2016) Connect two articles on Wikipedia, but do it the long way. I've always been a fan of the theory of six degree of separation, but it's an overused concept when exploring the Wiki-graph. Instead of showing the shortest path, which in my opinion is "boring" and ends up connecting super-important central articles, I came up with my own method: WikiBinge selects the smaller, less represented articles on Wikipedia. In a WikiBinge path, the underdogs are the kings! How does it work? It's pretty straightforward! Compute PageRank on the Wiki-graph and assign as weight of each edge the PageRank value of the destination node. A WikiBinge path is then simply a shortest path using these weights: the algorithm will then favor paths passing through articles with lower PageRank values. More on the motives to build this here: https://ift.tt/69gnMJm This is an older project of mine, but it never got much exposure, so I'm humbly submitting it now. https://ift.tt/JLoMcr9 April 14, 2023 at 10:48PM
Post Top Ad
Your Ad Spot
Friday, April 14, 2023
Home
Hacker News
Show HN: WikiBinge – discover how all things are vaguely connected (2016) https://ift.tt/81ZtfXJ
Show HN: WikiBinge – discover how all things are vaguely connected (2016) https://ift.tt/81ZtfXJ
Tags
Hacker News#
Share This
About latest news
Hacker News
Labels:
Hacker News
Subscribe to:
Post Comments (Atom)
Post Top Ad
Author Details
Ut wisi enim ad minim veniam, quis nostrud exerci tation ullamcorper suscipit lobortis nisl ut aliquip ex ea commodo consequat. Duis autem vel eum iriure dolor in hendrerit in vulputate velit esse molestie consequat.
Post Top Ad
No comments:
Post a Comment