JP4927458B2 - Wish list creation assist system - Google Patents

Description

  The present invention relates to a wish list creation assist system, and more particularly, to a wish list creation assist system for determining a combination that takes into account each bidirectional request.

  When performing matching, it is necessary to create a wish list (priority list) called ROL. For example, a method for matching a matching problem between sets having priority in both directions, such as a matching problem between a set of job applicants and a set of companies that accept applicants, is being proposed. However, this priority is set before the matching process from the wish list (see, for example, Non-Patent Document 1).

  Each candidate has a priority list that ranks the companies that she wants to work for according to preference, while each company also has a priority list that ranks the applicants that she wants to accept. The priority list ROL (a) of the applicant a is a subset of the set of companies, and is a total ordered set ordered by inequality signs that do not include equal signs by rank. Here, if the applicant a prefers p over p ′, p <p ′ is written (specifically, p is first in priority and p ′ is third in priority) In this case, p (= 1) <p ′ (= 3).) The same applies to the priority list ROL (p) for applicants of company p. Each company also has a recruitment frame (capacity) for accepting applicants. The capacity Q (p) of the company p is an integer of 0 or more. The matching X is a set composed of a pair (a, p) of a candidate and a company, and satisfies the following two conditions.

1. For any volunteer a, there are no more than one pair (a, p) containing a in X.
2. For an arbitrary company p, a pair (a, p) including p is equal to or less than Q (p) company capacity in X.

  An example of matching is shown in FIG. In FIG. 30, as a match between the set of applicants {a1, a2, a3, a4, a5, a6, a7} and the set of companies {p1, p2, p3, p4}, {(a1, p1), ( a2, p3), (a3, p4), (a5, p3), (a6, p4)}. In this matching, applicants a4 and a7 and company p2 have no matching partner.

  FIG. 31 shows an example of a priority list of applicants and companies. In each priority list, the more preferable ones are shown in the above list. In other words, the ranking increases as you go down. In the example of FIG. 31, the applicants place an order of p1 <p4 <p3 for the three companies. The company places the order of a7 <a1 <a4 <a3 <a5 <a6 among the six applicants. Opponents who do not want to match at all are not listed in the priority list.

  The matching problem refers to a problem of finding a combination between a candidate and a company when given a set of applicants, a group of companies, and a priority list of applicants and companies. The matching method is a solution to the matching problem, that is, a method for obtaining a combination between a candidate and a company. Therefore, the matching system is a system that executes a matching method.

  Moreover, stability can be defined for the above matching. The matching X is stable when the following two conditions are both satisfied.

1. All applicants (businesses) will only match the companies (applications) on their priority list.
2. All pairs (a, p) of applicants and companies not included in matching X are not blocking pairs. Here, the blocking pair satisfies both of the following three conditions.
2.0. a is described in the priority list of p, and p is described in the priority list of a.
2.1. In X, a does not match any company, or in X, a matches p ′, and p <p ′ holds in the priority list of a.
2.2. The number of applicants matching p in X is less than the capacity Q (p), or there is a candidate a ′ that matches p in X, and a <a ′ in the priority list of p Holds.

  In the matching problem, a method for generating a stable matching is required. When unstable matching is obtained, there is a candidate or company that matches with a partner that is not listed in the priority list, that is, a partner that is not desired at all, or there is a blocking pair. Unstable matching is not fair because both the candidate and the company making up the blocking pair are more likely to have a blocking pair partner than the obtained matching. In other words, the method for generating unstable matching loses the reliability for matching, and impairs the intention of the matching target person to participate in the matching.

  FIG. 32 is a flowchart showing a conventional matching method using the Gale-Shapley algorithm described in Non-Patent Document 1. The feature is that all applicants make proposals in order, starting with the company with the lowest ranking in their priority list (ie, the first choice).

  Before describing FIG. 32, the outline will be briefly described with reference to FIG. The example in FIG. 33 assumes a matching problem between a set of four hospitals and a set of eight applicants who wish to find employment in those hospitals. All applicants, from Akashi to Kudo, make proposals in order, starting with the company with the lowest ranking in their priority list.

Mr. Akashi first proposed to Futagawa Hospital. First, Mr. Akashi proposed to Futagawa Hospital. In both hospitals, Akashi is fourth in the priority list, so (Akashi, Futagawa Hospital) is provisionally matched.
Next, Mr. Inoue makes a proposal. In Mr. Inoue's priority list, since the first hope is Futagawa Hospital, Mr. Inoue proposes to Futagawa Hospital. At Futagawa Hospital, Ms. Inoue is fifth in the priority list, and there are two Futagawa Hospitals available for one person, so (Inoue, Futagawa Hospital) is provisionally matched.
Next, Ueno-san makes a proposal. In Mr. Ueno's priority list, the first hope is Futagawa Hospital, so Mr. Ueno proposes to Futagawa Hospital. At Futagawa Hospital, Mr. Ueno is 6th in the priority list, and there is no available space in Futagawa Hospital, so he proposes to the second desired hospital in the priority list. In Uchiyama Hospital, the second choice, Ueno is ranked first, so (Ueno, Ichiyama Hospital) is provisionally matched.

Next, Mr. Eguchi proposes to Ichiyama Hospital in the first hope, but because Mr. Eguchi is not in the priority list of Ichiyama Hospital, it is rejected and proposed to Futagawa Hospital in the second hope. Because it is 7th in the priority list of Futagawa Hospital and there is no capacity, it is rejected, and when it is proposed to the 3rd hope Mimura Hospital, it is named 6th (Eguchi, Mimura Hospital) Are provisionally matched.
Next, Mr. Okawa proposes to the first hope of Futagawa Hospital. Okawa is third in the Futagawa Hospital's priority list. The capacity is two people, and two people have already been provisionally matched. However, provisionally matched are Mr. Akashi 4th in the priority list and Mr. Inoue 5th. For this reason, Mr. Inoue with the highest ranking is excluded, and (Okawa, Futagawa Hospital) is provisionally matched.
Excluded, Inoue-san proposes again to the hospital with the lowest ranking in his priority list after Futagawa Hospital. The hospital is Ilsan Hospital. However, it is rejected because Mr. Inoue's name is not in the priority list of Ilsan Hospital. Mr. Inoue has been rejected by all hospitals because only the second request is registered in Mr. Inoue's priority list.

Next, Mr. Kawaguchi's processing is performed. In Kawaguchi's priority list, since the first hope is Futagawa Hospital, Mr. Kawaguchi proposes to Futagawa Hospital. At Futagawa Hospital, Mr. Kawaguchi is 8th in the priority list, and because there are no vacancies in Futagawa Hospital, he proposes to the second desired hospital in the priority list. In the priority list of the second choice Mimura Hospital, Kawaguchi-san is not named, so it is rejected. Similarly, at the third hope Ichiyama Hospital, the fourth choice Yotsuya Hospital has the name in the 6th place in the priority list, so (Kawaguchi, Yotsuya Hospital) is provisionally matched.
Next, Kimura proposes to Futagawa Hospital, the first hope. Mr. Kimura is first in the Futagawa Hospital priority list. The capacity is two people, and two people have already been provisionally matched. However, it is temporarily matched that Mr. Akashi 4th in the priority list and Mr. Okawa 3rd. For this reason, Mr. Akashi, who has the highest ranking, is excluded and (Kimura, Futagawa Hospital) is provisionally matched.

Excluded, Akashi-san re-proposes to the hospital with the lowest ranking in his priority list next to Futagawa Hospital, but only the first desired Futagawa Hospital is registered in Akashi-san's priority list. As a result, Akashi was rejected by all hospitals.
Next, Mr. Kudo proposes to Yotsuya Hospital, the first hope. In the priority list of Yotsuya Hospital, Kudo is fifth. There are two people, and one person has already been provisionally matched, but there is one room available. Therefore, (Kudo, Yotsuya Hospital) is provisionally matched.

