KR20130091471A

KR20130091471A - Batch matching method and system for online date service

Info

Publication number: KR20130091471A
Application number: KR1020120012770A
Authority: KR
Inventors: 이종문
Original assignee: 주식회사 아이디어포트
Priority date: 2012-02-08
Filing date: 2012-02-08
Publication date: 2013-08-19

Abstract

In a batch matching system and method for an online dating service, the client is connected to a network and uses a database, and the batch matching system and method among members for performing matching for the online dating service collectively, comprising: (a) the client Receiving identification information of a member from a database; (b) receiving a list of counterparties to be recommended to each target member from the client and storing the list of target members as a recommendation list of the target member in a database; (c) For each of the target members, one relative member is selected from the recommendation list of the target member according to a relative selection priority rule to match a matching pair of the target member and the selected counterpart member. pool); (d) applying a matching pair selection priority rule to sequentially extract a matching pair having the highest priority among a plurality of matching pairs belonging to the one-to-one matching pool, and extracting members included in the matching pair without duplication; Prepare a configuration comprising a.
According to the system and method as described above, it is possible to minimize the occurrence of duplicate matching or dropouts that do not match when matching multiple members to one member when matching between members.

Description

Batch matching method and system for online date service

According to the present invention, in order to provide matching between members in the online dating service, matching is performed in the order of high relevance based on the information data input by the user, while preventing duplicates between matching pairs from occurring, A system and method are described that allow a quick match to be made without overloading.

In addition, the present invention determines the preference of the priority of the matching partner based on the data entered by the member in the dating service matching, considering the preference associations of users who failed to match because the association is lower than the user already matched with a high association The present invention relates to a batch matching system and a method of matching members.

In the existing society, the usual methods of heterosexual dating included blind dates, meetings, or marriage premise arranged by actual acquaintance organizers. In recent years, it has been gradually extended to meetings through marriage information companies, which have been commercialized, and recently, based on information on male and female users who have a willingness to participate, online judgments are made between the preferences of the organizers and the users of the meeting. Dating is gaining popularity. In addition, due to the explosive increase in smartphones, dating services through mobile applications have been in the spotlight. Like the existing online dating service, mobile dating provides users with service data scientifically by providing data re-calculated so that the information data input by the user who uses the service can be used for matching through various calculation processes for matching. It matches.

For example, in a dating service, members agree and enter information such as physical information, socioeconomic information, local information, education, age, and race information. In addition, there are ideals for eating habits, hobbies, daily life, and reason. Such information can be systematically managed and accumulated and data can be systematically categorized and matched with the desired counterpart.

In addition, mobile dating uses GPS embedded in smartphones, and services combining LBS (Location based service), camera, portability, and push technology are emerging with the popularity of smartphones.

While online dating services have made it easier to screen for potentially attractive reasoning as stated above, current mobile dating services use the same method of displaying online services on mobile applications as existing online services. A large amount of data on candidates' information should be reviewed online in a mobile-constrained hardware. However, the purpose of the user entering information on the mobile application and using the mobile application is to display the user information-based profile display of the existing service even though the purpose is to select only users who have similar or high preference among a large number of users and efficiently edit the information. The service of the type does not reflect this, so the service usage efficiency of the user is reduced.

In addition, such a display-search service causes a phenomenon in which a matching is concentrated on a specific female or male who is different from the other's preference. When a match is concentrated on a specific male or female, the user's discomfort is increased due to time and physical limitations, and the inefficient use of resources such as information input by the user is not only effective, but also the portability and speed of the smartphone. This offsets the need for a new service matching method.

The present invention is to solve the problems as described above, in order to efficiently provide an online dating service, a user departed from the existing display-search method based on the information entered by the member every day based on the priority calculated by the user In order to solve the inefficiency of the display-search method.

In addition, an object of the present invention is to arrange a plurality of users calculated as priorities every day, regardless of time and place by data-inputting information inputted by a member in a dating service.

In addition, the present invention is to set the priority of the matching for meeting for members as a rule, to set the rules to prioritize not only the matching members but also users who have dropped out in the matching process, improve the matching rate and batch matching system and method It aims to provide.

In order to achieve the above object, the present invention provides a batch matching method for dating services that performs matching for a dating service using a batch matching system connected to a network and using a database, the client comprising: (a) the client Receiving the identification information of the member from the database and storing the information; (b) receiving a list of a counterpart member (hereinafter referred to as a target member) to be recommended to each member (hereinafter referred to as a target member) from the client and storing the list in a database as a recommendation list of the target member; (c) the batch matching system selects one counterpart member from the recommendation list of the target member for each of the target members according to a relative selection priority rule to match the target member with the selected counterpart member; Adding the pair to a matching pool; (d) The batch matching system applies a matching pair selection priority rule to sequentially extract a matching pair having the highest priority among a plurality of matching pairs belonging to the one-to-one matching pool, but including members included in the matching pair. Extracting them without duplication.

In addition, the present invention is a batch matching method for an online dating service, wherein step (d) reconstructs the matching pool by reconfiguring the matching pool with missing matching pairs without being extracted from the one-to-one matching pool, The number of times the extraction is repeated is limited to a predetermined number.

The present invention also provides a batch matching method for an online dating service, wherein step (d) includes: (d1) selecting a matching pair having the highest priority among matching pairs in the matching pool; (d2) extracting the selected matching pair, dropping a matching pair including members constituting the matching pair from the one-to-one matching pool, and excluding the extracted matching pair and the dropped matching pair from the one-to-one matching pool step; (d3) repeating steps (d1) and (d2) if a matching pair remains in the one-to-one matching pool; (d4) repeating steps (d1) to (d3) by reconfiguring the matching pool with matching pairs that have not been extracted and repeating the steps (d1) to (d3), and limiting the number of repetitions to a predetermined number of times. .

In addition, the present invention provides a batch matching method for a dating service, wherein the relative selection priority rule or the matching pair selection priority rule is to give higher priority to the member whose last date extracted as the matching pair is older. It features.

In addition, the present invention provides a batch matching method for a dating service, wherein the opponent selection priority rule or the matching pair selection priority rule includes a plurality of step-by-step rules, and matches a member or a match that meets an upper level rule. If a pair has a higher priority than a matching member or matching pair that does not satisfy the higher level rule, and there are a large number of matching members or matching pairs that satisfy the higher level rule, the matching member or matching that meets the next lower level rule. The pair may be regarded as having a higher priority than a matching member or matching pair that does not satisfy the rules of the lower level.

In addition, the present invention provides a batch matching method for an online dating service, wherein the matching pair selection priority rule is a case in which two members belonging to a matching pair satisfy all the step rules when applying each step rule. Characterized as having a higher priority than if only the members are satisfied.

In addition, the present invention is a batch matching method for an online dating service, wherein the relative priority selection rule or the matching pair selection priority rule is a priority, matching pairs according to the member, member's home environment and characteristics requested by the customer Extraction cycle, number of meetings, age, date of enrollment, current textbook, physical attractiveness difference, family environmental index difference, income index difference, education index difference, occupational index difference, distance of living area, impression grade difference, member It includes a step-by-step rule that is determined in order of difference in joining, membership, matching, age, height, religion, and personality matching.

In addition, the addition of an item for the upper priority rule is characterized in that it can be easily applied after updating simply by adding a simple field on the system.

The present invention also relates to a computer-readable recording medium recording a batch matching method for the online dating service.

The present invention also relates to a batch matching system connected to a network with a client, having a database, and performing a matching for a date service in a batch, comprising: a member manager which receives member information from the client and stores the member's information in a database; A recommendation list manager which receives a list of counterparties to be recommended to each target member from the client and stores the list in a database as a recommendation list of the target member; For each of the target members, three opponent members are selected from the recommendation list of the target member according to a relative selection priority rule, and a matching pair of the target member and the selected counterpart member is matched one-to-one. Matching pool forming portion to add to; The matching pair extracting unit extracts a matching pair having the highest priority sequentially among a plurality of matching pairs belonging to the one-to-one matching pool by applying a matching pair selection priority rule without overlapping members included in the matching pair. It is characterized by including.

The present invention also provides a batch matching system for an online dating service, wherein the matching pair extracting unit reconstructs the matching pool by reconfiguring the matching pool with missing matching pairs without being extracted from the matching pool, and extracts the matching pairs again and extracts the extracted pairs. The number of repetitions is limited to a predetermined number of times.

In addition, the present invention provides a batch matching system for an online dating service, wherein the relative selection priority rule or the matching pair selection priority rule gives higher priority to members whose last date extracted as a matching pair is older. It is characterized by.

In addition, the present invention provides a batch matching system for an online dating service, wherein the relative selection priority rule or the matching pair selection priority rule includes a plurality of stepwise rules and a relative member that satisfies an upper level rule or If the matching pair has a higher priority than the matching member or matching pair that does not satisfy the higher level rule, and there are a large number of matching members or matching pairs that satisfy the higher level rule, The matching pair has a higher priority than a matching member or matching pair that does not satisfy the lower level rule.

As described above, according to the batch matching system and method for the online dating service according to the present invention, the matching pairs are matched to one member by extracting the matching pairs with priority so as not to overlap and rematching the missing persons. The effect of minimizing the occurrence of duplicate matching or unmatched dropouts is obtained.

In addition, according to the batch matching system and method for the online dating service according to the present invention, by matching a large number of members at the same time to effectively match the relative member profile with high preference to as many members as possible to improve the overall service quality of the online dating service An effect that can be improved is obtained.

In addition, by the batch matching system and method for the online dating service according to the present invention, the effect of enabling marketing and advertisements for individual members and potential members can be executed using data statistics accumulated and segmented from members. .

In addition, according to the batch matching system and method for an online dating service according to the present invention, by raising the priority of members who are not matched with members who have already been matched, it is essentially blocking the occurrence of members who are continuously dropped. Effect is obtained.

1 is a diagram illustrating the configuration of an entire system for implementing the present invention.
2 is a flowchart illustrating a one-to-one batch matching method between members for meeting arrangement according to an embodiment of the present invention.
3 illustrates a method of selecting a counterpart member from a recommendation list of a target member according to an embodiment of the present invention.
4 is a table illustrating a relative selection priority rule according to an embodiment of the present invention.
5 illustrates a matching pool formed in accordance with one embodiment of the present invention.
6 is a table illustrating a matching pair selection priority rule according to an embodiment of the present invention.
7 is a flowchart illustrating a method of extracting a matching pair according to an embodiment of the present invention.
FIG. 8 is a diagram illustrating a step of extracting a matching pair from the one-to-one matching pool of FIG. 5.
FIG. 9 is a diagram illustrating a second step of repeatedly extracting matching pairs dropped in the matching pair extraction step of FIG. 8.

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, the present invention will be described in detail with reference to the drawings.

In the description of the present invention, the same parts are denoted by the same reference numerals, and repetitive description thereof will be omitted.

First, the entire system for implementing the present invention will be described with reference to FIG. 1 is a diagram illustrating the configuration of an entire system for implementing the present invention.

As shown in FIG. 1, the client 10 accesses and connects to the batch matching system 30 through the network 20. The batch matching system 30 also includes a database 40 for storing data.

The client 10 is a conventional computing terminal used by a member or manager. Examples of the client 10 include a PC, a mobile device, and the like, and a detailed description thereof will be omitted since its configuration and operation principle are well-known techniques commonly used in the art.

Members are people who want to meet with the opposite sex and join as members. Members register as members through the client 10 or input their own personal information. In addition, the members may obtain information on matching or accept the date service proposal through the client 10.

The batch matching system 30 refers to a general server that presents an appropriate matching pair between members in order to arrange meetings between members. In general, the server performs arithmetic functions, network functions, data processing functions, and provides services such as member management, content provision, data reception, authentication, and billing. However, the server according to the present invention further performs a matching function for arranging meeting between members. In addition, the server may provide the services in a web form through the Internet, mobile, etc.

The client 10 and the batch matching system 30 are connected through a network 20 such as the Internet. The network 20 may be any network that can receive services by connecting to a server such as a wired internet or a wireless internet.

The database 30 stores member information received from the client 10 to the batch matching system 30 and data processed for matching in the batch matching system 30. That is, the database 30 is used when selecting information on a member, a recommendation list of relative members that can be recommended to a target member, information on a matching pair generated according to a matching result, selecting a relative member or extracting a matching pair. Stores information about priority rules. The database 30 may be included in the batch matching system 30, and a plurality of databases 30 may be used separately from the batch matching system 30. In addition, the database 30 may be constructed by dividing the stored information into a separate database. That is, the database 30 can be variously designed according to the implementation of the actual system.

A one-to-one batch matching method between members for meeting arrangement according to an embodiment of the present invention will be described with reference to FIGS. 2 to 8.

2 is a flowchart illustrating a one-to-one batch matching method between members for meeting arrangement according to an embodiment of the present invention.

The batch matching method between members according to an embodiment of the present invention is a method of performing batch matching for an online dating service by connecting to a client 10 and a network 20 and using a database 40.

As shown in Figure 2, the batch matching method includes the steps of (a) receiving a member's information from the client (10) and storing it in a database (40); (b) receiving a list of counterparties to be recommended to each target member from the client 10 and storing them in the database 40 as a recommendation list of the target member (S20); (c) For each of the target members, one relative member is selected from the recommendation list of the target member according to a relative selection priority rule to match a matching pair of the target member and the selected counterpart member. adding to the pool (S30); (d) applying a matching pair selection priority rule to sequentially extract a matching pair having the highest priority among a plurality of matching pairs belonging to the one-to-one matching pool, and extracting members included in the matching pair without duplication; It has a configuration that includes (S40).

In step (a), the personal information of the member is received from the client 10 and stored in the database 40 (S10).

Members access the web server providing one-to-one batch matching service through the client 10 and register as a member. At the same time as the membership, members enter their personal information.

When the personal information of the member is input, systematic data necessary for matching with the opposite sex is generated based on this. That is, various indexes or scores related to matching are calculated from the information input from the member and stored together with the personal information in the database 40. For example, based on the occupation, education, and income information of the member's personal information, the preference value with the other member is calculated in consideration of the region, occupation, degree, economic strength, body type, etc. representing the member's personal information, and the database 40 is displayed in the database 40. Is entered.

Before explaining, explain the concept of the target member and the partner member. The target member refers to a member who is the target of interest, and the counterpart member refers to a member who is the target member of the target member as a matching member. The target member and the relative member are concepts relative to each other. That is, member A may be a target member, member B may be a counterpart member of member A, or vice versa, member B may be a target member and member A may be a counterpart member. However, the target member is meant as an active subject, and the other member is passively chosen. For example, if member A is the target member and member B is the other member, member A has selected member B, member B is the target member, and member A has the other member. can see.

The target member's recommendation list refers to a list of counterparties that can be recommended in view of the target member's preference input. The recommendation list is made using personal information of members and various matching indices derived from the personal information.

3 illustrates a recommendation list for the target member. As shown in FIG. 3, the relative member recommendation list for the target member M1 includes the relative members of F11, F12, ..., F15.

At this time, the selection of the optimal opponent member is determined by the opponent selection priority rule as shown in FIG. 4. The Relative Selection Priority Rule is an ordered list of rules that should be considered as the most important of all the conditions considered when matching the target member with the target member. That is, the priority rule is used as a criterion for selecting one who is more suitable among the other members of the same condition, and the order and items of the rules may vary according to circumstances.

In addition, the priority rule is managed in a form that can be continuously updated. The priority rule of FIG. 3 may be added or updated to reflect new know-hows or changes in preferences among opposite sexes according to changes in times and cultural differences.

Meanwhile, the opponent selection priority rule includes a plurality of stepwise rules, and when there are a plurality of opponent members extracted by applying a higher level rule, the priority rule of the next lower step until the last one opponent member is selected Are applied sequentially. That is, when the opponent selection priority rule has a higher priority than the counterpart member who does not satisfy the higher level rule and the counterpart member who satisfies the higher level rule has a large number of counterpart members who satisfy the upper level rule, For example, the other member that satisfies the next lower level rule is considered to have a higher priority than the other member who does not satisfy the lower level rule.

On the other hand, the relative selection priority rule gives a higher priority to a member whose last date extracted as a matching pair is old. The period from the last date when a member is extracted as a matching pair to the present time (a point in which a new matching pair is extracted) is called a matching cycle. Therefore, the priority of members' matching cycle is high. This is

In the case of a member with a long cycle, the same means that the priority is old.

As described above, for each target member, when one counterpart member is selected from the recommendation list of the target member, a matching pair is added to the selected counterpart member and added to the matching pool. In the example of FIG. 3, the optimum relative member of the target member M1 is selected as F13, and matching pairs M1 and F13 are added to the matching pool.

Next, step (d) will be described in more detail with reference to FIGS. 5 to 9. 5 illustrates a matching pool formed according to an embodiment of the present invention, and FIG. 6 is a table illustrating a matching pair selection priority rule according to an embodiment of the present invention.

