Social search method and system based on position and bidirectional matching, and business mode

Abstract

The invention discloses a position-based bidirectional matching social search method and system and a business model, and belongs to the field of internet social contact. In the social contact system, when a first member initiating searching searches other members, a geographic range is determined firstly, then the system compares a matching condition of the first member with own data of a target member in the geographic range firstly, and the target member successfully compared becomes a primary member; reading a friend-making matching condition preset by the primary member, performing reverse comparison with own data of the first member, if the reverse comparison is successful, enabling the primary member subjected to bidirectional matching to become a candidate member, and enabling the first member to check a candidate member list; and then, screening and informing the satisfactory candidate members to meet the consumption of the deal merchant, carrying out settlement by the operator and the deal merchant according to the cooperation protocol, and extracting the operation cost. The system can be used for Internet friend making, recruitment, marriage seeking and volunteer seeking.

Description

technical field [0001] The invention relates to the field of Internet information technology, in particular to a location-based, two-way matching stranger social system, a social recruitment system, and a business model thereof. Background technique [0002] At present, there are generally three types of problems in online social networking systems on the Internet: [0003] 1. Most of the recruitment information searched by the recruitment website is not suitable for you, which wastes your time and requires job seekers to actively search for jobs. If you don’t search for a day, you may miss the opportunity of a satisfactory job; [0004] 2. It is difficult to find strangers who want to be helpful to me, especially if there is no channel to meet strangers who have common interests and language with me; [0005] 3. The efficiency and trust of online dating and dating are low, and the service fees of artificial matchmakers are too high. It is difficult for low-income young peo...

AI Technical Summary

Problems solved by technology

[0003] 1. Most of the recruitment information searched by the recruitment website is not suitable for you, which wastes your time and requires job seekers to actively search for jobs. If you don’t search for a day, you may miss the opportunity of a satisfactory job;

[0004] 2. It is difficult to find strangers who want to be helpful to me, especially if there is no channel to meet strangers who have common interests and language with me;

[0005] 3. The efficiency and trust of online marriage and dating are low, and the service fee of artificial matchmakers is too high. It is difficult for low-income young people to find a match that suits them

[0006] Regarding the first point, modern people look for jobs through recruitment websites. However, most of the job information found on recruitment websites is not suitable for them. Not to mention that there are various majors, even the same The industry and the same major also have different requirements, and there are very few suitable ones: Even so, each one must go in to see if it is suitable, otherwise you may miss the opportunity; If you have jobs in several cities, you need to go to different recruitment websites to search for jobs in different cities; in addition, if you want to change jobs, or plan to find a certain type of job, but don’t have time to check recruitment every day website, so often miss out on good jobs

[0007] There is no solution to this problem in the market at present. The most popular recruitment websites require job seekers to take the initiative to "find", that is, you go to their website to register, fill in your resume, and then select the city where the job is located on the website one by one. Search for the positions you need, and you have to look carefully one by one. If you meet your requirements, you will take the initiative to submit your resume, and so on and on...

The second point is that salespersons want to find purchasing managers or purchasing managers of corporate customers. In addition to exhibitions and introductions from relatives and friends, it takes a lot of time and energy to find the people they really want to find. Can't get in, but you want to make an appointment but can't get in touch with the person you're looking for

The most popular social software in China often cannot find the person you are looking for, because those social software is actually a communication tool for the circle of acquaintances, and it is difficult for strangers to enter

[0008] Similarly, it is also difficult to find friends who are interested in something. For example, if you want to collect a certain series of stamps, you need to spend a lot of time and find them through various channels, but the result is often that you can’t find them.

[0009] Third, the phenomenon of leftover men and women is becoming more and more serious. Although there are at least dozens or hundreds of social networking sites and social apps, it is really not easy for users to find the person they are looking for. There are three reasons. One: Although everyone wants to meet new friends, they don’t want to be harassed by irrelevant people. The social system must try to filter them out. Second, there are too many people on the Internet, and there is not much time to read information one by one. ;Third, there is no basis for trust in the people you meet online, and some people with bad intentions are mixed in. As a result, it is basically the offline VIP members who are able to successfully match, and it is not possible to get out of the order after paying the money. The question is, how to deal with the problem of marriage, love and friendship among the huge low- and middle-income groups?

[0010] Someone has already proposed an improvement method for this problem. The friend matching method provided by the application number 201811583546.9, the basic idea is two-way matching, and the requirements on both sides and the matching degree are weighted. Therefore, in addition to the normal conditional matching, you also need to do Four things: 1) Add three weights to the friendship conditions, 2) When calculating whether the conditions match between two users, three matching scores and two points should be calculated, 3) All candidate users , and there are four sorting methods. 4) When no eligible candidate users are found, the conditions are automatically relaxed and the process starts again... The problem with this solution is: first, the method is complicated and the user needs to learn Adjust the distribution of weights, and this manual does not explain how to set the weights; secondly, is the mathematical model reasonable? It is very likely that even if a perfect calculation result is obtained in the end, there will be a situation where the two users meet each other

However, there are serious problems with this solution: first, there is no specific technical solution on how to publish the order information, so it can only be understood as writing out all the requirements of the first person for the second person attending the banquet in plain text, and then publishing them ; The second is to publish the information of the orderer to all users of the opposite sex

This means that before the system publishes this information, the users who can accept the information have not been screened or cannot be screened, and can only be broadcast. This is not in line with the common sense of information engineering, because after such news is released, there will be a large number of An extremely large number of system users will receive this message—theoretically, about half of the system users will receive this message, which has become a harassment to users, so such a solution is actually just an idea, Rather than a complete technical solution, those skilled in the art cannot implement it, or have to find another solution by themselves (that is not protected by its patent), so this solution does not solve the problem of safe dating and meeting

Images