Graph-directed key phrase recommendation based on item similarity

A system comprising:

• one or more processors;
• and
• memory storing instructions that, when executed by the one or more processors, cause the system to:
• receive a dataset that comprises items listed via a listing platform, titles of the items, and key phrases, wherein each of the items are paired with one or more of the key phrases;
• tokenize the titles into title tokens;
• generate a tripartite graph by:
• connecting, via a first set of edges of the tripartite graph, the title tokens to the items, a respective title token being connected to an item if a title of the item includes the respective title token;
• and
• connecting, via a second set of edges of the tripartite graph, the items to the key phrases, a respective key phrase being connected to an item if the respective key phrase is paired with the item in the dataset;
• store the tripartite graph in the memory in compressed sparse row format;
• receive a seed title of a seed item listed via the listing platform, the seed title including one or more seed tokens;
• traverse the tripartite graph in the memory to identify matching tokens of the title tokens that match the one or more seed tokens and assign occurrence counts to the items, an occurrence count of a respective item representing a number of the matching tokens that are connected to the respective item via the first set of edges;
• identify one or more similar items of the items having the occurrence counts meet a threshold;
• and
• output at least one key phrase of the key phrases connected to the one or more similar items via the second set of edges in the tripartite graph.

A non-transitory computer-readable storage medium storing instructions that, when executed by one or more processors, cause the one or more processors to perform operations comprising:

• receiving a dataset that comprises items listed via a listing platform, titles of the items, and key phrases, wherein each of the items are paired with one or more of the key phrases;
• tokenizing the titles into title tokens;
• generating a tripartite graph by:
• connecting, via a first set of edges of the tripartite graph, the title tokens to the items, a respective title token being connected to an item if a title of the item includes the respective title token;
• and
• connecting, via a second set of edges of the tripartite graph, the items to the key phrases, a respective key phrase being connected to an item if the respective key phrase is paired with the item in the dataset;
• storing the tripartite graph in memory in compressed sparse row format;
• receiving a seed title of a seed item listed via the listing platform, the seed title including one or more seed tokens;
• traversing the tripartite graph in the memory to identify matching tokens of the title tokens that match the one or more seed tokens and assign occurrence counts to the items, an occurrence count of a respective item representing a number of the matching tokens that are connected to the respective item via the first set of edges;
• and
• outputting the key phrases as ranked based, in part, on the occurrence counts.