Mirrors/the-algorithm
2
0
Fork 0
mirror of https://github.com/twitter/the-algorithm.git synced 2024-12-22 10:11:52 +01:00
Code Issues Packages Projects Releases Wiki Activity

fix another grammatical error

Browse Source 
this fixes another grammar error with assistance from @sdornan
This commit is contained in:
Animus 2023-03-31 17:21:59 -07:00 committed by GitHub
parent 4c5db53916
commit b04e3521a2
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
simclusters-ann/README.md
View File

@ -12,7 +12,7 @@ The cosine similarity between two Tweet SimClusters Embedding presents the relev
SimClusters from the Linear Algebra Perspective discussed the difference between the dot-product and cosine similarity in SimCluster space. We believe the cosine similarity approach is better because it avoids the bias of tweet popularity.
However, calculating the cosine similarity between two Tweets is pretty expensive in Tweet candidate generation. In TWISTLY, we scan at most 15,000 (6 source tweets * 25 clusters * 100 tweets per clusters) tweet candidates for every Home Timeline request. The traditional algorithm needs to make API calls to fetch 15,000 tweet SimCluster embeddings. Considering that we need to process over 6,000 RPS, it’s hard to support by the existing infrastructure.
However, calculating the cosine similarity between two Tweets is pretty expensive in Tweet candidate generation. In TWISTLY, we scan at most 15,000 (6 source tweets * 25 clusters * 100 tweets per clusters) tweet candidates for every Home Timeline request. The traditional algorithm needs to make API calls to fetch 15,000 tweet SimCluster embeddings. Considering that we need to process over 6,000 RPS, it’s hard to support with the existing infrastructure.
## SimClusters Approximate Cosine Similariy Core Algorithm