Here, since all applicants are provisionally matched with one of the hospitals or rejected from all the hospitals listed in their own priority list, the processing ends.
Matching results are (Okawa, Futagawa Hospital), (Kimura, Futagawa Hospital), (Ueno, Ichiyama Hospital), (Eguchi, Mimura Hospital), (Kawaguchi, Yotsuya Hospital), (Kudo, Yotsuya Hospital) As a result, Akashi and Inoue were rejected by all hospitals listed on their priority list.

  With reference to the flowchart of FIG. 32 described above, this processing performed by taking FIG. 33 as an example will be described. In step S100, provisional matching is made an empty set in advance. In step S101, if there is no unprocessed applicant, the process ends. If there is, the following process is performed for one of the applicants a. In step S102, the index a. Indicates which number of companies in the priority list ROL (a) the applicant a proposes to a. Set i to 1. This indicates that all applicants, in turn, first propose to the company with the lowest ranking in their priority list. In step S103, the number of elements in the priority list ROL (a) is a. If it is smaller than i, the candidate a has finally failed to match any company, and the process returns to step S101. On the other hand, in step S103, the number of elements in the priority list ROL (a) is a. If it is not smaller than i, in step S104, a. Let the i-th company be p. If a is not included in the priority list ROL (p) of p in step S105, a. i to a. The setting is reset to i + 1, and the process returns to step S103. This is because the proposed company p rejects the proposed applicant a unless it is listed in the ROL (p), and the rejected applicant a has a ranking in the company's priority list ROL (a). This is equivalent to re-proposing to the next smaller company. On the other hand, if a is included in the priority list ROL (p) of p in step S105, in step S106, the number of applicants whose p is temporarily matched at that time must be less than the capacity Q (p). For example, the pair (a, p) is added to the provisional matching, and the process returns to step S101. On the other hand, in step S106, if the number of applicants for which p is provisionally matched at that time is not less than the capacity Q (p), in step S107, among the candidates who are provisionally matched with p, The priority list ROL (p) having the highest rank is defined as a1. The ranking in ROL (p) is compared between a1 and the proposal candidate a. If the rank of a is higher, a. i to a. The setting is reset to i + 1, and the process returns to step S103. This corresponds to the company p rejecting a if the rank of a is higher. The rejected applicant a will propose again to the company with the lowest rank in his priority list ROL (a) next to p. After this step S107, the number of applicants temporarily matching with the company p is equal to the capacity Q (p). In step S108, since the rank of a1 is higher than the rank of a, the pair (a, p) is added to the temporary matching, the pair (a1, p) is excluded from the temporary matching, and a is reset to a1. In step S109, a. i to a. The setting is reset to i + 1, and the process returns to step S103. In other words, the candidate (original a1) excluded from the provisional matching proposes again to the company with the lowest rank in his priority list next to p. The processing in FIG. 32 ends when all applicants are provisionally matched with any company or rejected from all companies listed in their priority list in step S101. is there. The provisional matching finally obtained at the stage when the processing of FIG. Note that Non-Patent Document 1 describes that matching obtained by the Gale-Shapley algorithm is stable.

“The Stable Marriage Problem”, D.M. Gusfield and R.W. W. Irving, The MIT Press, 1989, p. 9

As described above, in a conventional matching system, a one-to-one combination such as a candidate and a company is obtained by the well-established Gale-Shapley algorithm when a stable matching result is obtained.
However, for example, there is a case where a combination that is a pair M (M ≧ 2) has to be obtained, or a combination that has to be obtained in consideration of complicated conditions.
In such a case, the above-described matching system has a problem that a combination cannot be obtained.

  In addition, if it is inevitably necessary to obtain a one-to-M combination or a combination that takes into account complicated conditions using a conventional matching system, the required number of matching systems are prepared according to the contents of matching, or the same system is used. There was a problem that it was necessary to perform processing repeatedly and repeatedly.

  For that purpose, it is necessary to construct multiple systems and operate them at the same time, or it is necessary to perform the necessary number of operations continuously, which requires processing time. Since it is necessary to input the desired list ROL data a plurality of times, there is a problem that the user takes time, the data to be input is confused, and an input error occurs.

  The present invention has been made to solve such problems, and is desired by participants (or facility managers) in order to perform matching in consideration of complicated conditions in a one-to-multiple combination. Create a desired information file in which items and values related to the facility (or participant) are registered, and the facility administrator (or participant) creates a ROL file by inputting search information indicating the desired conditions. Therefore, it is an object of the present invention to obtain a wish list creation assisting system that is less time-consuming, has a fast processing time, and can reduce costs.

In the present invention, for the matching process for matching each element of a set A consisting of a plurality of elements and a set B consisting of a plurality of elements, the set B is set for each A element ID of each element of the set A. A priority list uniquely ranked for all or part of the elements of the group A, and for each B element ID of each element of the group B, uniquely ranks all or part of the elements of the group A This is a desired list creation auxiliary system for creating a priority list attached, and for each B element ID of the set B, item information for setting the contents of each item indicating the characteristics of the B element is stored. For each B element ID of the set B, for each B element ID of the set B, for each B element ID of the set A A set A information file in which item information for setting the contents of each item indicating the characteristics of the A element is stored, and desired information regarding the set B is stored for any item for each A element ID of the set A. For each A element ID of the above set A and the A element ID of the above set A, the specification of the value for each item is received from the desired search screen that accepts the search related to the set B, and the specified item and the value are used as matching condition information. extracts a matching B elements from the set B information file and set B would like information file matches the order of degree, each B element ID of the set B, for each item from the desired search screen for accepting a search for a set a, Baryuu And the specified item and value as matching condition information. Display a desired matching means for performing matching processing for extracting the A element that matches from Le and set A desired information file matches the order of degree, which is matched by the choice matching means, the item information of the B component of each A component ID as well as, in which a display means for displaying the item information of the a element in each B element ID.

In the present invention, for the matching process for matching each element of a set A consisting of a plurality of elements and a set B consisting of a plurality of elements, the set B is set for each A element ID of each element of the set A. A priority list uniquely ranked for all or part of the elements of the group A, and for each B element ID of each element of the group B, uniquely ranks all or part of the elements of the group A This is a desired list creation auxiliary system for creating a priority list attached, and for each B element ID of the set B, item information for setting the contents of each item indicating the characteristics of the B element is stored. For each B element ID of the set B, for each B element ID of the set B, for each B element ID of the set A A set A information file in which item information for setting the contents of each item indicating the characteristics of the A element is stored, and desired information regarding the set B is stored for any item for each A element ID of the set A. For each A element ID of the above set A and the A element ID of the above set A, the specification of the value for each item is received from the desired search screen that accepts the search related to the set B, and the specified item and the value are used as matching condition information. extracts a matching B elements from the set B information file and set B would like information file matches the order of degree, each B element ID of the set B, for each item from the desired search screen for accepting a search for a set a, Baryuu And the specified item and value as matching condition information. Display a desired matching means for performing matching processing for extracting the A element that matches from Le and set A desired information file matches the order of degree, which is matched by the choice matching means, the item information of the B component of each A component ID as well as, since it and display means for displaying the item information of the a element in each B element ID, 1 pair in a plurality of combinations, and, in order to perform the matching considering the complex conditions, desired It is possible to create a list, which requires less time, processing time is faster, and costs can be reduced.

