Granted Patent B1

US 10,387,837 · App. 12/427,725 · Granted Aug 20, 2019

Inventor: Matthew Mund (Maynard, MA)

Assignee: Monster Worldwide, Inc.

G06Q10/105G06Q10/1053

Abstract

Claims (113)

1. An objective advancement processor-implemented method, comprising:

obtaining objective experience information from an objective seeker;

obtaining objective advancement information from the objective seeker;

querying a multi-directional graph state structure with the experience information resulting in experience state query results, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

identifying a starting state from the experience state query results that best matches the experience information, wherein the starting state represents an objective seeker's path of objective experience information;

querying, iteratively, a multi-directional graph state structure with the advancement information resulting in advancement state query results;

identifying, iteratively, a target state from the advancement state query results that best matches the advancement information, wherein the advancement state query results are filtered by attributes and a threshold state likelihood;

searching, through iterative query and identification, the multi-directional graph state structure for an interconnected graph path connecting the starting state and target state resulting in at least one objective advancement path, wherein each of the state elements in the interconnected graph path was filtered by attributes and a threshold state likelihood, and wherein the interconnected graph does not exceed a specified length;

presenting the at least one objective advancement path to the objective seeker;

obtaining selections of any two states within the at least one objective advancement path;

performing a gap analysis as between the two states;

generating a datastructure for visualization of the gap analysis between the two states; and

providing the generated datastructure to a requester.

2. An objective advancement processor-implemented method, comprising:

obtaining a start state from an advancement path, said advancement path comprising an interconnected graph path connecting the starting state and at least a second state;

obtaining the second state from the advancement path;

querying an advancement multi-directional graph state structure for a matching start state connected to a matching second state, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

querying an attribute database for feature information associated with the matched start state;

querying the attribute database for state change indicators associated with the matched start state;

querying the attribute database for feature information associated with the matched second state;

querying the attribute database for state change indicators associated with the matched second state;

calculating a features gap by subtracting: feature information returned from the query of first state, from feature information returned from the query of second state;

generating a datastructure for visualization of the features gap; and

providing the generated datastructure to a requester.

3. The method of claim 2 , further comprising:

calculating a state change indicators gap by subtracting: state change indicator information returned from the query of first state, from, state change indicator information returned from the query of second state.

4. An objective advancement processor-implemented system, comprising:

means to obtain objective experience information from an objective seeker;

means to obtain objective advancement information from the objective seeker;

means to query a multi-directional graph state structure with the experience information resulting in experience state query results, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

means to identify a starting state from the experience state query results that best matches the experience information, wherein the starting state represents an objective seeker's path of objective experience information;

means to query, iteratively, a multi-directional graph state structure with the advancement information resulting in advancement state query results;

means to identify, iteratively, a target state from the advancement state query results that best matches the advancement information, wherein the advancement state query results are filtered by attributes and a threshold state likelihood;

means to search, through iterative query and identification, the multi-directional graph state structure for an interconnected graph path connecting the starting state and target state resulting in at least one objective advancement path, wherein each of the state elements in the interconnected graph path was filtered by attributes and a threshold state likelihood, and wherein the interconnected graph does not exceed a specified length;

means to present the at least one objective advancement path to the objective seeker;

means to obtain selections of any two states within the at least one objective advancement path;

means to perform a gap analysis as between the two states;

means to generate a datastructure for visualization of the gap analysis between the two states; and

means to provide the generated datastructure to a requester.

5. An objective advancement processor-implemented system, comprising:

means to obtain a start state from an advancement path, said advancement path comprising an interconnected graph path connecting the starting state and at least a second state;

means to obtain the second state from the advancement path;

means to query an advancement multi-directional graph state structure for a matching start state connected to a matching second state, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

means to query an attribute database for feature information associated with the matched start state;

means to query the attribute database for state change indicators associated with the matched start state;

means to query the attribute database for feature information associated with the matched second state;

means to query the attribute database for state change indicators associated with the matched second state;

means to calculate a features gap by subtracting: feature information returned from the query of first state, from, feature information returned from the query of second state;

means to generate a datastructure for visualization of the features gap and

means to provide the generated datastructure to a requester.

6. The system of claim 5 , further, comprising:

means to calculate a state change indicators gap by subtracting: state change indicator information returned from the query of first state, from, state change indicator information returned from the query of second state.

7. The system of claim 6 , further, comprising:

present the calculated features gap and state change indicators gap.

8. An objective advancement processor-readable non-transitory medium storing a plurality of processing instructions, comprising issuable instructions by a processor to:

obtain objective experience information from an objective seeker;

obtain objective advancement information from the objective seeker;

query a multi-directional graph state structure with the experience information resulting in experience state query results, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

identify a starting state from the experience state query results that best matches the experience information, wherein the starting state represents an objective seeker's path of objective experience information;

query, iteratively, a multi-directional graph state structure with the advancement information resulting in advancement state query results;

identify, iteratively, a target state from the advancement state query results that best matches the advancement information, wherein the advancement state query results are filtered by attributes and a threshold state likelihood;

search, through iterative query and identification, the multi-directional graph state structure for an interconnected graph path connecting the starting state and target state resulting in at least one objective advancement path, wherein each of the state elements in the interconnected graph path was filtered by attributes and a threshold state likelihood, and wherein the interconnected graph does not exceed a specified length;

present the at least one objective advancement path to the objective seeker;

obtain selections of any two states within the at least one objective advancement path;

perform a gap analysis as between the two states;

generate a datastructure for visualization of the gap analysis between the two states; and

provide the generated datastructure to a requester.

9. An objective advancement processor-readable non-transitory medium storing a plurality of processing instructions, comprising issuable instructions by a processor to:

obtain a start state from an advancement path, said advancement path comprising an interconnected graph path connecting the starting state and at least a second state;

obtain the second state from the advancement path;

query an advancement multi-directional graph state structure for a matching start state connected to a matching second state, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

query an attribute database for feature information associated with the matched start state;

query the attribute database for state change indicators associated with the matched start state;

query the attribute database for feature information associated with the matched second state;

query the attribute database for state change indicators associated with the matched second state;

calculate a features gap by subtracting: feature information returned from the query of first state, from, feature information returned from the query of second state;

generate a datastructure for visualization of the features gap; and

provide the generated datastructure to a requester.

10. The medium of claim 9 , further, comprising:

calculate a state change indicators gap by subtracting: state change indicator information returned from the query of first state, from, state change indicator information returned from the query of second state.

11. The medium of claim 10 , further, comprising:

present the calculated features gap and state change indicators gap.

12. An objective advancement apparatus,

comprising: a memory;

a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to:

obtain objective experience information from an objective seeker;

obtain objective advancement information from the objective seeker;

query a multi-directional graph state structure with the experience information resulting in experience state query results, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

identify a starting state from the experience state query results that best matches the experience information, wherein the starting state represents an objective seeker's path of objective experience information;

query, iteratively, a multi-directional graph state structure with the advancement information resulting in advancement state query results;

identify, iteratively, a target state from the advancement state query results that best matches the advancement information, wherein the advancement state query results are filtered by attributes and a threshold state likelihood;

search, through iterative query and identification, the multi-directional graph state structure for an interconnected graph path connecting the starting state and target state resulting in at least one objective advancement path, wherein each of the state elements in the interconnected graph path was filtered by attributes and a threshold state likelihood, and wherein the interconnected graph does not exceed a specified length;

present the at least one objective advancement path to the objective seeker;

obtain selections of any two states within the at least one objective advancement path;

perform a gap analysis as between the two states;

generate a datastructure for visualization of the gap analysis between the two states; and

provide the generated datastructure to a requester.

13. An objective advancement apparatus,

comprising: a memory;

a processor disposed in communication with said memory, and configured to issue a plurality of processing instructions stored in the memory, wherein the processor issues instructions to:

obtain a start state from an advancement path, said advancement path comprising an interconnected graph path connecting the starting state and at least a second state;

obtain the second state from the advancement path;

query an advancement multi-directional graph state structure for a matching start state connected to a matching second state, wherein the multi-directional graph state structure comprises a datastructure of an interconnected graph topology of state nodes;

query an attribute database for feature information associated with the matched start state;

query the attribute database for state change indicators associated with the matched start state;

query the attribute database for feature information associated with the matched second state;

query the attribute database for state change indicators associated with the matched second state;

calculate a features gap by subtracting: feature information returned from the query of first state, from, feature information returned from the query of second state;

generate a datastructure for visualization of the features gap; and

provide the generated datastructure to a requester.

14. The apparatus of claim 13 , further, comprising:

calculate a state change indicators gap by subtracting: state change indicator information returned from the query of first state, from, state change indicator information returned from the query of second state.

15. The apparatus of claim 14 , further, comprising: present the calculated features gap and state change indicators gap.

Assignments (9)

Continuity (1)

Cited By (1)

US 12,198,213