Browse node creation using frequent pattern mining

Patent metadata

Field	Value
Publication number	US-10838984-B2
Application number	US-201615240841-A
Country	US
Kind code	B2
Filing date	Aug 18, 2016
Priority date	Aug 18, 2016
Publication date	Nov 17, 2020
Grant date	Nov 17, 2020

Abstract

A browse node page is addressed by its path. As a result, a web crawler may be more likely to find the browse node than the corresponding parameter-based search page. The browse node may be further distinguished from a search result page by the use of a title or header metatag that indicates information about the browse node and distinguishes the browse node from a general search result page. The number of combinations of keywords, categories, and key-value pairs makes the creation of a browse node for every possible combination prohibitive in all but the simplest applications. Methods and systems to identify which search result pages should be converted to browse nodes are disclosed herein.

First claim

What is claimed is:

1. A method comprising:
accessing data representing a plurality of items;
based as least in part on the data, determining for each item of the plurality of items, a set of key-value pairs;
determining a number of the plurality of items associated with a key-value pair from the sets of key-value pairs;
determining, based at least in part on comparing the number to a threshold number of items, that the number exceeds the threshold number of items; and
based at least in part on the number exceeding the threshold number of items, generating a browse node page accessible by a uniform resource locator (URL) and referencing the value of the key-value pair, the browse node page including at least a subset of the number of the plurality of items.

2. The method of claim 1 , wherein the key-value pair is a first key-value pair, the number is a first number, and the method further comprises:
selecting, from among the sets of key-value pairs, a second key-value pair;
determining a second number of the plurality of items associated with both the first key-value pair and the second key-value pair;
determining, based at least in part on comparing the second number to the threshold number of items, that the second number exceeds the threshold number of items; and
based at least In pt on the second number exceeding the threshold number of items, generating a second browse node page accessible by another URL that references the value of the first key-value pair and the value of the second key-value pair.

3. The method of claim 1 , further comprising:
comparing the value of the key-value pair to a set of excluded values to determine that the value is not in the set of excluded values; and
wherein the creating of the browse node page is further based on the determination that the value of the key-value pair is not in the set of excluded values.

4. The method of claim 1 , wherein the key-value pair is a first key-value pair, and the method further comprises:
determining a first set of items from the plurality of items, the first set of items being associated with the first key-value pair;
selecting, from among the sets of key-value pairs, a second key-value pair;
determining a second set of items from the plurality of items, the second set of items being associated with the second key-value pair;
determining a degree of intersection between the first set of items and the second set of items; and
based on the degree of intersection and a second threshold number of items associated with the degree of intersection, forgoing the creation of another browse node page for the second key-value pair.

5. The method of claim 1 , further comprising:
comparing the key of the key-value pair to a set of permitted keys to determine that the key is in the set of permitted keys; and
wherein the creating of the browse node page is further based on the determination that the key of the key-value pr is in the set of permitted keys.

6. The method of claim 1 , wherein the plurality of items are associated with a single category, and the method further comprises:
comparing the value of the key-value pair to a name of the single category to determine that the value does not match the name of the single category; and
wherein the creating of the browse node page is further based on the determination that the value of the key-value pair does not match the name of the single category.

7. The method of claim 1 , wherein the referencing the value of the key-value pair comprises including the value of the key-value pair in the URL.

8. The method of claim 1 , further comprising:
determining a first set of items from the plurality of items, the first set of items being associated with the key-value pair;
selecting an image from among images associated with the items in the first set of items associated with the key-value pair; and
associating the selected image with the browse node page.

9. The method of claim 8 , wherein:
each item of the first set of items has an associated quantity; and
the selecting of the image is based on the quantity associated with each item of the first set of items.

10. The method of claim 8 , wherein:
each item of the first set of items has an associated user; and
the selecting of the image is based on an attribute of the user associated with the item associated with the selected image.

11. A system comprising:
a memory that stores instructions; and
a processor configured to execute the instructions to perform operations comprising:
accessing data representing a plurality of items;
based as least in part on the data, determining, for each item of the plurality of items, a set of key-value pairs;
determining a number of the plurality of items associated with a key-value pair from the sets of key-value pairs;
determining, based at least in part on comparing the number to a threshold number of items, that the number exceeds the threshold number of items; and
based at least in part on the number exceeding the threshold number of items, generating a browse node page accessible by a uniform resource locator (URL) and referencing the value of the key-value pair, the browse node page including at least a subset of the number of the plurality of items.

12. The system of claim 11 , wherein the key-value pair is a first key-value pair, the number is a first number, and the operations further comprise:
selecting, from among the sets of key-value pairs, a second key-value pair;
determining a second number of the plurality of items associated with both the first key-value pair and the second key-value pair;
determining, based at least in part on comparing the second number to the threshold number of items, that the second number exceeds the threshold number of items; and
based at least in part on the second number exceeding the threshold number of items, generating a second browse node page accessible by another URL that references the value of the first key-value pair and the value of the second key-value pair.

13. The system of claim 11 , wherein the operations further comprise:
comparing the value of the key-value pair to a set of excluded values to determine that the value is not in the set of excluded values; and
wherein the creating of the browse node page is further based on the determination that the value of the key-value pair is not in the set of excluded values.

14. The system of claim 11 , wherein the key-value pair is a first key-value pair, and the operations further comprise:
determining a first set of items from the plurality of items, the first set of items being associated with the first key-value pair;
selecting, from among the sets of key-value pairs, a second key-value pair;
determining a second set of items from the plurality of items, the second set of items being associated with the second key-value pair;
determining a degree of intersection between the first set of items and the second set of items; and
based on the degree of intersection and a second threshold number of items associated with the degree of intersection, forgoing the creation of another browse node page for the second key-value pair.

15. The system of claim 11 , wherein the operations further comprise:
comparing the key of the key-value pair to a set of permitted keys to determine that the key is in the set of permitted keys; and
wherein the creating of the browse node page is further based on the determination that the key of the key-value pair is in the set of permitted keys.

16. The system of claim 11 , wherein the plurality of items are associated

Assignees

• Ebay Inc

Inventors

• Zhicharevich Alexander
• Simchoni Giora
• Dagan Arnon
• Hurwitz Daniel

Classifications

• G06F16/285 Primary

  Clustering or classification · CPC title

• G06F16/51

  Indexing; Data structures therefor; Storage structures · CPC title

• G06F16/26

  Visual data mining; Browsing structured data · CPC title

• G06F16/2272

  Management thereof · CPC title

• G06F16/958 Primary

  Organisation or management of web site content, e.g. publishing, maintaining pages or automatic linking · CPC title