You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Given semantic scholar link, try to get the most related users from our exiting user base.
If we can compute a user embedding based on their past research, we can return the nearest neighbors.
Need to study the Semantic Scholar API. They compute citing and cited authors. If we have can get these, we can intersect them with our user pool, and identify users to recommend.
The text was updated successfully, but these errors were encountered:
Use all available sources to retrieve all papers for the user, and retain the 10 most recent ones.
Embed each one using something like fasttext.
Put all papers from all users in the same space, and somehow compute a recommendation top-k/distribution for each user. The ranking of recommended users is drawn from this set.
We need a mechanism to recommend users to follow.
Some options:
Need to study the Semantic Scholar API. They compute citing and cited authors. If we have can get these, we can intersect them with our user pool, and identify users to recommend.
The text was updated successfully, but these errors were encountered: