JP2009075690A - Job offer/job hunting information matching system - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To achieve efficiency of retrieval and matching about job offer/job hunting information by utilizing the field of expertise of each member while using the network of a membership system in a job offer/job hunting information matching system. <P>SOLUTION: The job offer/job hunting information matching system 10 is configured by connecting each member terminal 20 or the like through a network 12 to an information management computer 30. The CPU 32 of the information management computer 30 is provided with functions for updating the content of an information database 40; for receiving establishment information of job introduction establishment from each member terminal 20 or the like; for updating the content of a result database 42; for generating the latest result ranking; for transmitting the latest result ranking; for retrieving information data by specifying a retrieval key by referring to the latest result ranking or the like in response to an information data retrieval request from each member terminal 20 or the like; and for transmitting the results as candidate information data. <P>COPYRIGHT: (C)2009,JPO&INPIT

Description

  The present invention relates to a job hunting information matching system, and in particular, each member terminal of a plurality of job placement agencies providing job hunting information or job hunting information and an information management computer for matching job hunting information and job hunting information in a network. The present invention relates to a matching job hunting information matching system.

  When the demand of a job seeker seeking human resources and the demand of a job seeker seeking employment match within a certain range, the job seeker finds a job at the job seeker. A third party collects information on a large number of job seekers and information on a large number of job seekers, and achieves a certain degree of agreement between the requests of both, thereby introducing a human resource introduction. In this recruitment, by using the network, more job information and job search information can be collected or exchanged, and a certain degree of agreement between the two requests, that is, job search information can be matched more efficiently. It is expected.

  For example, in Patent Document 1, as a matching system for providing job hunting / job hunting information using the network, a job hunting / job hunting information specialized site was established on the network, and job hunting companies provided job hunting information and job hunting information. It is described that a person inputs a resume, desired information, etc., and both inputs a plurality of ranks to items to be prioritized in the desired information, and the control system automatically matches these input information. Here, the control system automatically digitizes the recruitment information of the recruiting company and the desired information of the job seeker, and displays the numerical value above a certain value for each recruitment information of the recruiting company. In addition, it is disclosed that application information can be supported by judging the difference between the two by automatically matching the desired information of the recruiting company and the resume of the job seeker, and displaying the digitized value.

  Patent Document 2 describes a human resource introduction mechanism using a human resource introduction company as a conventional technique. In other words, companies that have been approved for paid and free employment placement businesses post registration announcement advertisements in newspapers and job information magazines, etc., solicit registration, register job seekers after selecting documents, etc. This is a mechanism that selects the registrant that the recruiting company wants from among the applicants and introduces it to the recruiting company. It is also stated that this recruitment company has also set up a site on the Internet, provides recruitment information, recruitment registration information, and uses a means of collecting registrants (job seekers).

JP 2005-352925 A JP 2005-332280 A

  As described above, even in human resource introduction using an employment introduction company using conventional technology, it is possible to match job search information using a network. In particular, according to the numerical matching of the method of Patent Document 1, it can be expected that the desired information of the recruiting company and the resume of the job seeker are automatically matched. By the way, job placement companies are often small, with some exceptions, and it may be burdensome for a single company to establish a network. Therefore, it is conceivable that a recruitment information matching system for job recruitment based on membership is constructed and each member uses the network. However, each recruitment agency often has a field of expertise according to its scale. However, according to the membership network, job search information in various fields is mixed, so it takes time to search, or to search. A kind of know-how may be needed.

  An object of the present invention is to provide a job hunting information matching system that makes it possible to search for job hunting information and make matching more efficient by making use of the strength of each member while utilizing a membership network.

  In the job hunting information matching system according to the present invention, each member terminal of a plurality of job placement agencies providing job hunting information or job hunting information and an information management computer for matching job hunting information and job hunting information are connected via a network. A job offer information matching system, which receives job information or job information from a member terminal, registers and stores it as information data in association with a hierarchical search key, and information on establishment of job introduction from the member terminal Received and stored as performance data in association with information data on the established job introduction for each member terminal, and further classified by search key generated by classifying the performance data for each member terminal for each search key of the information data An achievement database for storing achievement achievement rankings, and an information management computer , A processing procedure for updating the information database every time job information or job search information is received from the member terminal, and a processing procedure for generating the latest performance ranking by updating the results database every time the establishment information of employment introduction is received from the member terminal For a member terminal that has a track record of establishing a career introduction, search by specifying a search key in response to the latest result ranking transmission processing procedure for transmitting the latest result ranking for the member terminal and an information data search request from the member terminal. And a candidate information data transmission processing procedure for transmitting the result as candidate information data.

  Further, in the job hunting job matching information matching system according to the present invention, the latest result ranking transmission processing procedure automatically transmits the latest result ranking related to the member terminal in response to an information data search request from a member terminal having a record of establishment of a job introduction. It is preferable to do.

  Further, in the job hunting information matching system according to the present invention, the information database predetermines an evaluation of the degree of mutual relation between a plurality of search keys in the same hierarchy of the search key as a relation evaluation degree. A relevance evaluation degree storage means for storing, and the candidate information data transmission processing procedure refers to the relevance evaluation degree for the requested search key, and sets a plurality of search keys having a predetermined relevance evaluation degree or higher. Among them, it is preferable to specify a search key having the highest rank in the transmitted latest performance ranking, and transmit the search result with the specified search key as candidate information data.

  Further, in the job hunting information matching system according to the present invention, there is provided map storage means for storing an association map for linking between the job search information search key and the job search information search key, and the candidate information data transmission processing procedure includes: When searching for information data from a member terminal, refer to the association map for the job search information search key or job search information search key specified by the member terminal and search for the corresponding partner job search information or job search information It is preferable to specify a key and transmit the search result with the specified search key as candidate information data.

  According to the job offer information matching system according to the present invention, the establishment information of establishment of employment introduction from the member terminal is received, and this is used as the result data, and the result data for each member terminal is classified for each search key of the information data, A performance ranking for each search key is generated, and the latest performance ranking is transmitted to the member terminal. The performance rankings often reflect the member's strengths, regardless of whether or not the member is conscious. By looking at this, the search key for the strength can be found and executed. Therefore, it is possible to improve the efficiency of searching and matching for job hunting information.

  Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings. In the following, an example of one member terminal and one job seeker will be described. However, this is an example of explanation and may be a case of a job seeker. Further, in the examples, the explanation will be made assuming that the job seeker is in the personnel field, but of course, it may be a job seeker or job seeker in a field other than this. Further, the contents of job offer information, the contents of job search information, and the association between them are only examples for explanation, and other contents may be used. The performance ranking is explained for each member terminal, but one occupation introduction company may be one member, and one member may have a plurality of member terminals. It may be the whole company.

  FIG. 1 is a diagram showing a configuration of a job offer information matching system 10. The job hunting information matching system 10 includes job information, job information, and member terminals 20, 22, 24, and 26 (hereinafter referred to as member terminals 20) of a plurality of job placement companies, job information and job information. An information management computer 30 that performs matching is connected via the network 12. As the network 12, for example, the Internet or the like can be used.

  The member terminal 20 or the like is a terminal provided in the office or the like of a job placement company that has joined as a member system in order to receive job matching information by the information management computer 30. Employment agencies may be subject to certain restrictions depending on the content of the membership system. For example, it may be subject to restrictions such as the qualification of a paid employment placement company or a certain membership fee sharing. Here, one member terminal 20 is assigned to each member. For example, the member terminal 20 is assigned to the “HCJ” company. The company name has no special meaning. As such a member terminal, a computer connectable to a network can be used, and for example, it can be constituted by an appropriate PC (Personal Computer).

  The information management computer 30 communicates with each member terminal 20, etc., receives job offer information or job search information, stores it in a database, executes processing of these data, and provides job offer information described in detail below. And a function to match job search information. The information management computer 30 can be composed of an appropriate information processing computer having a large capacity storage device and a network communication function.

  The information management computer 30 includes a CPU 32, a communication control unit 34 that communicates with each member terminal 20 and the like via the network 12, and a storage device 36. In addition, an input unit such as a suitable keyboard and an output unit such as a display may be provided. Each of these elements is connected to each other by an internal bus.

  In addition to storing various programs, the storage device 36 includes an information database 40, a performance database 42, an association map storage unit 44, and a relevance evaluation degree storage unit 46, in particular. As the storage device 36, a large-capacity magnetic storage device such as a hard disk can be used.

  The information database 40 included in the storage device 36 has a function of receiving job search information or job search information from each member terminal 20 or the like, and registering and storing it as information data in association with a search key having a hierarchical structure.

  FIG. 2 is a diagram showing an example of job search information 62 included in the job search slip 60 and job search information 66 included in the job search slip 64. FIG. 2 also shows an example of an association map 45 described later. The job offer information 62 includes, for example, company personal information such as the address, company name, etc. of the recruiting company X, its business type, business content, employment type, job type, work content, work location, and other desired conditions for the job seeker. Includes age, educational background, eligibility requirements, and annual income range, plus information on working hours, holidays, social insurance, and benefits. Job search information 66 includes, for example, personal information such as the address and name of Mr. A who is a job seeker, current employment status, educational background, qualifications, language skills, etc. It includes years of experience and work history, and also includes desired employment form, desired job type, desired work location, and minimum desired annual income as a desired condition for the job seeker.

  The job search information 62 and job search information 66 shown in FIG. 2 correspond to the uppermost search key when searching for each information. FIG. 3 is a diagram illustrating an example of a hierarchical structure 70 of search keys. Here, “Job title” in the job information 62 in FIG. 2 is the uppermost search key 71, and “Human Resources” and “Sales” are shown as the second-layer search key 72 as the lower layer. Other search keys for the second layer related to “job type” include accounting, purchasing, production, and the like. The second layer search key 72 is personnel, and the lower layer third layer search key 73 is “recruitment”, “labor”, “salary calculation”, “welfare”, “education”. Has been.

  Accordingly, the job search information or job search information received from each member terminal 20 or the like is registered and stored in the information database 40 of FIG. 1 in association with the hierarchical structure search key described in FIG. For example, if the job offer slip of Company X is “Job Type—Labor Manager”, it is registered and stored as “Job Type—Personnel—Labor” in the information database 40 as job offer information related to Company A.

  Returning to FIG. 1 again, the association map storage unit 44 included in the storage device 36 has a function of storing an association map that is a correspondence relationship between a search key for job search information and a search key for job search information. An example of the association map 45 is shown in FIG. The association map 45 is a set of correspondence relationships between the uppermost search keys that are items of the job offer information 62 and the uppermost search keys that are items of the job search information 66. In FIG. 2, these correspondence relationships are indicated by lines connecting corresponding items, and a set of correspondence relationships indicated by these lines corresponds to the association map 45.

  For example, here, the “employment form” of the job offer information 62 is linked as corresponding to the “desired employment form” of the job search information 66. Similarly, “job type” of the job information 62 is “job type” of the job information, “work content” of the job information 62 is “experience industry / year” and “job history” of the job information 62, “Job location” is “Job location” in job search information, “Education” in job information 62 is “Education” in job search information, “Eligibility” in job information 62 is “Holding qualification” in job search information 62 “annual income” is linked to “minimum desired annual income” in job search information.

  In FIG. 2, the association map 45 for the top of the search key having a hierarchical structure has been described. However, an association map is also prepared among the search keys of the lower hierarchy, and these are stored in the association map storage unit 44 of FIG. Is done.

  In FIG. 1, the association map storage unit 44 is a set of lines connecting the corresponding search keys as shown in FIG. 2 with the correspondence between the search key for job information and the search key for job search information. However, the correspondence relationship may be indicated by a method other than the map. For example, it may be a correspondence table or a read-only memory in which when one corresponding search key is input, the other search key is output.

  Returning to FIG. 1 again, the record database 42 included in the storage device 36 receives establishment information on establishment of employment introduction from each member terminal 20 and the like, and for each membership terminal 20 etc., information data on the established employment introduction is obtained. The data is stored in association with the result data, and the result data for each search key generated by classifying the result data for each member terminal 20 for each search key of the information data is stored.

  The performance database 42 has a function of storing two types of data as described above. One stores association information on establishment of occupation introduction in association with each member terminal 20 or the like. For example, when HCJ, which is a member, introduces Mr. A to Company X and a job introduction is established, the date of establishment and a search key related to the established content are stored. For example, “2007.4.01: Job seeker personal information-Company X: Job seeker personal information-Mr. A: Job type-Personnel-Salary calculation: Annual income-10 million yen: ..." Information data is stored.

  Another function is a function of updating and storing the result ranking generated by the function of the result database update / result ranking generation module 52 of the CPU 32 based on these pieces of information data. As described above, the performance ranking is obtained by classifying the performance data for each member terminal 20 or the like for each search key of the information data and arranging the results in descending order.

  FIG. 4A shows an example of the performance ranking 43. In this example, HCJ's occupation introduction results in a predetermined period are classified by search key in the next hierarchy of “job type” − “personnel” and are arranged in order of the number of results. According to this, it can be seen that, in the field of “HR”, HCJ has made many achievements in introducing jobs related to “salary calculation”.

  Thus, when the latest performance ranking 43 is seen, the establishment field of the job introduction handled by the member terminal can be understood at a glance. In other words, since the latest performance ranking 43 indicates the field of expertise of the member having the member terminal, in the case of a job offer / job seeking that matches this search key, the job introduction is relatively early, It can be expected to be established easily. That is, by using the search key higher in the latest result ranking 43, it can be expected that the matching efficiency of the job search information is improved.

  Actually, there may be a case where the request for job hunting does not correspond to the top of the latest performance ranking 43. Compared to FIG. 4 (a), FIG. 4 (b) shows the job history of Mr. A, the job seeker who requested HCJ for job placement. Mr. A's work history is inexperienced in payroll accounting, which is the specialty of HCJ, but rather it is clear that he has deep experience in benefits. In such a case, there is a possibility that using the search key higher in the latest performance ranking 43 does not necessarily lead to establishment of the job introduction.

  Returning to FIG. 1 again, the relevance evaluation degree stored in the relevance evaluation degree storage unit 46 included in the storage device 36 is used in such a case. The degree of relevance evaluation is to determine in advance an evaluation of the degree of relevance between a plurality of search keys in the same hierarchy of the hierarchical structure related to the search key.

  FIG. 5 is a diagram illustrating an example of the relevance evaluation degree 47. Here, for easy comparison with the example described with reference to FIGS. 4A and 4B, the evaluation of the degree of interrelationship between a plurality of search keys in the next layer of “job type” − “personnel” It is shown. In FIG. 5, the magnitude of the correlation indicates that “10” indicates perfect match, and the smaller the number, the lower the correlation. For example, considering the employment experience of “recruitment”, this experience is useful in the field of “education” with a relevance of about “5”, but in the field of “welfare”, it is about “2”, “salary calculation” In the field of “labor”, it is evaluated as useful with a relevance of about “1”.

  Such an assessment is relative, but it can be done fairly objectively, based on job placement experience. Therefore, the result of the relevance evaluation performed in advance can be stored in the form of a correspondence table as shown in FIG. Further, what is stored in the relevance evaluation degree storage unit 46 of FIG. 1 may indicate the correspondence by a method other than the format of the correspondence table described in FIG. For example, when two corresponding search keys are input, a calculation format in which a degree of relevance evaluation between the two search keys is output may be stored. Also, a calculation format for inputting one corresponding search key and the magnitude of the evaluation degree and outputting another search key having a relevance higher than the input evaluation degree may be stored.

  The relevance evaluation degree 47 in FIG. 5 can be used as follows. Below, it demonstrates using the code | symbol of FIGS. 1-4. In FIG. 4 (a), HCJ has many achievements in the introduction of occupations in the “salary calculation” field, so if the information database 40 can be searched using the “salary calculation” search key, The matching efficiency can be expected to increase. However, as shown in FIG. 4B, Mr. A has no experience in “salary calculation”, but rather has much experience in the field of “welfare”. Therefore, referring to the relevance evaluation degree 47 in FIG. 5, it can be seen that the experience in the field of “welfare” is useful for the field of “salary calculation” with a degree of “5”.

  Therefore, HCJ searches the information database 40 using the experienced “salary calculation” search key rather than searching the information database 40 using the search key of “welfare” with little experience. Can do. In other words, “welfare benefits” and “salary calculation” are quite relevant, so it is better to introduce information that matches the other conditions of Mr. A from the information data searched for “salary accounting”. The company can make use of its rich experience and improve the efficiency of matching job information.

  Returning to FIG. 1 again, the CPU 32 includes an information database registration / updating module 50, a performance database update / result ranking generation module 52, a latest performance ranking transmission module 54, and a candidate information data transmission module 56. These functions can be realized by executing software, and more specifically, by executing a corresponding job search information matching program. Some of these functions may be realized by hardware.

  The operation of this configuration, in particular, each function of the CPU 32 will be described with reference to the flowcharts of FIGS. Below, it demonstrates using the code | symbol of FIGS. 1-5. The flowcharts of FIGS. 6 to 8 show the procedure for the job hunting information matching process, and each procedure corresponds to each processing procedure of the corresponding job hunting information matching program. In the following, an example in which Mr. A who is a job seeker requested HCJ to introduce a job seeker will be described.

  First, Mr. A who is a job seeker makes a job search request with a resume, etc. (S10), and HCJ conducts interviews, etc., if necessary, creates a job search slip 64 and receives it (S12). . Since steps S10 and S12 are procedures between Mr. A and the person in charge of HCJ, they are indicated by broken line frames in FIG. In the following, a process that is merely a human work procedure is indicated by a broken-line frame, and is distinguished from a process related to a member terminal and an information management computer.

  HCJ uses the member terminal 20 to transmit Mr. A's job search information based on the job search slip 64 to the information management computer 30 via the network 12 (S14), and the information management computer 30 receives this (S16). This is registered and stored in the information database 40 as information data (S18). Registration is executed in association with the member terminal 20. Steps S14 to S18 are processed while being sequentially updated at an arbitrary time as soon as other job information and job search information are available. Steps S <b> 16 and S <b> 18 are executed by the function of the information database registration / update module 50 in the CPU 32 of the information management computer 30.

  At an appropriate timing, HCJ transmits a search request to the information management computer 30 in order to search for job information corresponding to Mr. A using the member terminal 20 (S20). A request is received (S22). The search request can be made, for example, by clicking a mark such as “search request” on the operation screen of the member terminal 20. At that time, ID information indicating that HCJ is a member is input, and the information management computer 30 can authenticate the ID and then proceed to subsequent processing.

  When the search request is received in S22, the information management computer 30 determines the presence / absence of performance data for HCJ (S24). Specifically, the record database 42 is searched using the identification number of the member terminal 20 as a search key. The result data is data relating to the result of establishment of employment introduction as described above. If there is performance data, the process proceeds to S60 described in FIG. When there is no track record, it waits for search key transmission (S26) from the member terminal 20 and receives it (S28).

  When the search key is received from the member terminal 20, the information management computer 30 can, of course, search the information database 40 with the search key. However, if the search key transmitted from the member terminal 20 is a search key related to job search information, the job search information cannot be searched as it is. Therefore, the association map 45 stored in the association map storage unit 44 is read, and the counterpart search key corresponding to the received search key is specified (S30).

  For example, a case will be described in which the member terminal 20 transmits “desired job type” as a search key in the job search information in FIG. In this case, according to the association map 45 of FIG. 2, the correspondence search key of the job information of the other party is “job type”. Therefore, in S30, the counterpart search key is specified as “job type”. Even when the search key from the member terminal 20 includes a search key of a lower hierarchy, the corresponding search key is similarly specified using the association map in the lower hierarchy. The information management computer 30 can automatically specify the counterpart search key using the association map 45, and executes a search based on the search key specified in this way (S32).

  The information data searched using the specific search key and hit is transmitted as candidate information data to the member terminal 20 (S34), and the member terminal 20 receives it (S36). The function of S34 is executed by the candidate information data transmission module 56 of the CPU 32. The received candidate information data is examined by the person in charge of HCJ, and it is determined whether or not it can be introduced to Mr. A. If OK, the process proceeds to S40 in FIG. 7, and if not, the process returns to S20. Returning, the above steps are repeated using a new search key or the like.

  If it is determined OK in S36, in FIG. 7, the person in charge of HCJ introduces the recruiting company to Mr. A based on the candidate information data (S40), and Mr. A examines this (S42). Whether or not it is OK is consulted (S44). If it is not OK, the process returns to S20 in FIG. 6 and the search of the information database 40 is continued. In the case of OK, the job introduction is established (S46). For example, in the case of the paid job introduction, the job seeker pays HCJ, etc. according to the contract. Then, the job introduction establishment data is transmitted as establishment information from the member terminal 20 to the information management computer 30 (S48), and the information management computer 30 receives it (S50). The received establishment information is associated with the member terminal 20, establishment date and time, search key, and the like as achievement data and stored in the achievement database 42 (S52). The stored performance data is updated every time a performance ranking 43 is generated for each member terminal, and the performance data is added, and is also stored in the performance database 42 as the latest performance ranking 43 (S54). Steps S <b> 50 to S <b> 54 are executed by the function of the performance database update / result ranking generation module 52 of the CPU 32. In addition, the example of the latest performance ranking 43 was demonstrated in Fig.4 (a).

  Returning to FIG. 6 again, if there is record data, job seeking information on Mr. A from HCJ is received in S16 with the latest record ranking 43. In S24, since it is determined that there is performance data, the process proceeds to S60 in FIG. 8 without proceeding to S28.

  If it is determined in S24 that there is performance data, the process proceeds to FIG. 8, and the performance ranking 43 is searched in the performance database 42 using the identification number or the like related to the member terminal 20 as a search key (S60). And the latest performance ranking 43 searched is transmitted to the member terminal 20 (S62), and the member terminal 20 receives this (S64). The function of S62 is executed by the function of the latest performance ranking transmission module 54 of the CPU 32.

  For example, the person in charge of the HCJ company that has received the latest performance ranking 43 having the contents described in FIG. 4A executes a search using the first search key of the latest performance ranking 43 and determines whether or not it is OK. Judgment is made (S66). This determination is made by comparing with the contents of Mr. A's work history as shown in FIG. 4 (b) when the latest performance ranking 43 is related to "job type" as shown in FIG. 4 (a). .

  If the content of Mr. A's work history matches the search key of the first place in the latest achievement ranking 43 of HCJ, the member terminal 20 transmits OK (S68). The information management computer 30 receives OK (S70), uses the first search key as the specific search key (S72), proceeds to S32 in FIG. 6, searches the information database 40 using the specific search key, and hits the information. Data is transmitted as candidate information data to the member terminal.

  As shown in FIG. 4B, when the content of Mr. A's work history does not match the first search key of the latest performance ranking 43 of HCJ, the member terminal 20 A desired search key considering the job history is transmitted (S74). In the example of FIG. 4B, “welfare” is transmitted as a desired search key. When the information management computer 30 receives the desired search key (S76), the information management computer 30 refers to the relevance evaluation degree 47 stored in the relevance evaluation degree storage unit 46, and performs another search that exceeds a predetermined relevance evaluation degree threshold. Whether or not there is a key is searched, and if there is, the rank in the latest result ranking 43 of the search key is referred to. For example, the threshold value of the relevance evaluation level is set to “5”, and a search is performed as to whether there is another search key with a relevance evaluation level of “5” or more for the desired search key. When the referred rank is higher than the rank of the desired search key in the latest performance ranking 43, another search key based on this relevance evaluation degree is specified as a search key for searching the information database 40 (S78).

  In the example of FIG. 5, the relevance rating is “5” for the search key for “payroll” as the search key for “welfare”, so refer to the latest ranking 43 for “payroll”. To do. As described above, “Salary calculation” is the first place in the latest performance ranking 43 of HCJ, and is higher than the third place which is the rank of “welfare” as a desired search key. In such a case, instead of the desired search key, “salary calculation”, which is another search key based on the degree of relevance evaluation, is specified as a search key for searching the information database 40. When the search key is specified, the process proceeds to S32 in FIG. 6, and the information database 40 is searched and executed using the specific search key, and the hit information data is transmitted to the member terminal as candidate information data.

