CN103761692A - Method for automatic grouping for making friends in travel - Google Patents
Method for automatic grouping for making friends in travel Download PDFInfo
- Publication number
- CN103761692A CN103761692A CN201310751481.5A CN201310751481A CN103761692A CN 103761692 A CN103761692 A CN 103761692A CN 201310751481 A CN201310751481 A CN 201310751481A CN 103761692 A CN103761692 A CN 103761692A
- Authority
- CN
- China
- Prior art keywords
- user
- matching degree
- stroke
- information
- group
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 27
- 238000012163 sequencing technique Methods 0.000 claims description 3
- 238000004891 communication Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention relates to a method for automatic grouping for making friends in travel. The method comprises the steps that information sent by a client side is received by a server side and according to the uploaded information, grouping is conducted according to the gender, the age and the expected number of people; after other traveling information is extracted, a matching degree P is calculated according to the formula that P=a1*Sij+a2*Wij+a3*Tij+a4*Lij+a5*Fij, the lower the value of the matching degree P is, the higher the matching degree is, and higher the value of the matching degree P is, the lower the matching degree is; if the gender and the age both satisfy the requirements, grouping is conducted according to the expected number of people, if the number of people exceeds a threshold value after grouping, the matching degree is calculated, if the matching degree is within a certain range, personnel with the matching degree within the certain range is further divided into a smaller group, the contact ways of members in one group are sent to relevant users, and therefore the relevant users can travel in groups conveniently. The method can satisfy the requirement of single men and women for making friends and the ideas for grouping of traveling members can be achieved conveniently rapidly in real time.
Description
Technical field
The present invention is about a kind of method of automatically forming a team, and particularly to take that tourism makes friends be the method for automatically forming a team of object relevant for a kind of.
Background technology
Traditional tourism is formed a team in method, be mainly by Tour operators to each tourism member's wish, price etc. because usually determining which tourist group tourism member joins, the all tourisms of less consideration member's identity, age, sex and the factors such as requirement of specifically forming a team are on the impact of forming a team, mostly the current this tourism mode of forming a team is to form a team by manual operation, the method that less appliance computer calculates is implemented the work of forming a team of travelling, and can not in real time, conveniently realize tourism member and want the idea of forming a team.And nowadays social unmarried men and women lacks the platform of communication, how to assist above the average age for marriage unmarried men and women in tourism, to send to satisfactory friend, prior art is also not mentioned.
Summary of the invention
For the problems referred to above, the invention provides a kind of method of automatically forming a team of making friends towards tourism, the method comprises:
S1: receive the information that client transmits;
S2: according to sex, be divided into two large group of men and women;
S3: each large group is divided different groups according to age bracket;
S4: extract travel excursion information, comprise departure place S, departure time W, stroke T.T. T, the total distance L of stroke, sight spot F and associated person information;
S5: gather expectation number, the identical user of expectation number is divided and does one group, divide into groups with expectation number according to the time sequencing of client upload information;
S6: judge whether expectation number is less than threshold value, if so, skip to step S8, if not, carry out step S7;
S7: one by one according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate the matching degree of each member's relevant information in this group, and calculate the difference between these matching degrees, according to difference order sequence from small to large, minute at least two groups, return to step S8;
S8: the associated person information that sends same grouping is organized each member to this;
Wherein, P is matching degree, and the value of P is less shows that matching degree is higher, on the contrary, shows that matching degree is lower; A1, a2, a3, a4, a5 represent weighting proportion, a1+a2+a3+a4+a5=1, and a1, a2, a3, a4, a5 are more than or equal to 0 to be less than or equal to 1 positive number, S
ijthe distance that represents i user and j user departure place, W
ijrepresent the poor of i user and j user's departure time, T
ijrepresent the poor of i user and j user's stroke T.T., L
ijpoor, the F that represent i user and j user's the total distance of stroke
ijrepresent i the number that user is different from j user's sight spot.
According to the above-mentioned method of automatically forming a team of making friends towards tourism, carry out step S8, the poor W of T/ departure time stroke T.T. after increasing time error restrictive condition after step S7
ijbe greater than certain value.
According to the above-mentioned method of automatically forming a team of making friends towards tourism, carry out step S8, the distance S of the total distance L/ of stroke departure place after increasing domain error restrictive condition after step S7
ijbe greater than certain value.
The present invention is about a kind of method of automatically forming a team of making friends towards tourism, by server end, receive the information that client transmits, according to the information of uploading, according to sex, age and divide into groups according to expectation number, if grouping exceeds threshold value, need to extract after other travel informations according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate matching degree P, the value of matching degree P is less shows that matching degree is higher, otherwise shows that matching degree is lower, a1, a2, a3, a4, a5 represent weighting proportion, S
ij, W
ij, T
ij, L
ijand F
ijrepresent respectively the distance of i user and j user departure place, departure time poor, stroke T.T. poor, the number that the difference of the total distance of stroke is different with sight spot, if sex, age meets the requirements, according to the number of expectation, divide into groups, if the rear number of grouping exceeds threshold value and carries out the calculating of matching degree, if matching degree within the specific limits, matching degree personnel are within the specific limits divided further less one group, and send to this to organize each user the contact method that is divided into the member of a group, so that associated user forms a team, go on a tour together, the present invention can meet numerous unmarried men and women demand of making friends, and in real time, conveniently realize tourism member and want the idea of forming a team.And, for profit, considering, travelling organizer does not provide itinerary that some profits are lower as the itinerary of ultra-short range itinerary or time overlength or scope super large, can not meet the needs of tourist's Group tour in these itineraries.
Embodiment
For making that object of the present invention, feature and function thereof are had to further understanding, hereby coordinate embodiment to be described in detail as follows.
For the problems referred to above, the invention provides a kind of method of automatically forming a team of making friends towards tourism, the method comprises:
S1: receive the information that client transmits;
S2: according to sex, be divided into two large group of men and women;
S3: each large group is divided different groups according to age bracket;
S4: extract travel excursion information, comprise departure place S, departure time W, stroke T.T. T, the total distance L of stroke, sight spot F and associated person information;
S5: gather expectation number, the identical user of expectation number is divided and does one group, divide into groups with expectation number according to the time sequencing of client upload information;
S6: judge whether expectation number is less than threshold value, if so, skip to step S8, if not, carry out step S7;
S7: one by one according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate the matching degree of each member's relevant information in this group, and calculate the difference between these matching degrees, according to difference order sequence from small to large, minute at least two groups, return to step S8;
S8: the associated person information that sends same grouping is organized each member to this;
Above-mentioned P is matching degree, and the value of P is less shows that matching degree is higher, on the contrary, shows that matching degree is lower; A1, a2, a3, a4, a5 represent weighting proportion, according to each key element, the impact of matching degree are arranged to weighting proportion, a1+a2+a3+a4+a5=1, and a1, a2, a3, a4, a5 are more than or equal to 0 to be less than or equal to 1 positive number; S
ijthe distance that represents i user and j user departure place, if two users' departure place is identical, S
ijbe 0; W
ijrepresent the poor of i user and j user's departure time, if two users' departure time is identical; W
ijbe 0, T
ijrepresent the poor of i user and j user's stroke T.T., if two user's stroke T.T.s are identical, T
ijbe 0; L
ijthe total distance of stroke poor that represents i user and j user, if the total distance of two users' stroke is identical, L
ijbe 0; F
ijrepresent i the number that user is different from j user's sight spot, if the sight spot arranging in two user's tourism processes is all identical, F
ijbe 0.
Server end receives the information that client is sent, and according to the information of uploading, according to sex, age and divide into groups according to expectation number, if grouping exceeds threshold value, needs to extract after other travel informations according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate matching degree P, the value of matching degree P is less shows that matching degree is higher, otherwise shows that matching degree is lower; If sex, age meet the requirements and matching degree within the specific limits, divide into groups, if the rear number of grouping exceeds threshold value and carries out the calculating of matching degree, the maximum numbers of this threshold value for forming a team after dividing into groups, can determine according to actual conditions, the present invention does not limit, if matching degree within the specific limits, matching degree personnel are within the specific limits divided further less one group, according to the matching degree calculated difference of calculating, according to one or more difference range threshold values of setting, divide into groups.Difference range threshold value is that matching degree is divided into at least two intervals, the end points that each is interval and difference range threshold value, if only there is a difference threshold, matching degree is divided into two intervals, the personnel that so difference are less than to this threshold value are divided into one group, and the personnel that are greater than this threshold value are divided into one group.By that analogy, if N threshold value is divided into N+1 group according to threshold size.And send to this to organize each user the contact method that is divided into the member of a group, and so that associated user forms a team, going on a tour together, the present invention can meet numerous unmarried men and women demand of making friends, and in real time, conveniently realizes tourism member and want the idea of forming a team.
Illustrate, the result of dividing into groups according to sex and age section is that the male sex between 30-32 is divided into one group by institute's has age, and the male sex of age between 32-35 is divided into one group, and the women of age between 30-32 is divided into one group, the women of age between 32-35 is divided into one group, the like.After grouping, according to the number of every group, according to the matching degree of travel information, carry out division group again,
According to the above-mentioned method of automatically forming a team of making friends towards tourism, carry out step S8, the poor W of T/ departure time stroke T.T. after increasing time error restrictive condition after step S7
ijbe greater than certain value.Illustrate, if stroke T.T. is greater than 50 hours, the mistiming of setting out is less than 1 hour, be that time error is when being greater than 50, can the group of spelling, if the mistiming of setting out is greater than 1 hour, the group of spelling not, how much concrete time error restrictive condition value can determine according to actual conditions if being made as, the present invention does not limit.
According to the above-mentioned method of automatically forming a team of making friends towards tourism, carry out step S8, the distance S of the total distance L/ of stroke departure place after increasing domain error restrictive condition after step S7
ijbe greater than certain value.Illustrate, if the total distance of stroke is greater than 1000 kms, the range difference of departure place is less than 2 kms, be that domain error is when being greater than 50, can the group of spelling, if the range difference of departure place is greater than 2 kms, domain error is less than 50 not groups of spelling, how much concrete domain error restrictive condition value can determine according to actual conditions if being made as, the present invention does not limit.
The present invention is about a kind of method of automatically forming a team of making friends towards tourism, by server end, receive the information that client transmits, according to the information of uploading, according to sex, age and divide into groups according to expectation number, if grouping exceeds threshold value, need to extract after other travel informations according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate matching degree P, the value of matching degree P is less shows that matching degree is higher, otherwise shows that matching degree is lower, a1, a2, a3, a4, a5 represent weighting proportion, S
ij, W
ij, T
ij, L
ijand F
ijrepresent respectively the distance of i user and j user departure place, departure time poor, stroke T.T. poor, the number that the difference of the total distance of stroke is different with sight spot, if sex, age meets the requirements, according to the number of expectation, divide into groups, if the rear number of grouping exceeds threshold value and carries out the calculating of matching degree, if matching degree within the specific limits, matching degree personnel are within the specific limits divided further less one group, and send to this to organize each user the contact method that is divided into the member of a group, so that associated user forms a team, go on a tour together, the present invention can meet numerous unmarried men and women demand of making friends, and in real time, conveniently realize tourism member and want the idea of forming a team.And, for profit, considering, travelling organizer does not provide itinerary that some profits are lower as the itinerary of ultra-short range itinerary or time overlength or scope super large, can not meet the needs of tourist's Group tour in these itineraries.
The present invention is described by above-mentioned related embodiment, yet above-described embodiment is only for implementing example of the present invention.Must be pointed out that, the embodiment having disclosed does not limit the scope of the invention.On the contrary, the change done without departing from the spirit and scope of the present invention and retouching, all belong to scope of patent protection of the present invention.
Claims (3)
1. the method for automatically forming a team of making friends towards tourism, is characterized in that, the method comprises:
S1: receive the information that client transmits;
S2: according to sex, be divided into two large group of men and women;
S3: each large group is divided different groups according to age bracket;
S4: extract travel excursion information, comprise departure place S, departure time W, stroke T.T. T, the total distance L of stroke, sight spot F and associated person information;
S5: gather expectation number, the identical user of expectation number is divided and does one group, divide into groups with expectation number according to the time sequencing of client upload information;
S6: judge whether expectation number is less than threshold value, if so, skip to step S8, if not, carry out step S7;
S7: one by one according to formula P=a1*S
ij+ a2*W
ij+ a3*T
ij+ a4*L
ij+ a5*F
ijcalculate the matching degree of each member's relevant information in this group, and calculate the difference between these matching degrees, according to difference order sequence from small to large, minute at least two groups, carry out step S8;
S8: the associated person information that sends same grouping is organized each member to this;
Wherein, P is matching degree, and the value of P is less shows that matching degree is higher, on the contrary, shows that matching degree is lower; A1, a2, a3, a4, a5 represent weighting proportion, a1+a2+a3+a4+a5=1, and a1, a2, a3, a4, a5 are more than or equal to 0 to be less than or equal to 1 positive number, S
ijthe distance that represents i user and j user departure place, W
ijrepresent the poor of i user and j user's departure time, T
ijrepresent the poor of i user and j user's stroke T.T., L
ijpoor, the F that represent i user and j user's the total distance of stroke
ijrepresent i the number that user is different from j user's sight spot.
2. the method for automatically forming a team of making friends towards tourism according to claim 1, is characterized in that, carries out step S8, the poor W of stroke T.T. T/ departure time after increasing time error restrictive condition after step S7
ijbe greater than certain value.
3. the method for automatically forming a team of making friends towards tourism according to claim 1, is characterized in that, carries out step S8, the distance S of stroke total distance L/ departure place after increasing domain error restrictive condition after step S7
ijbe greater than certain value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310751481.5A CN103761692A (en) | 2013-12-31 | 2013-12-31 | Method for automatic grouping for making friends in travel |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310751481.5A CN103761692A (en) | 2013-12-31 | 2013-12-31 | Method for automatic grouping for making friends in travel |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN103761692A true CN103761692A (en) | 2014-04-30 |
Family
ID=50528925
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310751481.5A Pending CN103761692A (en) | 2013-12-31 | 2013-12-31 | Method for automatic grouping for making friends in travel |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103761692A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107615733A (en) * | 2015-04-14 | 2018-01-19 | 蔡宏铭 | Realization is shared with pedestrian's instant messaging, peer message and the method and system of commending contents |
| JP2024024998A (en) * | 2022-08-10 | 2024-02-26 | トヨタ自動車株式会社 | Itinerary matching system, itinerary matching method, itinerary matching program |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030074133A1 (en) * | 2001-10-16 | 2003-04-17 | Mckinley Richard | TripKing-a preference-based, date, time and route sensitive road trip planning/itinerary software/web application |
| CN102117471A (en) * | 2009-12-31 | 2011-07-06 | 上海天那电器有限公司 | Multimedia network service platform for independent travel |
| CN102306172A (en) * | 2011-08-24 | 2012-01-04 | 深圳市凯立德科技股份有限公司 | Accompanied tour recommendation method and system |
| CN102509248A (en) * | 2011-11-22 | 2012-06-20 | 昆明理工大学 | Multi-objective categorization method for travel grouping and system adopting same |
-
2013
- 2013-12-31 CN CN201310751481.5A patent/CN103761692A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20030074133A1 (en) * | 2001-10-16 | 2003-04-17 | Mckinley Richard | TripKing-a preference-based, date, time and route sensitive road trip planning/itinerary software/web application |
| CN102117471A (en) * | 2009-12-31 | 2011-07-06 | 上海天那电器有限公司 | Multimedia network service platform for independent travel |
| CN102306172A (en) * | 2011-08-24 | 2012-01-04 | 深圳市凯立德科技股份有限公司 | Accompanied tour recommendation method and system |
| CN102509248A (en) * | 2011-11-22 | 2012-06-20 | 昆明理工大学 | Multi-objective categorization method for travel grouping and system adopting same |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107615733A (en) * | 2015-04-14 | 2018-01-19 | 蔡宏铭 | Realization is shared with pedestrian's instant messaging, peer message and the method and system of commending contents |
| JP2024024998A (en) * | 2022-08-10 | 2024-02-26 | トヨタ自動車株式会社 | Itinerary matching system, itinerary matching method, itinerary matching program |
| JP7666450B2 (en) | 2022-08-10 | 2025-04-22 | トヨタ自動車株式会社 | Itinerary matching system, itinerary matching method, itinerary matching program |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Kim et al. | TWILITE: A recommendation system for Twitter using a probabilistic model based on latent Dirichlet allocation | |
| He et al. | Multi-attribute decision making based on neutral averaging operators for intuitionistic fuzzy information | |
| CN103679508A (en) | Self-service group forming method based on time and space constraints | |
| MY204137A (en) | Blockchain-based room inventory management system | |
| CN103679588A (en) | Self-service travel grouping method | |
| MX2015005316A (en) | Network access based on social-networking information. | |
| WO2014144232A3 (en) | Compensating members of an online social network for recruitment of new members | |
| CN111832938A (en) | Order-based pairing method and pairing device | |
| WO2010039664A3 (en) | Conference networking system incorporating social networking site information | |
| WO2011143154A3 (en) | Automated social networking graph mining and visualization | |
| WO2015089040A3 (en) | User discovery via digital id and face recognition | |
| EP2153341A4 (en) | System and method for creating a social-networking online community | |
| CN106570654A (en) | Breakdown rescue real-time situation monitoring and event interactive processing system for power distribution network | |
| WO2014012175A3 (en) | Measuring influence in a social network | |
| MX361475B (en) | Querying features based on user actions in online systems. | |
| WO2015023713A3 (en) | Mobile application check-in and payment systems and methods of their operation | |
| CN102831176A (en) | Method and server for recommending friends | |
| PH12017501154B1 (en) | Point management system and point management method | |
| WO2016061951A1 (en) | Group meeting optimal path selection method, device, and storage media | |
| WO2014118756A3 (en) | A system and method for managing online information by a community manager | |
| CN103761692A (en) | Method for automatic grouping for making friends in travel | |
| CN103700044A (en) | Method for realizing self-service tourist gathering before travel | |
| CN103476142A (en) | Method for establishing temporary user group for smartphones gathered together | |
| CN111260424A (en) | Information processing method and device | |
| CN104408674A (en) | Service platform system for scientific and technical innovation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20140430 |
|
| WD01 | Invention patent application deemed withdrawn after publication |