Embodiment 1 FIG.
FIG. 1 is a diagram showing an overall configuration of a wish list creation assistance system according to Embodiment 1 of the present invention. As shown in FIG. 1, the wish list creation assisting system according to the first embodiment automatically generates a participant list ROL and a facility ROL, which are both wish lists, while considering both desired conditions. For example, using these ROLs, a matching server 100 for performing a matching process for determining a combination of a participant and a facility, a matching manager terminal 400 for managing and maintaining the matching server 100, and the participants From a participant terminal 200 for searching for a desired facility by operating, and a facility manager terminal 300 for searching for a desired participant by operating a facility manager working at the facility It is configured. The matching server 100, the participant terminal 200, the facility manager terminal 300, and the matching manager terminal 400 are connected by a communication network 500 such as the Internet.

  FIG. 2 is a diagram showing an internal configuration of each component shown in FIG. As shown in FIG. 2, in the matching server 100, a communication means 1 for communicating with the outside via the communication network 500 for communicating with the outside via the communication network 500, and a search processing means 2, desire registration means 5, desire matching means 8, and ROL creation means 11 for creating ROL (desired table, priority list). The ROL creation means creates the ROL and stores it in a storage device (not shown). In the matching server 100, an item master file 3, a value master file 4, a participant request information file 6, a facility request information file 7, a participant information file 9, a facility information file 10, and a facility Ten files of a ROL file 12, a participant ROL file 13, a value master file 14, and a value correspondence table 15 are stored. These may be stored in one common storage device, or may be stored in a plurality of storage devices.

  FIG. 20 shows an example of the item master file 3. As shown in FIG. 20, the item master file 3 has an item number, which is a reference number for identifying each item. And an item name, a classification indicating whether the item is for a participant or a facility, and a description of each item. Examples of the item for the participant include a facility code, name, location, capacity, number of doctors, subjects, number of hospitalizations (capacity that can be hospitalized), and monthly income of the resident (monthly income during the training period). Further, the facility item includes a user ID for identifying each participant, a name, a university name, a graduation year, a special skill, a place of birth, and the like.