In step (d), a matching pair selection priority rule is applied to sequentially extract a matching pair having the highest priority among a plurality of matching pairs belonging to the one-to-one matching pool, without overlapping members included in the matching pair. Extract (S40).

In step (c), when each target member is added to a matching pool in a one-to-one matching pool, a matching pair is formed for all members. However, here all members are members that can meet and match. Members who cannot meet, such as members who are waiting to meet, are excluded.

On the other hand, as shown in Figure 5, if there are five male members and five female members, all 10 matched pairs to form a one-to-one matching pool. In FIG. 5, male members are represented as M1, M2, ..., M5, and female members are represented as F1, F2, ..., F5.

For male members, each pair is matched with one of the best female members on the recommendation list. Solid arrows in the diagram of FIG. 5 are matching pairs created from the perspective of male members. That is, in the matching pair of solid arrows, the target member is a male member and the counterpart member is a female member. Conversely, in terms of female members, each person enters a matching pool with a matching pair of the best male member from the recommendation list. The dashed arrows in the diagram of FIG. 5 are the matching pairs made for female members. That is, in the matching pair of dotted arrows, the target member is a female member and the counterpart member is a male member. Therefore, matching pairs are made by adding the number of male members and the number of female members.

The matching pairs are then prioritized. The priority is again determined by the matching pair selection priority rule as shown in FIG. 6. The matching pair selection priority rule of FIG. 6 is similar in content to the relative selection priority rule of FIG. 4. However, there is a difference between whether the object to be applied is a relative member or a matching pair of the target member. That is, there is a difference between individual units or pair units.

The matching pair selection priority rule, like the relative selection priority rule, includes a plurality of stepwise rules, and a lower level rule is applied when there are a plurality of matching pairs selected by applying a higher level rule. In addition, the matching pair selection priority rule gives higher priority to the member whose last date extracted as the matching pair is old.

Meanwhile, when the matching pair selection priority rule is applied to each step rule, the case where the members belonging to the matching pair satisfy all of the step rule is higher than the case where only one member satisfies. That is, in the matching pair selection priority rule, since the application target is a matching pair, two members belong to the matching pair. Thus, if a priority rule is applied, one may be satisfied but the other may or may not be satisfied. Therefore, a matching pair that satisfies both members has a higher priority than a matching pair where only one member satisfies the rule.

By applying the matching pair selection priority rule as described above, as shown in FIG. 5, 10 matching pairs may be prioritized. Circular numbers such as ①, ②, and ③ described above each arrow in FIG. 5 indicate the priority of the matching pair of each arrow. For example, matching pairs M1 and F3 have the highest priority, followed by matching pairs F1 and M1. The next order is (F2, M3), (M2, F1), (M4, F2), and so on. Here, matching pairs (A, B) are denoted by (target member, counterpart member). For example, (F2, M3) is a matching pair made by selecting M3 as the best opponent from the position of F2, and (M3, F2) is a matching pair made by selecting F2 as the best opponent from the position of M3.

Step (d) will be described in more detail with reference to FIGS. 7 to 9. 7 is a flowchart illustrating a method of extracting a matching pair according to an embodiment of the present invention, FIG. 8 is a diagram illustrating a step of extracting a matching pair from the matching pool of FIG. 5, and FIG. 9 is a matching of FIG. 8. 2 is a diagram illustrating a step of repeatedly extracting matching pairs that are not extracted in the pair extraction step for the second time.

As shown in FIG. 7, the step (d) includes: (d1) selecting a matching pair having the highest priority among the matching pairs in the matching pool (S41); (d2) extracting the selected matching pair, dropping a matching pair including members constituting the matching pair from the matching pool, and excluding the extracted matching pair and the dropped matching pair from the matching pool ( S42); (d3) repeating steps (d1) and (d2) if a matching pair remains in the matching pool (S43); (d4) Reconstructing the matching pool with matching pairs that have not been extracted and repeating steps (d1) to (d3) a predetermined number of times (S44).

First, a step of extracting a matching pair from the one-to-one matching pool of FIG. 5 will be described with reference to FIG. 8.

First, a matching pair having the highest priority among matching pairs in the matching pool is selected (S41). In the example of Fig. 8A, the matching pair to be selected is an arrow indicated by?. In other words, a matching pair of (M1, F3) is selected.

The selected matching pair is extracted, and the matching pair including members constituting the matching pair is dropped from the matching pool (S42). In this case, the extracted matching pairs and dropped matching pairs are excluded from the matching pool.

