Apparatuses, methods and systems for advancement path taxonomy

• US 9,830,575 B1
• Filed: 04/21/2009
• Issued: 11/28/2017
• Est. Priority Date: 04/21/2008
• Status: Expired due to Fees

• Current Assignee: Monster Worldwide Incorporated (Randstad NV)
• Original Assignee: Monster Worldwide Incorporated (Randstad NV)
• Inventors: Mund, Matthew
• Primary Examiner(s): Ouellette, Jonathan
• Application Number:
  US12/427,702
• Time in Patent Office: 3,143 Days
• Field of Search: 705 11-912
• CPC Class Codes: G06Q 10/10 Office automation; Time management
• CPC Class Codes: G06Q 10/105 Human resources
• CPC Class Codes: G06Q 10/1053 Employment or hiring

Abstract

The APPARATUSES, METHODS AND SYSTEMS FOR ADVANCEMENT PATH TAXONOMY (“APT”) provides mechanisms allowing advancement seekers to identify, map out, structure and interact with various advancement paths to the seeker'"'"'s goals. In one embodiment, the seekers are career advancement seekers, and the APT provides mechanisms allowing the seeker to explore various career paths and opportunities. In one embodiment, the APT interacts with a statistical engine, which allows seekers to map their experiences to various advancement states in the statistical engines state structure. By so doing, it allows seeker to explore multiple paths based on various criteria, and allows seekers to plan their career goals. In the process, the APT may establish a taxonomy connecting experience information with attribute information (and many other types of information) through states in a state structure. In other embodiments, the seekers may be students wishing to advance their academic advancements. In yet other embodiments, the seekers are financial seekers who wish to achieve their financial goals.

Claims

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

obtaining experience information that includes a unique experience industry code;

obtaining attribute information that includes a unique attribute identifier, wherein the attribute information is associated with the experience information either by the unique attribute identifier or the unique experience industry code;

determining a relationship as between the experience information and the attribute information by;

querying a vocational advancement graph state structure with the experience information wherein the vocational advancement graph state structure is a datastructure comprised of an interconnected graph topology of state nodes,

identifying a state from the query results that best matches the experience information;

mapping an association as between the experience information and the best matching state by;

storing the unique experience industry code in the best matching state,

storing a unique state identifier from the best matching state in the experience information;

mapping an association as between the attribute information and the best matching state;

instantiating an advancement state graph path from said mapping the association as between the experience information and the best matching state.

2. The method of claim 1, wherein the mapping an association as between the attribute information and the best matching state, further, comprises:

querying an advancement state structure with the attribute information,

identifying a state from the query results that best matches the attribution information;

mapping the association as between the attribute information and the best matching state by;

storing the unique attribute identifier in the best matching state,

storing a unique state identifier from the best matching state in the attribute information.

3. The method of claim 1, wherein the unique experience industry code is an OC code.

4. The method of claim 1, further, comprising:

obtaining user information that includes a unique user identifier, wherein the user information is associated with other information by its unique user identifier;

mapping an association as between user information and the best matching state by;

storing the unique information identifier in the best matching state,

storing the unique state identifier in the user information.

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

means to obtain experience information that includes a unique experience industry code;

means to obtain attribute information that includes a unique attribute identifier, wherein the attribute information is associated with the experience information either by the unique attribute identifier or the unique experience industry code;

means to determine a relationship as between the experience information and the attribute information by;

means to query a vocational advancement graph state structure with the experience information wherein the vocational advancement graph state structure is a datastructure comprised of an interconnected graph topology of state nodes,

means to identify a state from the query results that best matches the experience information;

means to map an association as between the experience information and the best matching state by;

means to store the unique experience industry code in the best matching state,

means to store a unique state identifier from the best matching state in the experience information;

means to map an association as between the attribute information and the best matching state;

means to instantiate an advancement state graph path from said map of the association as between the experience information and the best matching state.

6. The system of claim 5, wherein the mapping an association as between the attribute information and the best matching state, further, comprises:

means to query an advancement state structure with the attribute information,

means to identify a state from the query results that best matches the attribution information;

means to map the association as between the attribute information and the best matching state by;

means to store the unique attribute identifier in the best matching state,

means to store a unique state identifier from the best matching state in the attribute information.

7. The system of claim 5, wherein the unique experience industry code is an OC code.

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

means to obtain user information that includes a unique user identifier, wherein the user information is associated with other information by its unique user identifier;

means to map an association as between user information and the best matching state by;

means to store the unique information identifier in the best matching state,

means to store the unique state identifier in the user information.

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

obtain experience information that includes a unique experience industry code;

obtain attribute information that includes a unique attribute identifier, wherein the attribute information is associated with the experience information either by the unique attribute identifier or the unique experience industry code;

determine a relationship as between the experience information and the attribute information by;

query a vocational advancement graph state structure with the experience information wherein the vocational advancement graph state structure is a datastructure comprised of an interconnected graph topology of state nodes,

identify a state from the query results that best matches the experience information;

map an association as between the experience information and the best matching state by;

store the unique experience industry code in the best matching state,

store a unique state identifier from the best matching state in the experience information;

map an association as between the attribute information and the best matching state;

instantiate an advancement state graph path from said map of the association as between the experience information and the best matching state.

10. The medium of claim 9, wherein the mapping an association as between the attribute information and the best matching state, further, comprises:

query an advancement state structure with the attribute information,

identify a state from the query results that best matches the attribution information;

map the association as between the attribute information and the best matching state by;

store the unique attribute identifier in the best matching state,

store a unique state identifier from the best matching state in the attribute information.

11. The medium of claim 9, wherein the unique experience industry code is an OC code.

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

obtain user information that includes a unique user identifier, wherein the user information is associated with other information by its unique user identifier;

map an association as between user information and the best matching state by;

store the unique information identifier in the best matching state,

store the unique state identifier in the user information.

13. An advancement taxonomy 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 experience information that includes a unique experience industry code;

obtain attribute information that includes a unique attribute identifier, wherein the attribute information is associated with the experience information either by the unique attribute identifier or the unique experience industry code;

determine a relationship as between the experience information and the attribute information by;

query a vocational advancement graph state structure with the experience information wherein the vocational advancement graph state structure is a datastructure comprised of an interconnected graph topology of state nodes,

identify a state from the query results that best matches the experience information;

map an association as between the experience information and the best matching state by;

store the unique experience industry code in the best matching state,

store a unique state identifier from the best matching state in the experience information;

map an association as between the attribute information and the best matching state;

instantiate an advancement state graph path from said map of the association as between the experience information and the best matching state.

14. The apparatus of claim 13, wherein the mapping an association as between the attribute information and the best matching state, further, comprises:

query an advancement state structure with the attribute information,

identify a state from the query results that best matches the attribution information;

map the association as between the attribute information and the best matching state by;

store the unique attribute identifier in the best matching state,

store a unique state identifier from the best matching state in the attribute information.

15. The apparatus of claim 13, wherein the unique experience industry code is an OC code.

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

obtain user information that includes a unique user identifier, wherein the user information is associated with other information by its unique user identifier;

map an association as between user information and the best matching state by;

store the unique information identifier in the best matching state,

store the unique state identifier in the user information.

17. A non-transitory memory for access by an advancement taxonomy program component to be executed on a processor, comprising:

a processor operable data structure stored in the memory, the data structure having interrelated data types, wherein processor instructions embody the data types and associated data, including,

a data type to store a unique a vocational advancement graph state identifier;

a data type to store a state name;

a data type to store a state title;

a data type to store a state topics;

a data type to store a reference to a next state identifier;

a data type to store a reference to a previous state identifier;

a data type to store a reference to a unique attributes identifier;

a data type to store a reference to a unique experience code.

18. The data type of claim 17, wherein a value for the unique experience code is determined by querying an advancement state structure with experience information having the unique experience code to identify the data structure best matching the query.

19. The data type of claim 17, further, comprising:

a data type to store a reference to a unique user identifier.

20. The data type of claim 17, further, comprising:

a data type to store a reference to a unique institution identifier.