FIG. 21 shows an example of the value master file (for registration) 4. In the value master file 4, as shown in FIG. For each, the contents of all values are stored. For example, item no. However, since “I001” is a facility code, the facility codes of all values (value 1, value 2,..., Value n) are stored. Item No. However, “I002” is the name of the facility, so the names of the facilities are stored for all the values (value 1, value 2,..., Value n).
The item is an item set to show the characteristics of the participants and facilities, and the value (value) is a value set for each item, and by specifying the value for multiple items, , Understand the overall characteristics and preferences of participants and facilities.

  FIG. 18 shows an example of the participant request information file 6. In the participant request information file 6, as shown in FIG. And its value is remembered. In FIG. 18, it is illustrated that the importance level is also stored, but in the present embodiment, it is assumed that there is no “importance level” in the file format of the participant request information file 6. In the example of FIG. 18, the participant with the user ID “001” is a facility in Tokyo or Kanagawa Prefecture, and wants a facility for internal medicine or pediatrics (the item “location” value is “Tokyo, Kanagawa”, The item “Course” has been designated as “Internal Medicine, Pediatrics”, and the participant whose user ID is “002” wants a facility with a monthly salary of 200,000 or more. I understand that.

  FIG. 19 shows an example of the facility request information file 7. In the facility request information file 7, as shown in FIG. And its value is remembered. In FIG. 19, it is illustrated that the importance level is also stored, but in the present embodiment, it is assumed that there is no “importance level” in the file format of the facility desired information file 7. In the example of FIG. 19, the facility code “A001” is the university where the university is from X or Y, and the special skill is judo or karate participants (residents). (University of X, Y) and item “special skill” are designated as “judo, karate”, and the facility code “A005” is from Nagasaki or Oita It can be seen that the university wishes to be a Z University participant (resident).

  FIG. 16 shows an example of the participant information file 9. In the participant information file 9, as shown in FIG. Every participant information is memorized. For example, Item No. However, since “I101” is a user ID, the user IDs of all participants are stored in ascending order. Item No. However, since “I102” is the name of the participant, the names of all the participants are stored. Further, the value for each item belonging to the user ID “001” has a configuration in which data stored in the same column (items arranged in one column from the top to the bottom of the screen) is associated with the user ID. . The same applies to the user ID “002” and thereafter.

  FIG. 17 shows an example of the facility information file 10. In the facility information file 10, as shown in FIG. Every facility information is memorized. For example, Item No. However, since “I001” is a facility code, the facility codes of all facilities are stored in ascending order. Item No. However, since “I002” is the name of the facility, the names of all the facilities are stored. Further, the value for each item belonging to the facility code “A001” is configured such that data stored in the same column (from the top to the bottom of the screen) is associated with the facility code. The same applies to the facility code “A002” and thereafter.

  FIG. 26B shows an example of the participant ROL file 13. In the participant ROL file 13, as shown in FIG. 26, the facility codes of the desired facilities are stored in order from the highest priority (that is, in order from the first desired) for each user ID.

  Although the facility ROL file 12 is not shown, the user IDs of the desired participants are stored in descending order of priority (that is, in order from the first desire) for each facility code.

  FIG. 22 shows an example of the value master file (for search) 14. In the value master file 14, as shown in FIG. For each, the contents of all values are stored. For example, Item No. However, since “I001” is a facility code, the facility codes of all values (value 1, value 2,..., Value n) are stored. Item No. However, since “I002” is the name of the facility, the names of the facilities are stored for all the values (value 1, value 2,..., Value n). Unlike the value master file (for search) 14 and the value master file (for registration) 4 shown in FIG. It is to include a parent value in which one value is developed, such as “Tohoku” or “Kanto” in “I003”. The parent value (“Tohoku” or “Kanto” in the above example) and the child value to be developed are associated in the value correspondence table 15.

  FIG. 23 shows an example of the value correspondence table 15 corresponding to the value master file (for search) 14. As shown in FIG. For each, detailed information included in the parent value is stored as a development value. For example, Item No. However, if “I003” is the location and the parent valuation is “Tohoku”, the expansion valuation is information on all prefecture names included in the “Tohoku” region, that is, “Aomori, Akita, Miyagi,.・ ” Item No. However, since “I006” is a subject, if the parent value is “internal medicine”, the expanded value is information on all subjects included in “internal medicine”, that is, “internal medicine, pediatrics, gastroenterology” , ... " Others are the same. In the value correspondence table 15, each item number of the value master file (for search) 14 is stored. The development value corresponding to the parent value of the master file is stored, and the value master table (for search) 14 and the value correspondence table 15 of the value master file (for search) 14 are paired. Regardless of the file format, the value correspondence table 15 may be included in the value master file (for search) 14, and the value correspondence table 15 does not have not only the parent value but also the development value. The configuration may also be such that all the values are registered. By including the parent value in the value master file (for search) 14, it is possible to provide a user interface that allows easy specification of search conditions.

Returning to the description of FIG. As shown in FIG. 2, an input unit 20, a display unit 21, a processing unit 22, and a communication unit 23 are provided in the participant terminal 200.
In addition, since the internal structure of the facility manager terminal 300 is the same as that of the participant terminal 200, description is abbreviate | omitted here.

  In the matching manager terminal 400, an input unit 30, a display unit 31, a processing unit 32, and a communication unit 33 are provided.

  Next, the operation will be described. FIG. 3 is a flowchart showing the overall processing flow of the system according to the first embodiment. As shown in FIG. 3, first, the participant terminal 200 receives a request regarding the facility from the participant, and transmits the input data to the matching server 100, so that the matching server 100 stores the data in the participant request information file. 6 (step S1) (details will be described later (see FIG. 4)). Further, the facility manager terminal 300 accepts a desired input regarding the participant from the facility manager, and transmits the input data to the matching server 100, so that the matching server 100 registers the data in the facility desired information file 7. (Step S2) (Details will be described later (see FIG. 5)). Next, the participant terminal 200 displays a wish search screen in accordance with the operation of the participant, accepts the desired input of the facility, and transmits it to the matching server 100, whereby the matching server 100 performs the matching process (step S3). (Details will be described later (see FIG. 6).) Further, the facility manager terminal 200 displays a wish search screen in accordance with the operation of the facility manager, receives a wish input for the facility participant, and transmits it to the matching server 100, whereby the matching server 100 performs the matching process. (Step S4) (Details will be described later (see FIG. 7)). Next, the matching server 100 displays the search result of the matching process in step S3 or S4 on the screen (step S5) (details will be described later (see FIG. 8)). Next, the matching server 100 creates a participant ROL file or facility ROL file based on the matching result of the matching process displayed in step S5, and creates the participant ROL file 13 or facility ROL file 12 respectively. Store (step S6) (details will be described later (see FIG. 9)). The process of step S1 → step S3 that operates according to the designation from the participant and the process of step S2 → step S4 that operates according to the designation from the facility manager do not need to be synchronized, and step S1 → step S3 → step S5 → The process of step S6 and the process of step S2, step S4, step S5, and step S6 are performed asynchronously at an arbitrary timing.

  FIG. 4 is a flowchart showing details of the process in step S1 described above. First, under the control of the processing means 22 of the participant terminal 200, the display means 21 displays a desired input screen (not shown) relating to the facility (step S11). First, the user ID is prompted to enter and a login process is performed (user authentication may be performed by a combination of a user ID and a password). Next, on the desired input screen, the item No. corresponding to the user ID input by the participant using the input means 20 is displayed. Then, the input of the value is received and registered in the storage means 24 (step S12). For example, “001”, which is the user ID of the user, is input as the user ID. “I003” (location of the facility) is entered as “Tokyo Metropolitan” as its value. Thus, a value is input for each item. Next, under the control of the processing means 22 of the participant terminal 200, the participant is prompted to input whether or not there is a next value designation for the same item (input of a plurality of values for the same item). If yes, the process returns to step S12. If the next value designation is not input in step S13, the process proceeds to step S14. When the process returns to step S <b> 12, the input unit 20 receives the next value designation input and registers it in the storage unit 24 under the control of the processing unit 22 of the participant terminal 200. For example, the same item No. "I003" (location of the facility) is entered as "Kanagawa" as the next value and stored. In step S14, the control of the processing means 22 of the participant terminal 200 prompts the participant to input whether or not another user ID has been input (one participant terminal is assigned to a plurality of participants). If there is a new login, the process returns to step S12. If there is no new login in step S14, the process proceeds to step S15. In step S15, the communication means 23 of the participant terminal 200 transmits the desired information stored in the storage means 24 to the communication means 1 of the matching server 100, whereby the desire registration means 5 of the matching server 100 causes the desired information to be received. The information is stored in the participant request information file 6 (see FIG. 18).

  FIG. 5 is a flowchart showing details of the process in step S2 described above. First, under the control of the processing means of the facility manager terminal 300, the display means displays a desired input screen (not shown) regarding the facility (step S21). First, the user is prompted to enter the facility code and performs login processing (the facility administrator may be authenticated by a combination of the facility code and password). Next, an input of an item and a value corresponding to the facility code input by the facility manager through the input unit of the facility manager terminal 300 on the desired input screen is received and registered in a storage unit (not shown) ( Step S22). For example, “A001”, which is its own facility code, is input as the facility code. "I103" (university name) is entered as "X university" as its value. Next, under the control of the processing means of the facility manager terminal 300, the facility manager is prompted to input whether there is a next valuation designation for the same item (a plurality of valuations for the same item). If there is, the process returns to step S22. If the next value designation is not input, the process proceeds to step S24. When the process returns to step S22, the input means receives the next value designation input under the control of the processing means of the facility manager terminal 300 and registers it in the storage means. For example, the same item No. “I university” is entered and stored as “Y university” as the next value. In step S24, the facility manager 300 prompts the facility manager to input whether another facility code has been entered or not (controls multiple facilities collectively) under the control of the processing means of the facility manager terminal 300. If there is, the process returns to step S22 and starts from the login process with the facility code. If there is no new facility code input in step S24, the process proceeds to step S25. In step S25, the communication unit of the facility manager terminal 300 transmits the desired information stored in the storage unit to the communication unit 1 of the matching server 100, so that the desired registration unit 5 of the matching server 100 causes the desired information to be stored. Is stored in the facility request information file 7 (see FIG. 19).

FIG. 6 is a flowchart showing details of the process in step S3 described above. First, when the participant terminal 200 recognizes that the facility request input process (a process in which the participant inputs a request for the facility) is designated by the participant under the control of the processing unit 22, the participant terminal 200 performs the login process. A login processing screen (not shown) is displayed. When a user ID (a password corresponding to the user ID can be combined) is input, the processing unit 22 passes the user ID to the matching server 100 via the communication unit 23 and the communication unit 1, and the processing unit ( By checking with the participant information file 9, it is determined whether or not to authenticate the user ID, and the authentication result is notified to the participant terminal 200. When the user ID is authenticated, the display means 21 displays a wish search screen shown in FIG. 24 (step S31). As shown in FIG. 24, the wish search screen is provided with input fields for inputting items and values respectively. An item is input by clicking the triangle button provided on the right side of the input field to display a pull-down menu, and selecting and clicking the corresponding item. In the value entry field, items that match the selected item are displayed. The “Register” button is clicked when it is desired to register a plurality of values for one item. The “Search” button is clicked when searching based on the input content. “-Registered search condition-” in the lower left of the screen displays the current search condition registered, and the displayed search condition is updated each time the registration button is pressed.
When the desired search screen is displayed in step S31, the search processing means 2 of the matching server 100 displays the item number for the participant in the item master file 3 in order to display the item pull-down menu. , The item name is transmitted to the participant terminal 200, and the apparatus waits for input from the participant. Thereafter, when the participant selects one item from the displayed pull-down menu (in the example of FIG. 24, “location” is selected), the processing means 22 selects the corresponding item number. Is sent to the matching server 100, and the search processing means 2 uses the item number. Is sent to the participant terminal 200, and the value information corresponding to the item stored in the value master file (for search) 14 is sent to the participant terminal 200, and the pull-down menu (triangle button is clicked) is selected as an item option. Displayed in step S32) (in the example of FIG. 24, “Tokyo”, “Chiba”, etc. are displayed in a pull-down menu). Next, the user waits for the “Register” button or the “Search” button to be clicked. When the “Register” button is clicked, the input search information is temporarily stored in the storage means 24 and the latest search condition is set. Is displayed in “-Registered search condition” in the lower left of the screen. On the other hand, when the “Search” button is pressed, the input search information or the search information previously stored in the storage unit 24 is transferred to the communication unit 1 of the matching server 100 (step S33). Here, a plurality of values can be specified for one item as search information. A plurality of items can be specified. Next, the communication means 1 of the matching server 100 passes the matching condition information designated from the participant terminal 200 to the processing means (not shown), and the processing means (not shown) passes the matching conditions to the desired matching means 8. (Step S34). Here, when the processing means (not shown) refers to the value correspondence table 15 in the value and determines that the value having the “expanded value” is designated, the “parent value” is selected. It is assumed that it is delivered to the desired matching means 8 after being developed to “Development Value”. Next, the desired matching means 8 selects the item number of the item. Thus, the matching condition information is matched with the facility information file 10 and the facility desired information file 7, and a search result display screen (details will be described later) as shown in FIG. 25 is displayed (step S35). That is, as for the items included in the search information, since the same item is registered in either the facility request information file 7 or the facility information file 10, the request matching means 8 uses the facility request information file 7 and the facility information. The file 10 is searched, and the facility information is displayed on the search result display screen in the order that matches the desired condition (search information) as a result of the search thus obtained. Moreover, you may comprise so that a "development value" may be displayed with respect to a user for reference. For example, designation of “Tohoku” regarding the location is expanded as “Aomori, Akita, Miyagi. Next, the desired matching means 8 stores matching result information as shown in FIG. 26A (step S36). In the matching result information, as shown in FIG. 26, only the facility code of the matched facility and its matching degree are stored for each user ID. The matching process in step S <b> 35 uses an algorithm that orders the matching condition information specified by the participant and whether or not the values for each item in the facility information file 10 and the facility desired information file 7 match.

FIG. 25 is an example of the search result display screen displayed in step S35 described above. As a result of the search, the facility information is displayed in the order that matches the desired conditions. The level of matching is expressed by “degree of matching”. The degree of match is calculated as follows.
(1) According to the number of matched items (the number of matched items is displayed as a percentage).
(2) Due to the match between the item and the value, the facility where the item matches the value is ranked higher, and the facility where the item matches but the value does not match is ranked lower.
(3) Ranking may be performed by the methods (1) and (2) above, and all the facilities may be displayed, or only a predetermined upper number (for example, the top 20 facilities) may be displayed.

  FIG. 7 is a flowchart showing details of the process in step S4 described above. First, when the facility manager terminal 300 recognizes that the participant wish input process (a process in which the facility manager inputs a request for the participant) is designated by the facility manager under the control of the processing means, the login process A login processing screen (not shown) for performing the above is displayed. When a facility code (a facility code and a corresponding password can be combined) is input, the processing means passes the facility code to the matching server 100 via the communication means and the communication means 1, and the processing means (not shown) of the matching server 100 is shown. 2) check with the facility information file 10 to determine whether or not to authenticate the facility code, and notify the facility manager terminal 300 of the authentication result. When the facility code is authenticated, the display means displays a desired search screen shown in FIG. 24 (step S41). Thereby, the search processing means 2 of the matching server 100 displays the item No. for facility in the item master file 3 in order to display the pull-down menu of items. , The item name is transmitted to the facility manager terminal 300, and the apparatus waits for input from the participant. Thereafter, when the facility manager selects one item from the displayed pull-down menu, the processing means selects the corresponding item number. Is sent to the matching server 100, and the search processing means 2 uses the item number. Is sent to the facility manager terminal 300, and the pull-down menu (triangle button is clicked) is selected as an item option. Are displayed) (step S42). Next, the user waits for the “Register” button or the “Search” button to be clicked. When the “Register” button is pressed, the input information is temporarily stored in the storage unit 24. On the other hand, when the “search” button is pressed, the input information or the information previously stored in the storage unit 24 is transferred to the communication unit 1 of the matching server 100 (step S43). Here, a plurality of values can be designated for one item. A plurality of items can be specified. Next, the communication means 1 of the matching server 100 passes the matching condition information designated from the facility manager terminal 300 to the processing means (not shown), and the processing means (not shown) passes the matching conditions to the desired matching means. 8 (step S44). Here, when the processing means (not shown) refers to the value correspondence table 15 in the value and determines that the value having the “development value” is designated, the “parent value” Is expanded to “development value” and then transferred to the desired matching means 8. Next, the desired matching means 8 selects the item No. Thus, the matching condition information is matched with the participant information file 9 and the participant desired information file 6 (step S45). That is, as for the items included in the search information, the same item is registered in either the participant wish information file 6 or the participant information file 9, and the items in the participant wish information file 6 and the participant information file 9 are stored. Search and match. As a result of the search thus obtained, participant information is displayed on the search result display screen (not shown, see FIG. 25) in the order that matches the desired condition (search information). Moreover, you may comprise so that a "development value" may be displayed with respect to a user for reference. Next, the desired matching means 8 stores matching information (step S46). In the matching result information (not shown, see FIG. 26), only the user ID of the matched participant and the degree of matching are stored for each facility code. The matching in step S45 uses an algorithm that orders the matching condition information designated by the facility manager and whether or not the values for each item in the participant information file 9 and the participant desired information file 6 match.

  FIG. 8 is a flowchart showing details of the process in step S5 described above. As described above, the process of step S5 is performed so as to display the corresponding search results according to designation from the participant or the facility manager. When processing is executed by designation of a participant, first, the desired matching means 8 of the matching server 100 constructs display information from the matching result stored in step S36 (step S51). Next, the configured display information is transmitted from the communication unit 1 of the matching server 100 to the communication unit 23 of the participant terminal 200 (step S52). Next, the display means 21 of the participant terminal 200 displays the display information on the screen of the participant terminal 200 under the control of the control means 22 (step S53). Note that this is a case of displaying on the participant terminal 200, but also when displaying on the facility manager terminal 300, the matching result stored in step S46 is used to display according to the same processing flow.

  Hereinafter, the display of the matching result in FIG. 8 will be described. Matching results are displayed in a tabular format or as a two-dimensional graph.