In the example of FIG. 8A, the matching pairs extracted are (M1, F3). And the matching pairs including members M1, F3 are (F1, M1), (M2, F3), (F3, M4), (M5, F3), and these matching pairs are dropped matching pairs. If the extracted matching pairs and dropped matching pairs are excluded from the matching pool, the remaining matching pairs are shown in FIG. 8B. The above process is a process in which steps (d1) and (d2) described above are performed.

Since matching pairs remain in the matching pool, the above steps are repeated (S43). That is, the matching pairs F2 and M3 having the highest priority are selected and extracted from the remaining matching pools, and (M3, F1) and (M4, F2) including members of the matching pair are dropped. The extracted matching pairs and dropped matching pairs are excluded from the matching pool. As a result, the matching pairs remaining in the matching pool are shown in FIG. 8C.

Also, since the matching pairs still remain in the matching pool, the previous steps are repeated. That is, matching pairs F4 and M5 are selected and extracted, and matching pairs F5 and M5 including the matching pair and members of the matching pair are dropped. Excluding them from the matching pool, no matching pairs remain in the matching pool. Therefore, we do not repeat any more and finish the first process. The repeated step is to perform the step (d3) described above.

Next, a process of extracting a matching pair by configuring a matching pool again with matching pairs that are not extracted and will be described will be described with reference to FIG. 9.

The matching pair extracted in the first step is (M1, F3), (F2, M3), (F4, M5). Except the extracted matching pairs, the matching pool is configured again with the dropped matching pairs as shown in FIG. 9A (S44). Repeating the matching pair extraction process described above with respect to the reconfigured matching pool corresponds to step (d4). As shown in FIG. 9A, it can be seen that the member M1 included in the matching pair extracted in FIG. 8 is included in the matching pool again.

First, a matching pair having the highest priority among matching pairs in the matching pool is selected (S41). In the example of Fig. 9A, the matching pair to be selected is an arrow marked with ②. In other words, a matching pair of (F1, M1) is selected.

The selected matching pair is extracted, and the matching pair including members constituting the matching pair is dropped from the matching pool (S42). The matching pair that is dropped is (M3, F1). If the extracted matching pairs and dropped matching pairs are excluded from the matching pool, the matching pool remains as shown in FIG. 9B.

Since matching pairs remain in the matching pool, the above steps are repeated (S3). That is, the matching pairs M2 and F3 having the highest priority are selected and extracted from the remaining matching pools, and the matching pairs F3 and M4 and M5 and F3 including members of the extracted matching pair are dropped. Let's do it. The extracted matching pairs and matching pairs dropped out are excluded from the matching pool. The result is shown in FIG. 9C.

9C and 9D, the above steps are repeated to extract matching pairs F1, M1, M2, F3, M4, F2, and F5, M5. In addition, matching pairs F3 and M4 and M5 and F3 are dropped. Proceeding to FIG. 9D, since there are no more matching pairs left, the process ends and the second iteration ends.

As described above, if the entire process is repeated, matching pairs (M1, F3), (F2, M3), (F4, M5), (F1, M1), (M2, F3), (M4, F2), (F5, M5) are extracted. Therefore, every member is matched at least once and not more than once. That is, overlap is minimized and dropouts are minimized. Here, the dropout means a member that is not included in the extracted matching pair at all (ie, distinguished from a matching pair dropped during the extraction process).

The reason for not matching more than once per member is that the process (or step) of extracting a matching pair is performed twice without duplication.

On the other hand, the information such as the input information and the extracted matching pairs stored in the matching pool according to the present invention is stored in a computer-readable recording medium (CD-ROM, RAM, ROM, floppy disk, hard disk, magneto-optical disk, etc.) Can be stored.

As described above, preferred embodiments of the present invention are disclosed for purposes of illustration, and those skilled in the art will be able to make various modifications, changes, and additions within the spirit and scope of the present invention. Modifications and additions should be considered to be within the scope of the claims.

10: client 20: network
30: batch matching system 31: member management
32: recommendation list management unit 33: matching pool forming unit
34: matching pair extraction unit
40: Database 41: Member Information DB
42: recommendation list DB 43: matching pair DB
44: priority rule DB 51: target members
52: list of recommendations 53: opponent
61, 62: 63: matching pairs

