Search engine using joint learning for multi-label classification

US2023252095A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2023252095-A1
Application numberUS-202318134412-A
CountryUS
Kind codeA1
Filing dateApr 13, 2023
Priority dateOct 15, 2019
Publication dateAug 10, 2023
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

A method of configuring a search engine to classify a search query includes receiving a search query data set, the search query data set comprising a plurality of search queries, defining a first set of candidate labels and a second set of candidate labels according to the search queries in the search query data set, concatenating the first set of candidate labels with the second set of candidate labels to generate a concatenated candidate label set, generating a compatibility matrix comprising a similarity between the concatenated candidate label set and the search query data set, and training a classification network according to the compatibility matrix.

First claim

Opening claim text (preview).

1 - 20 . (canceled) 21 . A method of configuring a search engine to classify a search query, the method comprising: defining a matrix of first candidate labels based on a plurality of categories associated with user navigation histories; defining a matrix of second candidate labels based on a plurality of user intents in the user navigation histories; concatenating the matrix of the first candidate labels with the matrix of the second candidate labels to generate a concatenated candidate label vector; determining a respective similarity between the concatenated candidate label vector and each of a plurality of search queries; and training a classification network according to the determined similarities. 22 . The method of claim 3 , further comprising: deriving a plurality of search queries from the user navigation histories; converting each of the plurality of search queries into respective embeddings; and generating a compatibility matrix indicative of a similarity between the concatenated candidate label vector and the embeddings. 23 . The method of claim 3 , wherein training the classification network according to the determined similarities comprises training a first neural network for determining a category of a new search query and a second neural network for determining a user intent of the new search query. 24 . The method of claim 3 , further comprising: determining a plurality of items included in the user navigation histories; determining a plurality of categories associated with the plurality of items; and identifying a plurality of user intents in the user navigation histories. 25 . The method of claim 4 , wherein the first candidate labels comprise category labels from the plurality of categories associated with the plurality of items. 26 . The method of claim 4 , wherein the second candidate labels comprise user intent statements from the plurality of user intents. 27 . The method of claim 3 , wherein each determined similarity comprises a cosine similarity between the concatenated candidate label vector and one of the plurality of search queries. 28 . A system for configuring a search engine to classify a search query, the system comprising: a non-transitory, computer-readable memory storing instructions; and a processor configured to execute the instructions to: define a matrix of first candidate labels based on a plurality of categories associated with user navigation histories; define a matrix of second candidate labels based on a plurality of user intents in the user navigation histories; concatenate the matrix of the first candidate labels with the matrix of the second candidate labels to generate a concatenated candidate label vector; determine a respective similarity between the concatenated candidate label vector and each of a plurality of search queries; and train a classification network according to the determined similarities. 29 . The system of claim 8 , wherein the processor is further configured to: deriving a plurality of search queries from the user navigation histories; converting each of the plurality of search queries into respective embeddings; and generating a compatibility matrix comprises a similarity between the concatenated candidate label vector and the embeddings. 30 . The system of claim 8 , wherein training the classification network according to the determined similarities comprises training a first neural network for determining a category of a new search query and a second neural network for determining a user intent of the new search query. 31 . The system of claim 8 , wherein the processor is further configured to: determining a plurality of items included in the user navigation histories; determining a plurality of categories associated with the plurality of items; and identifying a plurality of user intents in the user navigation histories. 32 . The system of claim 31 , wherein the first candidate labels comprise category labels from the plurality of categories associated with the plurality of items. 33 . The system of claim 31 , wherein the second candidate labels comprise user intent statements from the plurality of user intents. 34 . The system of claim 8 , wherein each determined similarity comprises a cosine similarity between the concatenated candidate label vector and one of the plurality of search queries. 35 . A method for responding to a user search request, the method comprising: defining a matrix of first candidate labels based on a plurality of categories associated with user navigation histories; defining a matrix of second candidate labels based on a plurality of user intents in the user navigation histories; concatenating the matrix of the first candidate labels with the matrix of the second candidate labels to generate a concatenated candidate label vector; determining a respective similarity between the concatenated candidate label vector and each of a plurality of search queries; training a classification network according to the determined similarities; receiving, by a server, a user search query; applying, by the server, the trained classification network to the user search query to identify at least one of a user intent or an item category; and providing, by the server, a response to the user search query according to the at least one of a user intent or an item category. 36 . The method of claim 35 , further comprising: deriving a plurality of search queries from the user navigation histories; converting each of the plurality of search queries into respective embeddings; and generating a compatibility matrix comprises a similarity between the concatenated candidate label vector and the embeddings. 37 . The method of claim 35 , wherein training the classification network according to the determined similarities comprises training a first neural network for determining a category of a new search query and a second neural network for determining a user intent of the new search query. 38 . The method of claim 35 , further comprising: determining a plurality of items included in the user navigation histories; determining a plurality of categories associated with the plurality of items; and identifying a plurality of user intents in the user navigation histories. 39 . The method of claim 38 , wherein the first candidate labels comprise category labels from the plurality of categories associated with the plurality of items. 40 . The method of claim 38 , wherein the second candidate labels comprise user intent statements from the plurality of user intents.

Assignees

Inventors

Classifications

  • Active learning · CPC title

  • Feedforward networks · CPC title

  • Supervised learning · CPC title

  • Search customisation based on user profiles and personalisation · CPC title

  • characterised by the process organisation or structure, e.g. boosting cascade · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2023252095A1 cover?
A method of configuring a search engine to classify a search query includes receiving a search query data set, the search query data set comprising a plurality of search queries, defining a first set of candidate labels and a second set of candidate labels according to the search queries in the search query data set, concatenating the first set of candidate labels with the second set of candida…
Who is the assignee on this patent?
Home Depot Product Authority Llc
What technology area does this patent fall under?
Primary CPC classification G06F16/9535. Mapped technology areas include Physics.
When was this patent published?
Publication date Thu Aug 10 2023 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).