RANKING ALGORITHM FOR SEARCH QUERIES

• US 20160342602A1
• Filed: 08/02/2016
• Published: 11/24/2016
• Est. Priority Date: 03/31/2009
• Status: Active Grant

• Current Assignee: eBay Inc.
• Original Assignee: eBay Inc.
• Inventors: Hu, Wenyan, Zhang, Xiaodi, Bolivar, Alvaro, Shoup, Randall Scott
• Granted Patent: US 10,324,938 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/24578 using ranking
• CPC Class Codes: G06F 16/3338 Query expansion
• CPC Class Codes: G06F 16/334 Query execution G06F16/335 takes precedence
• CPC Class Codes: G06F 16/90324 using system suggestions

Abstract

In various exemplary embodiments, a system and associated method for prioritizing search results in an electronic environment is disclosed. In one embodiment, a plurality of characters is received from an end-user as a query. A plurality of equivalent keywords is selected responsive to the query with each of the equivalent keywords being evaluated based on a probability of matching the query of the end-user. A rank of each of the equivalent keywords is determined to form a response, which is then transmitted to the end-user. Other methods and related systems are disclosed.

Claims

1. A method, comprising:

selecting a plurality of equivalent keywords responsive to a search query;

determining a rank of each of the plurality of equivalent keywords;

selecting a plurality of most highly-ranked keywords from the plurality of equivalent keywords; and

preparing a response including the plurality of most highly-ranked keywords.

2. The method of claim 1, further comprising transmitting the response.

3. The method of claim 2, further comprising fitting the response within a single communications packet prior to transmitting the response.

4. The method of claim 1, further comprising sending a plurality of sub-nodes along with the response to a generator of the search query, each of the plurality of sub-nodes including an additional plurality of responses relating to the search query.

5. The method of claim 1, wherein the selecting the plurality of equivalent keywords is based on one or more characters within the search query.

6. The method of claim 1, wherein the search query is received within a single communications packet.

7. The method of claim 1, further comprising calculating a weight of each of the plurality of equivalent keywords to determine the rank.

8. The method of claim 7, further comprising basing the calculated weight on at least one item in a group of parameters, the parameters consisting of most frequent queries, a number of items available matching the search query, the number of bids on items matching the search query, a number of purchases of items matching the search query, and the number of items matching the search query being placed on a watch list.

9. The method of claim 1, further comprising selecting the plurality of equivalent keywords from a weighted database.

10. The method of claim 9, further comprising updating the weighted database based on a determination of a positive matching of at least one of the plurality of most highly-ranked keywords.

11. The method of claim 10, wherein the updating includes increasing a weighting factor for the at least one of the plurality of most highly-ranked keywords.

12. The method of claim 9, further comprising basing a rank of the plurality of most highly-ranked keywords on a turnover rate of a listing to which the search query is directed.

13. A method, comprising:

receiving a plurality of characters from an end-user as a query;

selecting a plurality of equivalent keywords responsive to the query;

evaluating each of the plurality of equivalent keywords based on a probability of matching the query of the end-user;

determining a rank of each of the plurality of equivalent keywords to form a response; and

transmitting the response to the end-user.

14. The method of claim 13, further comprising calculating a weight of each of the plurality of equivalent keywords to determine the rank.

15. The method of claim 14, further comprising basing the calculated weight on at least one item in a group of parameters, the parameters consisting of most frequent queries, a number of items available matching the search query, the number of bids on items matching the search query, a number of purchases of items matching the search query, and the number of items matching the search query being placed on a watch list.

16. The method of claim 13, further comprising selecting the plurality of equivalent keywords from a weighted database.

17. The method of claim 16, further comprising updating the weighted database based on a determination of a positive matching of at least one of the plurality of most highly-ranked keywords.

18. The method of claim 17, wherein the updating includes increasing a weighting factor for the at least one of the plurality of most highly-ranked keywords.

19. The method of claim 16, further comprising basing a rank of the plurality of most highly-ranked keywords on a turnover rate of a listing to which the search query is directed.

20. A method, tangible machine-readable storage medium having no transitory signal components and storing instructions that, when executed by one or more processors, causes the one or more processors to perform operations, comprising:

selecting a plurality of equivalent keywords responsive to a search query;

determining a rank of each of the plurality of equivalent keywords;

selecting a plurality of most highly ranked keywords from the plurality of equivalent keywords; and

preparing a response including the plurality of most highly ranked keywords.