(1) Display in tabular format • Display in ascending order / descending order in the desired degree of match.
・ Displays in descending order and ascending order in descending order of “Match”.
-As a result of rearrangement, the character string of the facility with high importance is displayed large, or among the facilities, the item with a positive "Degree of match" is highlighted (change font, change font size, Color, frame, underline, thicken characters, increase spacing, etc.).
・ If there is the same part of the facility (for example, the valuation of the item matches, or the part of the participant request information for search that has a high degree of importance, the facility information has the same part in the facility request information, etc.) By arranging them close, emphasizing the same part, grouping (collectively framed), performing the same highlighting, etc., it is possible to emphasize the identity and difference of the facilities.

(2) Display as a two-dimensional graph • The vertical axis represents the number of matches between items and values, and the horizontal axis represents the total values shown below (such as “desired number of matches” and “degree of confirmation”) in a two-dimensional graph. Moreover, it is good also as a three-dimensional graph which combined these. In this case, when a facility appearing on the graph is clicked or the mouse pointer is moved over the facility, information on the facility is displayed.
・ The desired degree of match is the value on the horizontal axis.
・ Display in ascending or descending order according to the importance of search information.
・ Displays in descending order and ascending order in descending order of “Match”.
・ The horizontal axis and vertical axis may be reversed.
-A table-type display method and a graph-type display method may be combined. For example, clicking on a graph highlights the table, or clicking on a facility on the table may cause the facility on the graph to blink or change color.

FIG. 9 is a flowchart showing details of the process in step S6 described above. First, the desired matching means 8 of the matching server 100 delivers the matching result information shown in FIG. 26A stored in step S36 to the ROL creating means 11 (step S61). Next, the ROL creation means 11 takes out the user ID and the facility code from the passed matching result (step S62). Next, the ROL creation unit 11 creates a participant ROL file 13 corresponding to the extracted user ID. (Step S63)
Similarly, in the process of creating the facility ROL file 12, the facility ROL file 12 is generated by extracting the facility code and the user ID based on the matching result information stored in step S46.
The method for generating the participant ROL file 13 and the facility ROL file 12 from the matching result information is as follows.
(1) Register only the facilities where the item and the value are completely matched in descending order of match.
(2) Accept designation from the participant.
(3) A threshold is set based on the degree of match, and those with a degree of match equal to or greater than the threshold are registered.
(4) A predetermined number is set such as the upper number, and the number of the number is registered.

  In the present invention, the participant ROL file 13 and the facility ROL file 12 are automatically generated as described above. The matching process is performed using the participant ROL file 13 and the facility ROL file 12 thus obtained. By performing the above, a highly reliable and stable matching process can be performed. As a matching method used in the matching process, for example, the above-described Gale-Shapley algorithm is desirable.

