Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2025-01-22 00:41:16 +01:00
Code Issues Packages Projects Releases Wiki Activity

Merge 431e59015087518e4f76879c40fe33d26025b1d0 into 72eda9a24f815f6d566818cbf8518138e29d83e9

Browse Source
This commit is contained in:
Dave Meyer 2023-07-17 21:40:13 -05:00 committed by GitHub
commit 425e0b07dc
No known key found for this signature in database
GPG Key ID: 4AEE18F83AFDEB23
1 changed files with 1 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
src/scala/com/twitter/graph/batch/job/tweepcred/README
View File

@ -12,7 +12,7 @@ The implementation of the PageRank algorithm in Tweepcred is based on the Hadoop
The preparation stage involves constructing the graph of Twitter users and their interactions, and initializing each user's PageRank score to a default value. This stage is implemented in the PreparePageRankData class.
The iteration stage involves repeatedly calculating and updating the PageRank scores of each user until convergence is reached. This stage is implemented in the UpdatePageRank class, which is run multiple times until the algorithm converges.
The iteration stage involves repeatedly calculating and updating the PageRank scores of each user until convergence is reached. This stage is implemented in the WeightedPageRank class, which is run multiple times until the algorithm converges.
The Tweepcred PageRank implementation also includes a number of optimizations to improve performance and reduce memory usage. These optimizations include block compression, lazy loading, and in-memory caching.