SageRank
In addition to SageMint, Eden is powered by SageRank, a dynamic interests ranking system. Inspired by Googleβs PageRank, SageRank models the structure and evolution of the user-Circle interaction graph. Our heterogeneous dynamic graph embedding projects the social network, user activity, and Circle content to a high-dimensional space where similar users and Circles are close to each other in this vector space. Eventually, SageRank increases user engagement, Circle engagement, and boosts our effort to index the web.
SageRank evaluates the quality and potential impact of Circles, Users, Webpages, and Interests. All of these entities and their relationships can be Modeled as a dynamic heterogeneous network graph . is a set of unique vertices (i.e. nodes) in the graph. An object type mapping function maps each to one of the 4 categories of objects:
which are respectively Circle, User, Webpages, and Interests. corresponds to the property of each vertex . is the set of Circle properties, which include opinion content, activity, and Circle-related rewards.
is the set of User properties, which include user profile, total number of predictions, prediction accuracy rate, and the number of tokens they own.
is the set of Webpage properties, which include webpage description, traffic volume, past interactions, and other related values. is the set of Interest properties, which include daily average number of posts, total participants, and daily average number of new members.
Furthermore, is a set of all unique edges in the network. Each edge is a quadruple . Where and are the source/destination nodes, and is the timestamp of the creation of this edge. is the property of this edge. For instance, can represent a user joins an Circle at time , with the detailed interaction encoded in . A relationship mapping function maps each edge to one of the six relationship types which are respectively Index, Purchase, Mint, Merge, Join, and Link. A simplified binary edge set contains binary indication of the connection from to at time without the property . The core of SageRank is a link prediction function , i.e. given the graph prior to time , predict all the binary edges except Index at timestep . The objective only predicts the binary edges to simplify the prediction task. Index is excluded because it is an exogenous action initiated by users which our recommender system cannot influence.
SageRank starts its computation with selecting seed users who have an outstanding track record in indexing the web, and their indexing and purchasing behaviors of Circles will be taken as a signal to help us identify high quality Circles. At this stage, only the subgraph that contains the direct (one-hop) neighbors of the seed users and the seed users themselves will be embedded.
The authorship, indexing, or early investment of the high quality Circles helps us further identify even more credible and knowledgeable users. By random walks on the social network of users and Circles, SageRank iteratively updates its estimation of the credibility of quality of the users and Circles. Such estimation will be combined with language embedding on the Circles, social network embedding, and user behaviors (e.g. click streams, searches, and interests) to form as an input into a Hybrid Deep Recommender System (HDRS) that will optimizes the recommended Circles and Interests to users whose interest are most likely to be aligned with. HDRS helps Circles to get more traction and users discover the most valuable and interesting content, and the improved user experience can further boost the social and trading activity on our platform.
Last updated