As described above, in the present embodiment, for the matching process for matching each element of the set A (participant set) consisting of a plurality of elements and the set B (set of facilities) consisting of a plurality of elements, For each A element ID (user ID) of each element of the set A (participant set), a priority list (participant) uniquely ranked for all or part of the elements (facility) of the set B This is a description of a wish list creation assistance system (matching server 100, participant terminal 200, facility manager terminal 300) for creating a (ROL file).
The wish list creation auxiliary system is a set B information file (facility information file 10) in which item information for setting the value of each item indicating the characteristics of the B element is stored for each B element ID (facility code) of the set B. In addition, for each B element ID (facility code) of the set B, a set B desired information file (facility desired information file 7) in which desired information regarding the set A (participant) is stored for an arbitrary item is not illustrated. It is stored in the storage device. The display means 21 of the participant terminal 200 displays a desired search screen (described in FIG. 24) for accepting a search related to the set B (facility) for each A element ID (user ID) of the set A (participant). The specification of the value for each item is accepted from the desired search screen, and the desired matching means 8 uses the item and the value specified from the set A (participant) on the desired search screen as the matching condition information, and the set B information file (facility information) Matching process (matching condition information specified by the participant, facility information file 10 and facility request information) for extracting matching items from the file 10) and the set B desired information file (facility request information file 7) in order of match An algorithm for ordering according to whether the value of each item matches the file 7, and the participant terminal 200 Display means 21 displays the item information which is matched by the choice matching means 8, B elements (facilities).
The ROL creation unit 11 stores the list of B elements (facility codes) matched by the desired matching unit 8 as a priority list (participant ROL file 13) of the corresponding A element (user ID).
In addition, when receiving a specification of a value related to a specific item from a participant on the desired search screen, the value correspondence table 15 (see FIG. 22) of the value master file (for search) 14 (described in FIG. 22) and the value master file (for search) is displayed. 23), the value includes one constituted by one value and a parent value constituted by one or more values called a development value. When the processing unit (not shown) refers to the value correspondence table 15 and determines that the parent value has been designated, the processing unit expands the parent value into the expansion value and then delivers it to the desired matching unit 8. Matching processing is performed by using the expanded value in which the parent value has been expanded.

Further, the wish list creation auxiliary system (matching server 100, participant terminal 200, facility manager terminal 300) includes a set A (set of facilities) composed of a plurality of elements and a set B (set of participants) composed of a plurality of elements. ) For all elements (participants) of the set B for each A element ID (facility code) of each element of the set A (facility set) Create a priority list (facility ROL file) uniquely ranked for a part.
At this time, the wish list creation assisting system stores, for each B element ID (participant ID) of the set B, a set B information file (participation information) that stores item information for setting the value of each item indicating the characteristics of the B element. Information file 9) and a set B desired information file (participant desired information file) in which desired information regarding the set A (facility) is stored for any item for each B element ID (participant ID) of the set B 6) is stored in a storage device (not shown). The display means (not shown) of the facility manager terminal 300 displays a desired search screen (described in FIG. 24) for accepting a search related to the set B (participant) for each A element ID (facility code) of the set A (facility). Then, the specification of the value for each item is accepted from the desired search screen, and the desired matching means 8 uses the item and value specified for the set A (facility) from the facility administrator on the desired search screen as the matching condition information, and the set B A matching process for extracting matching items from the information file (participant information file 9) and the set B desired information file (participant desired information file 6) in order of degree of match is performed, and display means (not shown) of the facility manager terminal 300 Displays the item information of the B element (participant) matched by the desired matching means 8.
The ROL creation unit 11 creates a list of B elements (participant ID) matched by the desired matching unit 8 as a priority list (facility ROL file 12) of the corresponding A element (facility code), and Do not store in the storage device.

As described above, in the present embodiment, the facility manager creates the facility request information file 7 in which items and values related to the desired participant as shown in FIG. 19 are registered. By simply entering search information indicating the desired condition on the desired search screen, the facility that matches the search condition can be extracted with a matching degree, and based on that, the participant ROL file is automatically extracted. 13 can be created, so that the participant can perform matching with a desired facility without inputting a troublesome ROL file. Similarly, the facility manager simply creates the participant request information file 6 in which items and values related to the desired facility as shown in FIG. 18 are registered, and the facility manager displays the desired search screen shown in FIG. Thus, by simply inputting search information indicating the desired condition, participants who match the search condition can be extracted with a matching degree, and further, a facility ROL file 12 is automatically created based on the participant. Therefore, the facility manager can perform matching with a desired participant without inputting a troublesome ROL file.
In addition, by specifying the desired information input to the participant desired information file 6 for the participant, there is an effect that the possibility of being searched from the facility side and being matched with one of the facilities is increased. In addition, for facility managers, by specifying the desired information to be input to the facility desired information file 7, there is an effect that the possibility of being searched from the participant side and being matched with any of the participants is increased. It is done.

Embodiment 2. FIG.
The present embodiment is different from the above-described first embodiment in that the designation of importance is also accepted when the search information is input on the desired search screen as shown in FIG. As shown in FIG. 27, the wish search screen is provided with input fields for inputting items, importance levels, and values. An item is input by clicking the triangle button provided on the right side of the input field to display a pull-down menu, and selecting and clicking the corresponding item. In the importance level input field, the importance level of the item selected by the user (participant or facility manager) (weight of the corresponding item at the time of search) is input. In the value entry field, items that match the selected item are displayed. The “Register” button is clicked when it is desired to register a plurality of values for one item. The “Search” button is clicked when searching based on the input content.

Next, an operation of “accepting a desired input and matching with the information of the other party” in the present embodiment will be described.
FIG. 10 is a flowchart showing details of the search process using the desired search screen of FIG. 27 described above. The process by which the participant searches for the facility will be described. First, when the participant terminal 200 recognizes that the facility request input process has been designated by the participant under the control of the processing means 22, the login process is performed. A login processing screen (not shown) is displayed. When a user ID (a password corresponding to the user ID can be combined) is input, the processing unit 22 passes the user ID to the matching server 100 via the communication unit 23 and the communication unit 1, and the processing unit ( By checking with the participant information file 9, it is determined whether or not to authenticate the user ID, and the authentication result is notified to the participant terminal 200. When the user ID is authenticated, the display means 21 displays a wish search screen shown in FIG. 27 (step S71). When the desired search screen is displayed, the search processing means 2 of the matching server 100 transmits the information of the value master file (for search) 14 to the participant terminal 200 in order to display a pull-down menu of items. Accordingly, when the user selects one item from the displayed pull-down menu (in the example of FIG. 27, “location” is selected), the search processing means 2 displays the value information corresponding to the selected item. Is sent to the participant terminal 200 and displayed as an item option in a pull-down menu (displayed after the triangle button is clicked) (step S72) (in the example of FIG. 27, “Tokyo” and “Chiba”). ”Etc. in the pull-down).
In addition, it accepts designation of importance for items from participants. In the present embodiment, the importance is specified in 10 stages of numerical values from 10 to 1, and the higher the numerical value, the higher the importance. The participant can arbitrarily designate the importance, and arbitrarily designate the importance as “10”, “8”, “5”... In the order of items considered important.

Next, the user waits for the “Register” button or the “Search” button to be clicked. When the “Register” button is clicked, the input search information is temporarily stored in the storage means 24 and the latest search condition is set. (Registered items, importance of the items, combinations of values (multiple designations are all registered)) are displayed in “-Registered search condition” in the lower left of the screen. On the other hand, if the “search” button is pressed, the input search information or the search information previously stored in the storage unit 24 is transferred to the communication unit 1 of the matching server 100 (step S73). Here, a plurality of values can be specified for one item as search information. A plurality of items can be specified. Next, the communication means 1 of the matching server 100 passes the matching condition information designated from the participant terminal 200 to the processing means (not shown), and the processing means (not shown) passes the matching conditions to the desired matching means 8. (Step S74). Here, if the processing means (not shown) refers to the value correspondence table 15 in the value and determines that the value having the “development value” is designated, the “parent value” Is expanded to “development value”, and then processed to be transferred to the desired matching means 8. Next, the desired matching means 8 selects the item number of the item. Thus, the matching condition information is matched with the facility information file 10 and the facility desired information file 7, and a search result display screen (details will be described later) as shown in FIG. 25 is displayed (step S75). That is, the items included in the search information are registered in the facility desired information file 7 or the facility information file 10, and the facility desired information file 7 and the facility information file 10 are searched and matched. At this time, a weighted search is performed in consideration of the importance included in the search condition. If the item and value match and the importance level is high, a positive match level is obtained. If the item matches but the value does not match, and the importance level is high, a negative match level is set. That is, the weighting specified in step S73 is used in the combination process.
As a result of the search thus obtained, the facility information is displayed on the search result display screen in the order that matches the desired condition (search information). Moreover, you may comprise so that a "development value" may be displayed with respect to a user for reference. Next, the desired matching means 8 stores matching result information as shown in FIG. 26A (step S76). In the matching result information, as shown in FIG. 26, only the facility code of the matched facility and its matching degree are stored for each user ID.