It is a figure which shows the structure of the job offer job information matching system in embodiment which concerns on this invention. In embodiment which concerns on this invention, it is a figure which shows the example of job offer information and job search information, and the example of an association map. In embodiment concerning this invention, it is a figure which shows an example of the hierarchical structure of a search key. In embodiment which concerns on this invention, it is a figure explaining correspondingly the latest performance ranking and the job career of a job seeker. In embodiment which concerns on this invention, it is a figure which shows the example of a relevance evaluation degree. It is a flowchart which shows the procedure of the job offer job search information matching process in embodiment which concerns on this invention. It is a flowchart which shows the procedure connected to FIG. It is another flowchart which shows the procedure connected to FIG.

Explanation of symbols

  10 Job Recruitment Information Matching System, 12 Network, 20, 22, 24, 26 Member Terminal, 30 Information Management Computer, 32 CPU, 34 Communication Control Unit, 36 Storage Device, 40 Information Database, 42 Performance Database, 43 Performance Ranking, 44 Association map storage unit, 45 Association map, 46 Association evaluation degree storage unit, 47 Association evaluation degree, 50 Information database registration update module, 52 Results database update / results ranking generation module, 54 Latest results ranking transmission module, 56 Candidate information Data transmission module, 60 recruitment slip, 62 recruitment information, 64 recruitment slip, 66 recruitment information, 70 hierarchical structure, 71 top layer search key, 72 second layer search key, 73 third layer search key.

