Matthew D Dailey

US Patent:

6917952, Jul 12, 2005

Filed:

Nov 20, 2001

Appl. No.:

09/988620

Inventors:

Matthew N. Dailey - San Diego CA, US
Anu K. Pathria - La Jolla CA, US
Mark A. Laffoon - San Diego CA, US
Theodore J. Crooks - La Mesa CA, US

Assignee:

Burning Glass Technologies, LLC - San Diego CA

International Classification:

G06F017/30

US Classification:

707203, 707 5, 706 46

Abstract:

The similarity between two data objects of the same type (e. g. , two resumes, two job descriptions, etc. ) is determined using predictive modeling. A basic assumption is that training datasets are available containing compatibility measures between objects of the first type and data objects of a second type, but that training datasets measuring similarity between objects of the first type are not. A first predictive model is trained to assess compatibility between data objects of a first type and data objects of a second type. Then, in one scenario, pairs of objects of the first type are compared for similarity by running them through the first predictive model as if one object of the pair is an object of the first type and the other object of the pair is an object of the second type. Alternatively, for each object in a set of objects of the first type, the first predictive model is used to create a respective vector of compatibility scores against a fixed set of objects of the second type; these various vectors are then used to derive measures of similarity between pairs of objects of the first type, from which a second predictive model is trained, and the second predictive model is then used to assess the similarity of pairs of objects of the first type.

US Patent:

6965861, Nov 15, 2005

Filed:

Nov 20, 2001

Appl. No.:

09/988601

Inventors:

Matthew N. Dailey - San Diego CA, US
Dayne B. Freitag - La Mesa CA, US
Chalaporn Hathaidharm - Walnut CA, US
Anu K. Pathria - La Jolla CA, US

Assignee:

Burning Glass Technologies, LLC - San Diego CA

International Classification:

G06F017/27

US Classification:

704242, 704 1, 704 9, 715500, 715530, 715531

Abstract:

A Hidden Markov model is used to segment a data sequence. To reduce the potential for error that may result from the Markov assumption, the Viterbi dynamic programming algorithm is modified to apply a multiplicative factor if a particular set of states is re-entered. As a result, structural domain knowledge is incorporated into the algorithm by expanding the state space in the dynamic programming recurrence. In a specific example of segmenting resumes, the factor is used to reward or penalize (even require or prohibit) a segmentation of the resume that results in the re-entry into a section such as Experience or Contact Information. The method may be used to impose global constraints in the processing of an input sequence or to impose constraints to local sub-sequences.