Type completeness detection system

1. A system comprising:

a memory storing computer-executable instructions; and

one or more hardware processors in communication with the memory and configured by the executable instructions to at least:

select a browse node associated with a subset of items in an electronic catalog;

identify one or more previous search queries related to the browse node, wherein the one or more previous search queries are associated with requests from users to search for items in the electronic catalog;

determine a plurality of items for a previous search query of the one or more previous search queries, wherein the plurality of items comprises items that have been previously selected or purchased by at least one user who submitted the previous search query;

determine a browse node completeness score for the browse node based at least partly on a number of items from the plurality of items that are associated with the browse node;

determine that the browse node completeness score is below a predetermined threshold value; and

initiate a responsive action associated with the browse node based on the browse node completeness score level falling below the predetermined threshold value, wherein the responsive action comprises at least one of (a) creating a new browse node with a name determined at least in part from the one or more previous search queries, or (b) adding, to the browse node, one or more of the items that have been previously selected or purchased by at least one user who submitted the previous search query.

2. The system of claim 1 , wherein the one or more previous search queries comprises at least a first search query and a second search query, wherein the first search query is associated with a first query completeness score and the second search query is associated with a second query completeness score.

3. The system of claim 2 , wherein the browse node completeness score is a weighted average of at least the first query completeness score and the second query completeness score.

4. The system of claim 1 , wherein the plurality of previous search queries are associated with requests from users to search for items in the electronic catalog in a predetermined time frame.

5. The system of claim 1 , wherein the one or more hardware processors are further configured to identify a refinement associated with the browse node.

6. The system of claim 1 , wherein the one or more previous search queries are associated with searches where users select or purchase from the browse node last in a search or browse session.

7. The system of claim 1 , wherein the one or more previous search queries are determined based at least in part on a historical log of user search queries.

8. The system of claim 1 , wherein the plurality of items for a previous search query in the one or more previous search queries comprises a predetermined number of most-frequently selected or purchased item associated with the previous search query.

9. The system of claim 1 , wherein an item in the plurality of items is associated with a second browse node other than the browse node.

10. The system of claim 1 , wherein the responsive action comprises identifying one or more items to add to the browse node.

11. A computer-implemented method comprising:

selecting a browse node associated with a subset of items in an electronic catalog;

identifying one or more previous search queries related to the browse node, wherein the one or more previous search queries are associated with requests from users to search for items in the electronic catalog;

determining a plurality of items for a previous search query of the one or more previous search queries, wherein the plurality of items comprises items that have been previously selected or purchased by at least one user who submitted the previous search query;

determining a browse node completeness score for the browse node based at least partly on a number of items from the plurality of items that are associated with the browse node;

determining that the browse node completeness score is below a predetermined threshold value; and

initiating a responsive action associated with the browse node based on the browse node completeness score level falling below the predetermined threshold value wherein the responsive action comprises at least one of (a) creating a new browse node with a name determined at least in part from the one or more previous search queries, or (b) adding, to the browse node, one or more of the items that have been previously selected or purchased by at least one user who submitted the previous search query.

12. The method of claim 11 , further comprising transmitting a notification to a user regarding the responsive action.

13. The method of claim 11 , wherein the predetermined threshold value is adjustable by a user.

14. The method of claim 11 , wherein the responsive action further comprises merging the browse node with another browse node.

15. The method of claim 11 , wherein the responsive action is initiated automatically after determining the browse node completeness score without input from a user.

16. The system of claim 1 , wherein the one or more previous search queries related to the browse node are identified based on a determination that at least a portion of each of the one or more previous search queries matches an alphanumeric label assigned to the browse node.