IP Library Granted Patent US 10,733,507
Granted Patent B2
US 10,733,507 · App. 15/658,712 · Granted Aug 4, 2020

Semantic clustering based retrieval for candidate set expansion

Inventors: Saurabh Kataria (Newark, CA); Dhruv Arya (Sunnyvale, CA); Ganesh Venkataraman (San Jose, CA)
Assignee: Microsoft Technology Licensing, LLC
G06N3/08G06F16/906G06F16/93G06F16/9535G06N3/04G06N3/0427G06N3/0454G06N3/0481G06N3/084G06Q50/10G06N7/005
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,733,507
App. No.
15/658,712
Granted
Aug 4, 2020
Kind
B2
Abstract

In an example embodiment, a machine learning algorithm is used to train a query-based deep semantic similarity neural network to output a query context vector in a vector space that includes both query context vectors and document context vectors. Both the query context vectors and document context vectors are clustered using a clustering algorithm. When an input search query is obtained, the input search query is also passed into the query-based deep semantic similarity neural network and its output document context vector assigned to a first cluster based on the clustering algorithm. Documents within the first cluster are then retrieved in response to the input search query.

Claims (54)

1. A system comprising:

a non-transitory computer-readable medium having instructions stored thereon, which, when executed by a processor, cause the system to:

in a training phase:

obtain training data pertaining to sample job posting search queries, the training data comprising sample job posting search results and indications as to which of the sample job posting search results were selected by members performing corresponding job posting search queries;

for each of the sample job posting search queries, feed the corresponding training data into a first machine learning algorithm to train a query-based deep semantic similarity neural network to output a query context vector for an input job posting search query and into a second machine learning algorithm to train a document-based deep semantic similarity neural network to output a document context vector for an input job posting;

map each query context vector and each document context vector into a cluster using a clustering algorithm;

in a retrieval phase:

obtain a first job posting search query;

pass the first job posting search query into the query-based deep semantic similarity neural network to output a first query context vector;

identify a cluster in which to map the first document query vector using the clustering algorithm; and

retrieve documents contained in a cluster corresponding to the identified cluster.

2. The system of claim 1 , wherein the instructions further cause the system to:

add an entry for each cluster identification to an inverted index, each entry further indicating a document mapped into a corresponding cluster; and

the retrieving documents further comprising locating a first set of one or more entries, in the inverted index, corresponding to the identification of the cluster in which to map the first query context vector and retrieving any document indicated by the first set of one or more entries.

3. The system of claim 1 , wherein the clustering algorithm is a k-means clustering algorithm.

4. The system of claim 1 , wherein the clustering algorithm is a k-nearest neighbor clustering algorithm.

5. The system of claim 1 , wherein the retrieved documents are interleaved with documents retrieved via a keyword-based retrieval process.

6. The system of claim 1 , wherein the query-based deep semantic similarity neural network includes a hashing layer, an embedding layer, and a plurality of non-linear activation layers.

7. The system of claim 6 , wherein the plurality of non-linear activation layers have an activation unit of tan h.

8. A computerized method, comprising

in a training phase:

obtaining training data pertaining to sample job posting search queries, the training data comprising sample job posting search results and indications as to which of the sample job posting search results were selected by members performing corresponding job posting search queries;

for each of the sample job posting search queries, feeding the corresponding training data into a first machine learning algorithm to train a query-based deep semantic similarity neural network to output a query context vector for an input job posting search query and into a second machine learning algorithm to train a document-based deep semantic similarity neural network to output a document context vector for an input job posting;

mapping each query context vector and each document context vector into a cluster using a clustering algorithm;

in a retrieval phase:

obtaining a first job posting search query;

passing the first job posting search query into the query-based deep semantic similarity neural network to output a first query context vector;

identify a cluster in which to map the first document query vector using the clustering algorithm; and

retrieving documents contained in the identified cluster.

9. The method of claim 8 , further comprising:

adding an entry for each cluster identification to an inverted index, each entry further indicating a document mapped into a corresponding cluster; and

the retrieving documents further comprising locating a first set of one or more entries, in the inverted index, corresponding to the identification of the cluster in which to map the first query context vector and retrieving any document indicated by the first set of one or more entries.

10. The method of claim 8 , wherein the clustering algorithm is a k-means clustering algorithm.

11. The method of claim 8 , wherein the clustering algorithm is a k-nearest neighbor clustering algorithm.

12. The method of claim 8 , wherein the retrieved documents are interleaved with documents retrieved via a keyword-based retrieval process.

13. The method of claim 8 , wherein the query-based deep semantic similarity neural network includes a hashing layer, an embedding layer, and a plurality of non-linear activation layers.

14. The method of claim 13 , wherein the plurality of non-linear activation layers have an activation unit of tan h.

15. A non-transitory machine-readable storage medium comprising instructions, which when implemented by one or more machines, cause the one or more machines to perform operations comprising:

in a training phase:

obtaining training data pertaining to sample job posting search queries, the training data comprising sample job posting search results and indications as to which of the sample job posting search results were selected by members performing corresponding job posting search queries;

for each of the sample job posting search queries, feeding the corresponding training data into a first machine learning algorithm to train a query-based deep semantic similarity neural network to output a query context vector for an input job posting search query and into a second machine learning algorithm to train a document-based deep semantic similarity neural network to output a document context vector for an input job posting;

mapping each query context vector and each document context vector into a cluster using a clustering algorithm;

in a retrieval phase:

obtaining a first job posting search query;

passing the first job posting search query into the query-based deep semantic similarity neural network to output a first query context vector;

identify a cluster in which to map the first document query vector using the clustering algorithm; and

retrieving documents contained in the identified cluster.

16. The non-transitory machine-readable storage medium of claim 15 , further comprising:

adding an entry for each cluster identification to an inverted index, each entry further indicating a document mapped into a corresponding cluster; and

the retrieving documents further comprising locating a first set of one or more entries, in the inverted index, corresponding to the identification of the cluster in which to map the first query context vector and retrieving any document indicated by the first set of one or more entries.

17. The non-transitory machine-readable storage medium of claim 15 , wherein the clustering algorithm is a k-means clustering algorithm.

18. The non-transitory machine-readable storage medium of claim 15 , wherein the clustering algorithm is a k-nearest neighbor clustering algorithm.

19. The non-transitory machine-readable storage medium of claim 15 , wherein the retrieved documents are interleaved with documents retrieved via a keyword-based retrieval process.

20. The non-transitory machine-readable storage medium of claim 15 , wherein the query-based deep semantic similarity neural network includes a hashing layer, an embedding layer, and a plurality of non-linear activation layers.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 3, 2017
From: LINKEDIN CORPORATION
To: MICROSOFT TECHNOLOGY LICENSING, LLC
Reel/Frame 044779/0602 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 25, 2017
From: KATARIA, SAURABH; ARYA, DHRUV; VENKATARAMAN, GANESH
To: LINKEDIN CORPORATION
Reel/Frame 043089/0560 →
Continuity (1)
Related Publication 20190034793A1 · Jan 31, 2019