Enriching An Advertiser's Product-Related Information

• US 20140279078A1
• Filed: 03/17/2014
• Published: 09/18/2014
• Est. Priority Date: 03/15/2013
• Status: Abandoned Application

• Current Assignee: Walmart Apollo, LLC (WalMart Inc.)
• Original Assignee: Adchemy Incorporated (WalMart Inc.)
• Inventors: Nukala, Murthy V., Batraski, Ethan James, Magnani, Alessandro, Kondaji, Srinidhi Ramesh, Chatwin, Richard Edwin, Gorantla, Siva Kumar, Fish, Scott Harold, Nafar, Zuzar F., Krishnan, Gopalakrishnan, Serenbrennikov, Dmitry, Lightholder, Sen Padraig
• Application Number:
  US14/217,156
• Publication Number:
  US 20140279078A1
• Time in Patent Office: Days
• US Class Current: 705/14.73
• CPC Class Codes: G06Q 30/0243 Comparative campaigns
• CPC Class Codes: G06Q 30/0251 Targeted advertisements
• CPC Class Codes: G06Q 30/0276 Advertisement creation
• CPC Class Codes: G06Q 30/0277 Online advertisement

Abstract

In one embodiment, a method includes accessing information about an advertiser'"'"'s product catalog. The method may further include accessing an information graph that contains nodes and edges connecting the nodes. The nodes in the graph represent concepts related to at least one vertical. The method further includes associating a first node in the graph with a second node in the graph based on a relationship between the meaning of the concept represented by the first node and the meaning of the concept represented by the second node. A portion of the graph corresponds to the advertiser'"'"'s product catalog. The method may further include enriching information associated with the portion of the product catalog with information related to the concepts and relationships represented by the portion of the graph corresponding to the portion of the product catalog of the advertiser.

Claims

1. A method comprising:

by a computing device, accessing information comprising at least a portion of a product catalog of an advertiser;

by a computing device, accessing a graph comprising a plurality of nodes and a plurality of edges connecting the nodes, each node connected by at least one edge to at least one other node in the graph, each node representing a concept related to at least one vertical, each edge representing a relationship between two nodes, at least a first node associated with at least one second node based on a relationship between a meaning of the concept represented by the first node and a meaning of the concept represented by the second node, at least a portion of the graph corresponding to the portion of the product catalog of the advertiser;

by a computing device, enriching information associated with the portion of the product catalog with information related to the concepts and relationships represented by the portion of the graph corresponding to the portion of the product catalog of the advertiser.