As described above, in the present embodiment, the user can designate the importance level for each item on the desired search screen (described in FIG. 27), thereby adjusting the weighting for each item. The designated importance is used for weighting in the matching process in the desired matching means.
Since other operations are the same as those in the first embodiment, description thereof is omitted here.

  As described above, in the present embodiment, the same effect as in the first embodiment can be obtained, and the importance can be designated when inputting the search condition. The search can be performed, and the participant ROL file 13 and the facility ROL file 12 can be created more appropriately.

  When displaying the matching results in a table or graph, the matching results may be displayed in ascending order / descending order in descending order of “importance” in order of importance of the search participant desired information.

Embodiment 3 FIG.
FIG. 11 is a diagram showing a configuration of the wish list creation assistance system according to the present embodiment. The difference from FIG. 20 is that free text search means 40 is added. Since other configurations and operations are the same as those in the first and second embodiments, description thereof is omitted here. In addition, the present embodiment is characterized in that the search function is enhanced when the user (participant or facility manager) searches for a partner who matches his / her wish as in the first or second embodiment. .

As shown in FIG. 12, the free text search means 40 is connected to the desired matching means 8, the participant information file 9, and the facility information file 10 in the matching server 100, and when free text search is designated. To work. In the free text search means 40, a condition / result delivery means 41, a text mining means 42, an evaluation means 44, a questionnaire data file 43, and a search result data file 45 are provided.
In the questionnaire data file 43, questionnaire results regarding facilities received from participants who have received training in the past are registered. The facility code “I001” is stored.

The condition / result delivery means 41 exchanges the desired matching means 8 with the search condition (“free text” input at the time of free text search) and the search result.
The text mining means 42 searches the questionnaire data stored in the questionnaire data file 43 for information that is conceptually similar to the facility information of the corresponding facility delivered from the condition / result delivery means 41.
The text mining means 42 operates by using an existing text mining method. The text mining method is a method of statistically examining the appearance tendency of words in a document, obtaining a document vector representing the characteristics of each sentence, and searching for conceptually similar content using the proximity of this vector as a measure of similarity. It is a technique to do. In addition, a concept vector is created as a pre-stage of creating a document vector. A concept vector is a word and a word calculated based on word co-occurrence information (the tendency of words or compound words that appear simultaneously in the vicinity). The similarity is stored in the concept dictionary. Further, in order to create a document vector, a sentence is decomposed into morphemes. The decomposition into morphemes means that the sentences are decomposed into meaningful words.
In the free text, enter "desired partner characteristics". For example, when a participant designates, “Easy to teach” or “Latest technology” can be considered, but sentences similar to the input free text (“Teaching is polite” or “Advanced technology”) Etc.) are similar in concept. And the facility information specified from the questionnaire is searched. In addition, the evaluation means 44 searches the questionnaire data for those having vectors close to the facility information (excluding those containing negative words), determines the similarity, and collates the search result with the facility information file, The evaluation result including information is output to the search result data file 45.
The questionnaire data file 43 stores text data (electronic data) as a result of questionnaires to participants or facility managers. For example, a questionnaire result regarding a facility practiced by a past participant (trainee) can be cited as an example.
The search result data file 45 records search results.

  FIG. 13 shows a case in which the user (participant or facility manager) searches for a partner who matches his / her wish, and confirms the search result in the present embodiment. FIG. 5 is a diagram illustrating a flow of processing for performing a similar search or a free text search. First, as shown in FIG. 13, the display means 21 of the participant terminal 200 displays a search result display screen as shown in FIG. 28A on the screen of the participant terminal 200 based on the control of the processing means 22. (Step S81). On this screen, as shown in FIG. 28A, the search result is displayed in the upper row, and the “similar search” button is displayed in the lower row. One button is provided for each facility in the displayed search results. Further, below this button, a “free text search” button and a keyword input field for inputting a keyword for performing the free text search are displayed. On the search result display screen displayed in this way, the input means 20 of the participant terminal 200 clicks either the “similar search” button or the “free text search” button based on the control of the processing means 22. When any of them is clicked, it is detected (step S82). When the “similar search” button is clicked, the process proceeds to the process of FIG. If a keyword is entered and the “free text search” button is clicked, the process proceeds to FIG.

  First, an outline of “similar search” and “free text search” will be described as follows.