Claims (4)

A job hunting and job hunting information matching system in which each member terminal of a plurality of job placement agencies providing job hunting information or job hunting information and an information management computer for matching job hunting information and job hunting information are connected via a network,
An information database that receives job offer information or job search information from a member terminal, and registers and stores it as information data in association with a hierarchical search key;
Receives establishment information on establishment of employment introduction from the member terminal, stores it as performance data in association with information data on the established employment introduction for each member terminal, and further stores the achievement data for each member terminal for each search key of information data A performance database that stores performance rankings by search key generated by classification for each
Have
Information management computer
A procedure for updating the information database every time job information or job information is received from a member terminal
Every time we receive information on the establishment of a job placement from a member terminal, we update the achievement database and generate the latest achievement ranking,
The latest achievement ranking transmission processing procedure for transmitting the latest achievement ranking related to the member terminal to the member terminal having a career introduction establishment record,
In response to an information data search request from a member terminal, a search key is identified and searched, and the candidate information data transmission processing procedure for transmitting the result as candidate information data;
A job hunting information matching system characterized by In the job offer information matching system according to claim 1,
The latest performance ranking transmission processing procedure is as follows:
A job-seeking job-seeking information matching system, which automatically transmits the latest performance ranking for a member terminal upon request for information data from a member terminal having a record of establishment of a job introduction. In the job hunting information matching system according to claim 2,
Information database
Relevance evaluation degree storage means for preliminarily storing the evaluation of the degree of mutual relation between a plurality of search keys in the same hierarchy of the hierarchical structure related to the search key as a relevance evaluation degree;
The candidate information data transmission processing procedure is as follows:
Refer to the relevance evaluation level for the requested search key, and identify the search key that has the highest rank in the transmitted latest performance ranking among a plurality of search keys with a predetermined relevance evaluation level or higher. A job search information matching system for transmitting a result of searching with an identified search key as candidate information data. In the job offer information matching system according to claim 1,
Map storage means for storing an association map for performing a connection between a search key for job offer information and a search key for job search information;
The candidate information data transmission processing procedure is as follows:
Refer to the association map for the job search information search key or job search information search key specified by the member terminal when requesting information data search from the member terminal, or the corresponding partner job search information search key or job search information search key And a job search information matching system, wherein the result of searching with the specified search key is transmitted as candidate information data.

Images