Apparatuses, methods and systems for advancement path taxonomy
원문보기
IPC분류정보
국가/구분
United States(US) Patent
등록
국제특허분류(IPC7판)
G06Q-010/10
G06Q-010/00
G06Q-010/08
G06Q-030/02
G06Q-030/08
출원번호
US-0427702
(2009-04-21)
등록번호
US-9830575
(2017-11-28)
발명자
/ 주소
Mund, Matthew
출원인 / 주소
Monster Worldwide, Inc.
대리인 / 주소
Hanchuk Kheit LLP
인용정보
피인용 횟수 :
1인용 특허 :
129
초록▼
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 pr
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.
대표청구항▼
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 infor
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.
연구과제 타임라인
LOADING...
LOADING...
LOADING...
LOADING...
LOADING...
이 특허에 인용된 특허 (129)
Berkley, David Arthur; Rabiner, Lawrence Richard; Sumner, Jr., Eric E., Active user registry.
Collins, Robert J.; Apodaca, Paul Joseph; Wand, Adam J.; Jones, III, Claude, Advertiser reporting system and method in a networked database search system.
Dailey, Matthew N.; Pathria, Anu K.; Laffoon, Mark A.; Crooks, Theodore J., Application-specific method and apparatus for assessing similarity between two data objects.
Clark Neil M. (St. Louis Park MN) Crow Gerald C. (Bloomington MN) Mueller Kent (Zumbrota MN) Roloff Michael (Burnsville MN) Henkel Scott (Bloomington MN) Lehtinen Allan W. (Plymouth MN), Automated method for selecting personnel matched to job criteria.
Fatseas Ted (1244 Orkney La. Cardiff CA 92007) Fatseas Amy E. (1244 Orkney La. Cardiff CA 92007) Kreklow Peter (249 S. Hwy 101 Solano Beach CA 92075) George John E. (4321 Goldfinch St. San Diego CA 9, Computer-aided interactive career search system.
Parrish Eve J. (Laguna Niguel CA) Freudenberg Rodney P. (La Crescenta CA) Scsigulinsky Albert (Claremont CA) Cho Richard (Montebello CA), Computer-based data integration and management process for workforce planning and occupational readjustment.
McGovern Robert J. ; Winchester ; Jr. James A. ; Evans Andrew B. ; Farmer Brian E. ; Koffman Jennie A. ; Walker Aaron P., Computerized job search system and method for posting and searching job openings via a computer network.
Robert J. McGovern ; James A. Winchester, Jr. ; Andrew B. Evans ; Brian E. Farmer ; Jennie A. Koffman ; Aaron P. Walker, Employment recruiting system and method using a computer network for posting job openings and which provides for automatic periodic searching of the posted job openings.
Bowman Dwayne ; Ortega Ruben E. ; Linden Greg ; Spiegel Joel R., Identifying the items most relevant to a current query based on items selected in connection with similar queries.
Turnbull,Donald R.; Schuetze,Hinrich, Interface and system for providing persistent contextual relevance for commerce activities in a networked environment.
Sobotka David (Sunnyvale) Leung Ka L. (San Jose) Inn Yul J. (Mountain View) Tokuda Lance (Milpitas CA), Method and apparatus for automatic categorization of applicants from resumes.
Gupta, Ashish; Norvig, Peter; Rajaraman, Anand, Method and apparatus for creating extractors, field information objects and inheritance hierarchies in a framework for retrieving semistructured information.
Walker, Jay S.; Mik, Magdalena; Jorasch, James A.; Van Luchene, Andrew S.; Kobayashi, Michiko; Gelman, Geoffrey M.; Sammon, Russell Pratt; Golden, Andrew P.; Stevenson, Adam, Method and apparatus for managing subscriptions.
Walker Jay S. ; Schneier Bruce ; Case T. Scott, Method and system for facilitating an employment search incorporating user-controlled anonymous communications.
Kamangar, Salar Arta; Veach, Eric; Koningstein, Ross, Methods and apparatus for ordering advertisements based on performance information and price information.
Harrell Douglas G. ; Williams Dennis C., Non-linear model predictive control method for controlling a gas-phase reactor including a rapid noise filter and method therefor.
Takahashi, Hidekazu, Photoelectric conversion device correcting aberration of optical system, and solid state image pick-up apparatus and device and camera using photoelectric conversion device.
Bowman Dwayne E. ; Ortega Ruben E. ; Hamrick Michael L. ; Spiegel Joel R. ; Kohn Timothy R., Refining search queries by the suggestion of correlated terms from prior searches.
Ford, James L.; Scofield, Christopher L.; Bowman, Dwayne E.; Ortega, Ruben E., Search query processing to provide category-ranked presentation of search results.
Davies Nicholas John,GBX ; Weeks Richard,GBX, Software agent for comparing locally accessible keywords with meta-information and having pointers associated with dist.
Toru Takahashi JP; Hisamitsu Kawaguchi JP; Noriyuki Yamasaki JP, Structured-text cataloging method, structured-text searching method, and portable medium used in the methods.
Ortega Ruben Ernesto ; Bowman Dwayne Edward ; Hamrick Michael L. ; Spiegel Joel R. ; Kohn Timothy R., System and method for correcting spelling errors in search queries.
Ruben Ernesto Ortega ; Dwayne Edward Bowman, System and method for correcting spelling errors in search queries using both matching and non-matching search terms.
Fliess, Kevin V.; Waibel, Udo; Moore, Dennis B.; Vorgerd, Christoph, System and method for generating role templates based on skills lists using keyword extraction.
Macke Thomas J. ; Butler Bill F. ; O'Connell James P., System and method for searching and processing databases comprising named annotated text strings.
Liddy Elizabeth D. ; Paik Woojin ; McKenna Mary E. ; Weiner Michael L. ; Yu Edmund S. ; Diamond Theodore G. ; Balakrishnan Bhaskaran ; Snyder David L., User interface and other enhancements for natural language information retrieval system and method.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.