(1) Similarity search-Information of "participant desired information file" or "facility desired information file" is formed from one piece of information (for example, one piece of facility information designated by a participant), and the information shown in FIG. Perform the matching process.
(2) Free text search-It is also possible for the user to search for similar information by referring to the search result and performing a complete free text search. Free text is text that can be freely input by the user, and is used when the user wants to search the other party from a new perspective by referring to the search results searched under certain conditions. What you can do is free text search. In addition, past “results of questionnaire regarding facilities practiced by participants” are used as search targets.

  FIG. 14 is a diagram showing a processing flow when the “similar search” button is clicked and “similar search” is designated from the search result. When the “similar search” button is clicked on the screen of FIG. 28A, an “item designation” button is displayed for each item as shown in FIG. At this time, as shown in FIG. 14, first, the display means 21 of the participant terminal 200 accepts designation of which item to specify an item based on the control of the processing means 22. In other words, it waits for any “item designation” button to be pressed. Multiple items can be specified. Next, the facility information of the designated facility and the designated item (s) are transmitted to the matching server 100 (step S102). Next, the matching server 100 receives the information by the communication means 1, and the hope registration means 5 uses the contents of the transmitted facility information as a value and temporarily uses the item and value for the corresponding user ID as the desired information. Store (step S103). Next, the desired matching means 8 matches the desired information stored in step S103 with the facility information file 10 and the facility desired information file 7, and configures the matching result as display information (step S104). Next, the communication unit 1 of the matching server 100 transmits display information to the communication unit 23 of the participant terminal 200 (step S105). Next, the display means 21 of the participant terminal 200 displays the received display information on the screen under the control of the processing means 22 (step S106).

  FIG. 15 is a diagram showing the flow of processing when the “free text search” button is clicked and “free text search” is designated from the search result. As shown in FIG. 15, first, the communication means 23 of the participant terminal 200 determines that “free text search” has been designated (clicked) by the user based on the control of the processing means 22, and the input free text has been input. The sentence is transferred to the matching server 100 (step S111). The matching server 100 delivers the designation of “free text search” and the free text to the condition / result delivery means 15 via the desired matching means 8 (step S112). Next, the condition / result delivery unit 41 delivers the free sentence to the text mining unit 42 (step S113). The text mining means 42 reads the questionnaire data stored in the questionnaire data file 43, decomposes the free text passed from the condition / result delivery means 41 and the read questionnaire data into morphemes, and creates a document vector. (Step S114). At this time, a concept dictionary may be created from the questionnaire data, and the received facility information may be compared with the concept dictionary to create a document vector. Next, the evaluation means 44 searches the questionnaire data for those having vectors close to free sentences (excluding those containing negative words), determines the similarity, and collates the search results with the facility information file, The evaluation result including the facility information is output to the search result data file 45 (step S115). Next, the communication unit 1 transmits the result of the search result data file to the participant terminal 200 via the condition / result transfer unit 41 and the desired matching unit 8 (step S116). Next, the participant terminal 200 receives the result by the communication unit 23 and displays the screen on the display unit 21 based on the control of the processing unit 22 (step S117).

  FIG. 15 shows that when “free text search” is selected, the comparison with the designated “free text” is limited to the questionnaire data file 43, and the corresponding facility information is obtained from the result of the comparison with the questionnaire data file 43. This is a processing method for searching from the facility information file 10. Note that it is possible to combine a search by a text mining method using the questionnaire data file 43 after the “similar search” shown in FIG. That is, the questionnaire data that matches the facility code and is searched for with a high degree of coincidence by “similarity search” is extracted from the questionnaire data file 43, and the similarity is calculated by comparing the document vectors. For example, when a search is performed by designating the facility code “A001” in “similar search”, the desired matching means 8 calculates that the matching degree is high in the order of the facility codes “A023, A024, A025. It is assumed that the facility code “A023, A024, A025” is determined to match by setting the threshold. Thereafter, only the questionnaire data for the facility code “A023, A024, A025” is extracted from the questionnaire data file 43 by the free text search means 40, the document vector of the corresponding questionnaire data, and the item of the facility code “A023, A024, A025” Compare with the valuation. When it is determined by the comparison that the facility codes “A024, A025, A023” are similar in order, the result is displayed. Thus, it is possible to use the questionnaire result about the facility which the past participant (trainee) practiced for the facility search.

  As described above, in the present embodiment, the same effect as in the first embodiment and the second embodiment described above can be obtained. Further, from the search result, the partner (that is, the facility, if a participant, Since one of the participants is specified if it is a facility, similarity search, information search, and free text search can be performed, so that the convenience of the search function can be further improved.

In each of the above embodiments, the matching system (matching server 100, participant terminal 200, facility manager terminal 300, matching manager terminal 400) can be realized by a computer. Although not shown, each device includes a CPU (Central Processing Unit) that executes a program.
For example, the CPU is connected to a ROM (Read Only Memory), a RAM (Random Access Memory), a communication board, a display device, a K / B (keyboard), a mouse, an FDD (Flexible Disk Drive), and a CDD (Compact Disc) via a bus. Drive), magnetic disk device, optical disk device, printer device, scanner device and the like.
The RAM is an example of a volatile memory. ROM, FDD, CDD, magnetic disk device, and optical disk device are examples of nonvolatile memory. These are examples of a storage device or a storage unit. Various files are stored in the storage device or the storage unit.
Data and information handled by each device of the above-described embodiment are stored in a storage device or a storage unit, and are recorded and read by each unit of the device.
The communication board is connected to a WAN (Wide Area Network) such as a LAN, the Internet, or ISDN. The magnetic disk device stores an operating system (OS), a window system, a program group, and a file group (database).
The program group is executed by a CPU, OS, and window system.
Each part of each of the above devices may be configured by a program that can be operated by a computer in part or in whole. Alternatively, it may be realized by firmware stored in the ROM. Alternatively, it may be implemented by software, hardware, or a combination of software, hardware, and firmware.
The program group stores a program that causes the CPU to execute the processing described as “to means” in the description of the embodiment. These programs are created by computer languages, such as C language, HTML, SGML, and XML, for example.
The program is stored in another recording medium such as a magnetic disk device, FD (Flexible Disk), optical disk, CD (compact disk), MD (mini disk), DVD (Digital Versatile Disk), and read by the CPU. And executed.

BRIEF DESCRIPTION OF THE DRAWINGS It is a block diagram which showed the structure of the whole wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is a block diagram which showed the internal structure of each component which comprises the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the whole process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is a block diagram which showed the internal structure of each component which comprises the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is a partial block diagram which showed the internal structure of each component which comprises the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is the flowchart which showed the flow of the process of the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is explanatory drawing which showed an example of the participant information file in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the facility information file in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the participant wish information file in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the facility wish information file in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the item master file in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the value master file (for registration) in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the value master file (for search) in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the value corresponding | compatible table in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the wish search screen in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of the search result display screen (example when a participant searches) in the wish list preparation assistance system which concerns on Embodiment 1 of this invention. It is explanatory drawing which showed an example of (a) matching result information in the wish list preparation assistance system which concerns on Embodiment 1 of this invention, and (b) participant ROL file. It is explanatory drawing which showed an example of the wish search screen in the wish list preparation assistance system which concerns on Embodiment 2 of this invention. It is explanatory drawing which showed an example of the search result display screen (example when a participant searches) in the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is explanatory drawing which showed an example of the wish search screen in the wish list preparation assistance system which concerns on Embodiment 3 of this invention. It is explanatory drawing which showed an example of the matching in the conventional matching method. It is explanatory drawing which showed an example of the priority list | wrist in the conventional matching method. It is the flowchart which showed the flow of the process of the conventional matching method. It is explanatory drawing which showed the conventional matching method.

Explanation of symbols

  1 communication means, 2 search processing means, 3 item master file, 4 value master file, 5 desired registration means, 6 participant desired information file, 7 facility desired information file, 8 desired matching means, 9 participant information file, 10 facility Information file, 11 ROL creation means, 12 facility ROL file, 13 participant ROL file, 14 value master file (for search), 15 value correspondence table, 20 input means, 21 display means, 22 processing means, 23 communication means, 24 Storage means, 30 input means, 31 display means, 32 processing means, 33 communication means, 40 free sentence search means, 41 condition / result delivery means, 42 text mining means, 43 questionnaire data file, 44 evaluation means, 45 search result data File, 100 matchons Server, 200 participant terminal, 300 facility managers terminal, 400 matching administrator terminal, 500 communication network.

Claims (4)

In order to perform matching processing for matching each element of the set A composed of a plurality of elements and the set B composed of a plurality of elements, all of the elements of the set B are performed for each A element ID of each element of the set A. Alternatively, a priority list uniquely ranked for a part and a priority ranking uniquely assigned to all or part of the elements of the set A for each B element ID of each element of the set B A wish list creation auxiliary system for creating a degree list,
For each B element ID of the set B, a set B information file in which item information for setting the value of each item indicating the characteristics of the B element is stored;
For each B element ID of the set B, a set B desired information file in which desired information regarding the set A is stored for an arbitrary item;
For each A element ID of the set A, a set A information file in which item information for setting the contents of each item indicating the characteristics of the A element is stored;
For each A element ID of the set A, a set A desired information file in which desired information regarding the set B is stored for any item;
For each A element ID of the set A, the specification of the value for each item is received from the desired search screen for receiving the search related to the set B, and the specified item and the value are used as matching condition information for the set B information file and the set B request. extracts a matching element B from the information file to match the order of degree, each B element ID of the set B, for each item from the desired search screen for accepting a search for a set a, accepted designation of Baryuu, designated Desired matching means for performing matching processing for extracting matching A elements in order of degree of matching from the set A information file and the set A desired information file using the item and value as matching condition information;
The are matched as desired matching means, and displays the item information of the B component of each A element ID, wish list creation aid system and a display means for displaying the item information of the A element in each B element ID.   A list of B elements matched by the desired matching means is stored as a priority list of the corresponding A element, and a list of A elements matched by the desired matching means is stored as a priority list of the corresponding B element. 2. The system for assisting creation of a wish list according to claim 1, further comprising ROL creating means. The above valuation includes a valuation composed of one valuation and a parent valuation composed of one or more valuations referred to as an unfolding valuation.
3. The wish list creation assisting system according to claim 1, wherein when the parent value is designated, the desired matching means expands the developed value into a developed value and performs a matching process.   4. The wish list creation auxiliary system according to claim 1, wherein an importance can be designated for each item, and the importance is used for weighting in the matching processing in the desired matching means. .

Images