Claims

In a batch matching method among members who perform a matching for an online dating service in a batch using a batch matching system using a database connected to a network with a client,
(a) receiving the personal information of the member from the client and storing it in a database;
(b) receiving a list of a counterpart member (hereinafter referred to as a counterpart member) to be recommended to each member (hereinafter referred to as a target member) from the client and storing the list in a database as a recommendation list of the target member;
(c) the batch matching system selects one partner member from the recommendation list of the target member for each of the target members according to a relative selection priority rule to match the target member with the selected counterpart member; Adding the pair to a matching pool;
(d) The batch matching system applies a matching pair selection priority rule to sequentially extract a matching pair having the highest priority among a plurality of matching pairs belonging to the matching pool, and then selects members included in the matching pair. Extraction without duplicate, wherein step (d)
Batch matching method for online dating services, characterized in that the matching pool is re-extracted from matching pools not extracted from the matching pool to re-extract the matching pairs, and the number of times of repeating extraction is limited to a predetermined number. .

The method of claim 1, wherein step (d)
(d1) selecting, by the batch matching system, a matching pair having the highest priority among the matching pairs in the one-to-one matching pool;
(d2) the batch matching system extracts the selected matching pair, removes the matching pair including members constituting the matching pair from the matching pool, and matches the extracted matching pair with the dropped matching pair. Excluding from the pool;
(d3) repeating steps (d1) and (d2) if the matching pair remains in the matching pool;
(d4) the batch matching system reconfigures the matching pool with matching pairs that have not been extracted, repeating steps (d1) to (d3), and limiting the number of repetitions to a predetermined number of times. Batch matching method for an online dating service comprising a.

According to claim 1, The relative selection priority rule or the matching pair selection priority rule, Collected for the online dating service, characterized in that the higher the member of the last date extracted as a matching pair is higher priority Matching method.

The method of claim 3, wherein the opponent selection priority rule or the matching pair selection priority rule is:
Contains a number of step-by-step rules,
The other member or matching pair that satisfies the higher level rule has a higher priority than the other member or matching pair that does not satisfy the higher level rule,
If there are a large number of matching members or matching pairs that satisfy the higher level rule, the matching member or matching pair that satisfies the next lower level rule has a higher priority than the matching member or matching pair that does not satisfy the lower level rule. Batch matching method for an online dating service, characterized in that considered.

The method of claim 4, wherein the matching pair selection priority rule is:
When applying each step rule, a batch for an online dating service, wherein two members of a matching pair are considered to have a higher priority than if only one member satisfies all of the step rules. Matching method.

A computer-readable recording medium recording a batch matching method for a mobile dating service according to any one of claims 1, 2 and 4.

In the batch matching system for a mobile dating service that is connected to the network by the client, has a database, and performs one-to-one matching for meetings between members,
Member management unit for receiving the personal information of the member from the client to store in the database;
A recommendation list management unit which receives a list of the other member (hereinafter referred to as a member) to be recommended to each member (hereinafter referred to as a target member) from the client and stores the list in a database as a recommendation list of the target member;
For each of the target members, one relative member is selected from the recommendation list of the target member according to a relative selection priority rule, and a matching pair of the target member and the selected counterpart member is added to a matching pool. Matching pool forming unit;
Applying a matching pair selection priority rule, a matching pair extraction unit for sequentially extracting the matching pair having the highest priority among a plurality of matching pairs belonging to the matching pool, without extracting the members included in the matching pair without duplication and,
The matching pair extraction unit,
The online dating service, characterized in that the matching pool is re-extracted by matching pairs that are not extracted from the one-to-one matching pool, and the number of times of repeating extraction is limited to a predetermined number. Batch matching system.

10. The method of claim 7, wherein the relative selection priority rule or the matching pair selection priority rule is a batch for the online dating service, characterized in that a higher priority is given to members whose last dates extracted as matching pairs are old. Matching system.

The method of claim 8, wherein the relative selection priority rule or the matching pair selection priority rule includes a plurality of stepwise rules,
The other member or matching pair that satisfies the higher level rule has a higher priority than the other member or matching pair that does not satisfy the higher level rule,
If there are a large number of matching members or matching pairs that satisfy the higher level rule, the matching member or matching pair that satisfies the next lower level rule has a higher priority than the matching member or matching pair that does not satisfy the lower level rule. A batch matching system for an online dating service.