Patents by Inventor Apurva Rameshchandra Jadhav

Apurva Rameshchandra Jadhav has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).

  • Patent number: 10867336
    Abstract: In one embodiment, a method includes generating a query based on a seed product offer that describes a product being offered for sale and executing the query, using a search engine that normalizes search terms in the query, on a plurality of product offers to determine candidate offers. The candidate offers are likely associated with the product. The method further includes determining one or more common attribute values across corresponding attributes of the candidate offers. The method additionally includes for each attribute value of each candidate offer, scoring the attribute value based on whether it matches one or more of the common attribute values, and updating a set of normalized attribute values for the product to include the attribute value based on whether the score is greater than a predetermined threshold.
    Type: Grant
    Filed: December 14, 2016
    Date of Patent: December 15, 2020
    Assignee: Facebook, Inc.
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Patent number: 10783569
    Abstract: In one embodiment, a method includes receiving a set of normalized attribute values that define a particular item being offered and a corresponding threshold score for each of the normalized attribute values. The method further includes, for each attribute value of a candidate item listing, determining a score for the attribute value based on whether it matches a corresponding normalized attribute value, and determining whether the score is above or below the corresponding threshold score for the normalized attribute value. The method still further includes determining whether the candidate item listing describes the particular item being offered based on a set of rules that define an acceptable number of scores that are allowed to be below the threshold scores.
    Type: Grant
    Filed: December 20, 2016
    Date of Patent: September 22, 2020
    Assignee: Facebook, Inc.
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Patent number: 10733654
    Abstract: In one embodiment, a method includes receiving a plurality of candidate offers that are likely associated with a product being offered for sale. Each candidate offer is associated with a common set of attributes, wherein at least one of the attributes in the common set uniquely identifies the product being offered for sale. The method further includes, for each attribute value of each candidate offer, scoring the attribute value based on an aggregate number of times that the attribute value is found across corresponding attributes of other candidate offers in the plurality, and adding the scores for a first pair of attributes to determine a cumulative score for the candidate offer. One of the attributes in the first pair is the at least one attribute that uniquely identifies the product. The method still further includes updating a set of normalized attribute values for the product to include the attribute values for the first pair of attributes from a highest scoring candidate offer.
    Type: Grant
    Filed: December 20, 2016
    Date of Patent: August 4, 2020
    Assignee: Facebook, Inc.
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Publication number: 20180174220
    Abstract: In one embodiment, a method includes receiving a plurality of candidate offers that are likely associated with a product being offered for sale. Each candidate offer is associated with a common set of attributes, wherein at least one of the attributes in the common set uniquely identifies the product being offered for sale. The method further includes, for each attribute value of each candidate offer, scoring the attribute value based on an aggregate number of times that the attribute value is found across corresponding attributes of other candidate offers in the plurality, and adding the scores for a first pair of attributes to determine a cumulative score for the candidate offer. One of the attributes in the first pair is the at least one attribute that uniquely identifies the product. The method still further includes updating a set of normalized attribute values for the product to include the attribute values for the first pair of attributes from a highest scoring candidate offer.
    Type: Application
    Filed: December 20, 2016
    Publication date: June 21, 2018
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Publication number: 20180174219
    Abstract: In one embodiment, a method includes receiving a set of normalized attribute values that define a particular item being offered and a corresponding threshold score for each of the normalized attribute values. The method further includes, for each attribute value of a candidate item listing, determining a score for the attribute value based on whether it matches a corresponding normalized attribute value, and determining whether the score is above or below the corresponding threshold score for the normalized attribute value. The method still further includes determining whether the candidate item listing describes the particular item being offered based on a set of rules that define an acceptable number of scores that are allowed to be below the threshold scores.
    Type: Application
    Filed: December 20, 2016
    Publication date: June 21, 2018
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Publication number: 20180165740
    Abstract: In one embodiment, a method includes generating a query based on a seed product offer that describes a product being offered for sale and executing the query, using a search engine that normalizes search terms in the query, on a plurality of product offers to determine candidate offers. The candidate offers are likely associated with the product. The method further includes determining one or more common attribute values across corresponding attributes of the candidate offers. The method additionally includes for each attribute value of each candidate offer, scoring the attribute value based on whether it matches one or more of the common attribute values, and updating a set of normalized attribute values for the product to include the attribute value based on whether the score is greater than a predetermined threshold.
    Type: Application
    Filed: December 14, 2016
    Publication date: June 14, 2018
    Inventors: Apurva Rameshchandra Jadhav, Shashikant Khandelwal, Gurpreetsingh Baljeetsingh Sachdev, Nikhil Gupta
  • Patent number: 7685141
    Abstract: Techniques are described herein for a connection sub-graph generator that identifies important relationships between entities in entity relationship graphs. The generator first identifies two entities in an entity relationship graphs. A plurality of candidate path relationships between the two entities may be determined. For each such candidate path relationship, the generator determines a path type based on types of edge relationships that make up the candidate path relationship and generates a score value for the candidate path. This score value is based in part on the path type of the candidate path relationship. One or more candidate path relationships that have score values that indicate a high likelihood of interest to a user is selected to be included in a connection sub-graph.
    Type: Grant
    Filed: July 23, 2007
    Date of Patent: March 23, 2010
    Assignee: Yahoo! Inc.
    Inventors: Apurva Rameshchandra Jadhav, Ashutosh Joshi
  • Patent number: 7636713
    Abstract: A search engine finds and ranks information in clusters so a user can select information listed in search results that are closer to his information needs. To do so, the search engine receives a proximity query and executes it against an entity-relationship graph. The search engine finds those entities in the graph that have similar relationships between nodes. For example, two entities in a graph may be connected to entirely different nodes, but they may connect to those different nodes using similarly labeled paths. The search engine identifies the relationship between the nodes, clusters entities that are connected by similar relationships, and presents the clustered information to the user as part of the search results. In this way, the search engine provides a user with a results from which the user can select the group of results that most closely match his information need.
    Type: Grant
    Filed: March 27, 2007
    Date of Patent: December 22, 2009
    Assignee: Yahoo! Inc.
    Inventor: Apurva Rameshchandra Jadhav
  • Publication number: 20090027392
    Abstract: Techniques are described herein for a connection sub-graph generator that identifies important relationships between entities in entity relationship graphs. The generator first identifies two entities in an entity relationship graphs. A plurality of candidate path relationships between the two entities may be determined. For each such candidate path relationship, the generator determines a path type based on types of edge relationships that make up the candidate path relationship and generates a score value for the candidate path. This score value is based in part on the path type of the candidate path relationship. One or more candidate path relationships that have score values that indicate a high likelihood of interest to a user is selected to be included in a connection sub-graph.
    Type: Application
    Filed: July 23, 2007
    Publication date: January 29, 2009
    Inventors: Apurva Rameshchandra Jadhav, Ashutosh Joshi
  • Publication number: 20080183695
    Abstract: A search engine finds and ranks information in clusters so a user can select information listed in search results that are closer to his information needs. To do so, the search engine receives a proximity query and executes it against an entity-relationship graph. The search engine finds those entities in the graph that have similar relationships between nodes. For example, two entities in a graph may be connected to entirely different nodes, but they may connect to those different nodes using similarly labeled paths. The search engine identifies the relationship between the nodes, clusters entities that are connected by similar relationships, and presents the clustered information to the user as part of the search results. In this way, the search engine provides a user with a results from which the user can select the group of results that most closely match his information need.
    Type: Application
    Filed: March 27, 2007
    Publication date: July 31, 2008
    Inventor: Apurva Rameshchandra Jadhav