CN102902689A - Application of matching method and system based on traveling line geometrical characteristics to social network - Google Patents
Application of matching method and system based on traveling line geometrical characteristics to social network Download PDFInfo
- Publication number
- CN102902689A CN102902689A CN 201110212482 CN201110212482A CN102902689A CN 102902689 A CN102902689 A CN 102902689A CN 201110212482 CN201110212482 CN 201110212482 CN 201110212482 A CN201110212482 A CN 201110212482A CN 102902689 A CN102902689 A CN 102902689A
- Authority
- CN
- China
- Prior art keywords
- route
- apart
- distance
- point
- respect
- 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
Images
Landscapes
- Navigation (AREA)
- Traffic Control Systems (AREA)
Abstract
The invention relates to an application of a matching method and system based on traveling line geometrical characteristics to a social network, comprising the following steps that 1) a user of the social network collects and generates traveling lines with specific geometrical characteristics and accesses a user platform of the social network; 2) a social network server matches two or more than two traveling lines and matches the intersection of the two traveling lines according to a simulated D distance, namely an overlapped region of the D distance, wherein the matching degree of the two traveling lines is the matching index of the D distance; and 3) the social network outputs a matching result to the user platform, and a fellow traveler information list matched with the matching result is simultaneously given out, wherein the matching result comprises the intersection and/or the matching index of the two matched traveling lines. The application has the advantages that line information described by a line keyword is replaced by the geometrical characteristics of the traveling lines so as to enhance the matching quality and the reliability of the system and enrich the matching result; and the time is saved and the successful rate is improved.
Description
Technical field:
The present invention relates to a kind of calculating, reckoning, more specifically to a kind of matching process and system application in social networks based on trip circuit geometric properties.
Background technology:
Social networking system can be by the user the traffic path information matches, find out the common factor between route, may wish the people that is familiar with each other thereby contact.The route matching process of relatively commonly using at present is based on the keyword relevant with route and mates.These class methods need the user in specifying a certain zone, such as a certain city, a certain province, and the input mode of transportation, such as title, the originating station title of public transport, subway, pass through place name, terrestrial reference title etc. midway, find traffic path each other that the people of common factor is arranged.The weak point that this method exists is: at first, route for public transport, make up the information of keyword, such as public transport title, subway title, start site title etc., all might change because public transport runs the again planning of department, government or other relevant departments, at keyword not in time synchronously more under the news, based on the coupling of route keyword low quality matches result or wrong matching result can appear; Secondly, for Walking Route and self-driving route, need the user to refine keyword from the traffic path of oneself, this process has very large subjectivity.Even if for the same route, the keyword that different user refines also might be different.And for diverse route, might extract identical keyword.Therefore, the subjectivity of this structure keyword finally causes low quality matches result or erroneous matching result; Again, the input message process is loaded down with trivial details, adds that the process need user who makes up the route keyword does a large amount of thinkings, this so that many users may select to abandon.In a word, this class exists certain limitation and finiteness based on the matching result that the method for keyword coupling draws.
Therefore, the user needs a kind of input message simple and objective, and the mode that has simultaneously high-quality route matching result is carried out the method and system of route coupling.For this reason, proposed among the present invention a kind of brand-new, the method and system that mates based on the geometry of paths feature and in social networks, using.
Summary of the invention:
The objective of the invention is to provide for the prior art weak point a kind of matching process and system application in social networks based on trip circuit geometric properties.Use the method and system, the user does not need burden to set up and upgrades the trip information nitty-gritty details, can obtain high-quality route matching result simultaneously.
The objective of the invention is to realize by following measures: a kind of matching process and system application in social networks based on trip circuit geometric properties, it is characterized in that, concrete steps are as follows:
Step 1, social networks user gather and generate trip circuit, the access social networks user platform that contains particular geometric feature;
Step 2, social networking service device mate two or more traffic path, match the common factor of two traffic paths by the D that drafts distance, i.e. the overlapping region of D distance, and the matching degree of two trip circuits is the match index of D distance;
Step 3, social networks are to user platform output matching result, and described matching result comprises common factor and/or the match index of two or more traffic paths that mated, and provide simultaneously the fellow traveler's information list that matches.
In the described step 1, the described trip circuit that contains particular geometric feature is that some specified points reach the broken line that is linked to be by these specified points.
In the described step 1, the described trip circuit of particular geometric feature that contains is the set of several location points.
In the described step 2, the individual instances of the described D distance of drafting and match people, the mode of trip are relevant, or draft voluntarily definite or determine by recommendation by match people, described recommendation trip for the D distance of walking circuit be 10 meters, trip for the D distance of public bus network be that 20 meters, trip are 50 meters for the D distance of self driving.
Be some specified points and the broken line that is linked to be by these specified points for traffic path, in the described step 2, described D is for the first route in the two lines of being mated and the second route apart from coupling, ask for the zone on the first route, so that any point in should the zone, can on the second route, find a bit at least so that the zone on the first route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the zone on the second route, so that any point in should the zone, can on the first route, find a bit at least so that the zone on the second route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the second route with respect to the D of the first route apart from the overlapping region; Described D apart from the overlapping region for do not exist or route on one or more snippets is interval along the line.
Be some specified points and the broken line that is linked to be by these specified points for traffic path, in the described step 2, the match index of described D distance be with the first route with respect to the D of the second route apart from the length of the overlapping region length divided by the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the length of the overlapping region length divided by the second route, can obtain the second route with respect to the D of the first route apart from match index; Described D is multistage when along the line interval apart from the overlapping region, and its length equals the summation of these burst lengths along the line, and the length of a described route refers to the distance along the line from the starting point of this route to the terminal point of this route.
Be some specified points and the broken line that is linked to be by these specified points for traffic path, in the described step 2, described D apart from match index be with the first route with respect to the D of the second route apart from the traffic time of the overlapping region total traffic time divided by the first route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.Same second route that calculates with respect to the D of the first route apart from the method for match index also can be, with the second route with respect to the traffic time in the D overlap distance zone of the first route total traffic time divided by the second route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.
In step by step rapid on described, when D is that multistage along the line is when interval apart from the overlapping region, its traffic time equals the summation of the traffic time in each interval along the line, and described traffic time refers to the user with corresponding mode of transportation or walking or takes public transport or the self-driving process used time of respective regions.
Be the set of several location points for traffic path, in the described step 2, described D is for the first route in the two lines of being mated and the second route apart from coupling, ask the subset of the location point set of the first route, so that any point in this subset, can in the location point set of the second route, find at least a bit, so that the subset of the first via line position point that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for set be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the subset of the location point set of the second route, so that any point in this subset, can in the location point set of the first route, find at least a bit, so that the subset of the location point of the second route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for set be called the second route with respect to the D of the first route apart from the overlapping region; Described D is apart from the subset of overlapping region for not existing or gathering for route allocation point.
Be the set of several location points for traffic path, in the described step 2, the match index of described D distance be with the first route with respect to the D of the second route apart from the number of the location point of the overlapping region sum divided by the location point of the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the number of the location point of the overlapping region sum divided by the location point of the second route, can obtain the second route with respect to the D of the first route apart from match index.
A kind of application of matching system in social networks based on trip circuit geometric properties is characterized in that, comprises client, server end, reaches the mixed-media network modules mixed-media that connects the client and server end; Described client is connected to form by route acquisition module, electronic chart subsystem and subscriber interface module, and described server end is connected to form successively by applied logic module, route engine module, data storage subsystem.
Compared with prior art, matching process and the system application in social networks based on trip circuit geometric properties that the present invention proposes, have following advantage: the present invention is from the geometric properties of trip circuit, the route information that comes the alternative route keyword to describe, to strengthen quality of match and the confidence level made from this system, enriched matching result; Simultaneously, make things convenient for searching of user, improved the user and searched the contact human efficiency, saved the time, improved success ratio.
Description of drawings:
Fig. 1 is the exemplary plot that relates to the related notion of geometry of paths feature in the embodiment of the invention;
Fig. 2 is route matching result exemplary plot according to an embodiment of the invention;
Fig. 3 is route matching result exemplary plot in accordance with another embodiment of the present invention;
Fig. 4 is system chart according to an embodiment of the invention.
Embodiment:
Below in conjunction with accompanying drawing embodiment is elaborated:
A kind of matching process and system application in social networks based on trip circuit geometric properties is characterized in that, concrete steps are as follows:
Step 1, social networks user gather and generate trip circuit, the access social networks user platform that contains particular geometric feature, and described collection and generation traffic path are selected from following method:
A. create route by the GPS positioning system;
B. the positioning system by RFID creates route;
C. the positioning system based on the wifi focus creates route;
D. the visual edit instrument by electronic chart creates route.
Except above four kinds of methods, can also exemplify the plurality of devices record and generate traffic path, the user can make one's options voluntarily according to self familiarity to these methods.
The trip circuit that contains particular geometric feature for generation, the present invention has two embodiment, and the below is described below:
Embodiment one, and generating the trip circuit that contains particular geometric feature is that some specified points reach the broken line that is linked to be by these specified points.
Fig. 1 is the exemplary plot that relates to the related notion of geometry of paths feature in the embodiment of the invention.Route 200 among the figure is formed by connecting by three location points successively straight line, is respectively location point 202, location point 204 and location point 208.Point 206 is a point on the route 200.On [202,204] expression route 200 202 and 204 point-to-point transmissions and comprise a little 202 with the interval along the line of putting 204, this interval along the line is a line segment.On [202,206] expression route 200 202 and 206 point-to-point transmissions and comprise a little 202 with the interval along the line of putting 206, this interval along the line is a broken line.202 and 204 point-to-point transmissions and do not comprise a little 202 and put 204 line segment interval on (202,204) expression route 200.[202,204) 202 and 204 point-to-point transmissions and comprise a little 202, do not comprise a little 204 line segment interval on the expression route 200.
Step 2, social networking service device mate two or more traffic path, match the common factor of two traffic paths by the D that drafts distance, i.e. the overlapping region of D distance, and the matching degree of two trip circuits is the match index of D distance.In this step, the individual instances of the described D distance of drafting and match people, the mode of trip are relevant, or draft voluntarily definite or definite by recommendation by match people.Because the people is individual, for the people of walking, he may think that the distance of seeing target people or object face to face is 8 meters, and some people of face then thinks can reach 12 meters.And for the people who drives, he may think that the distance of seeing target people or object face to face is 45 meters, and some people thinks can reach 55 meters.Therefore, for the people of first selection, can have any problem, therefore the present invention is in the situation that group experiment has been drafted recommends to plant: described recommendation trip for the D distance of walking circuit be 10 meters, trip for the D distance of public bus network be that 20 meters, trip are 50 meters for the D distance of self driving.
In a word, following factor is depended in the selection of D distance: 1) the mode of transportation type of route.Such as, when two Walking Routes were carried out D apart from coupling, numerical value D was 10 meters.And two public transit route are when carrying out d apart from coupling, and numerical value d is 20 meters.2) bulk velocity of route.Such as, when two Walking Routes were carried out D apart from coupling, because the route bulk velocity is less, thereby numerical value D was also smaller; And two self-driving routes are when carrying out D apart from coupling, because the route bulk velocity is larger, thereby numerical value D is also relatively large.3) local velocity of each section on the route.Such as, for speed larger place in local highway section on the route, when carrying out D apart from coupling, the numerical value of corresponding D is also larger; And for speed less place in local highway section on the route, when carrying out D apart from coupling, the numerical value of corresponding D is also smaller.4) local velocity of each position point on the route.Such as, carrying out D apart from coupling near the interval larger location point of speed on the route, the numerical value of corresponding d is also larger; And for carrying out D between the less location point attachment area of speed on the route apart from coupling, the numerical value of corresponding D is also smaller.
In this step, described D is for the first route in the two lines of being mated and the second route apart from coupling, ask for the zone on the first route, so that any point in should the zone, can on the second route, find at least a bit, so that the zone on the first route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the zone on the second route, so that any point in should the zone, can on the first route, find a bit at least so that the zone on the second route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the second route with respect to the D of the first route apart from the overlapping region; Described D apart from the overlapping region for do not exist or route on one or more snippets is interval along the line.The first route may not exist apart from the overlapping region with respect to the d of the second route, may be that on the first route one or more snippets is interval along the line yet; In like manner, the second route may not exist apart from the overlapping region with respect to the d of the first route, may be that on the second route one or more snippets is interval along the line yet.
Fig. 2 is route matching result exemplary plot according to an embodiment of the invention.Among the figure, two lines are respectively route 300 and route 314.Among this embodiment, the D that two lines have the identical overall situation is apart from coupling numerical value, i.e. D
0Wherein, route 300 is the broken lines that are connected in sequence by three location points, is respectively location point 302, location point 304 and location point 306; Route 314 also is the broken line that is connected in sequence by three location points, is respectively location point 312, location point 310 and location point 308.The distance 324 of the line segment 302 to 304 of the centre 1: 316 on the present embodiment setting path 314 in the route 300 equals D
0, the centre 1: 320 on the route 314 and the distance 326 of the location point 306 on the line segment 304 to 306 in the route 300 equal D
0Any point in the interval on the route 314 [316,320] can find a bit on route 300 at least, makes it the distance of point-to-point transmission less than or equal to D
0The interval on the route 314 [312,316) in the distance of any point any point to the route 300 greater than D
0The interval on the route 314 (320,308] in the distance of any point any point to the route 300 greater than D
0Therefore, route 314 is [316,320] with respect to the D of route 300 apart from the overlapping region; And the distance 322 of the line segment 312 to 310 of the centre 1: 318 on the route 300 in the route 314 equals D
0Any point in interval for [318,306] can find a bit on route 314 at least, makes it the distance of point-to-point transmission less than or equal to D
0For [302,318) any point in interval, the distance of any point is greater than D to the route 314
0Therefore, route 300 is [318,306] with respect to the D of route 314 apart from the overlapping region.
In order further to reflect the degree of coupling, the present invention introduces the match index of D distance, and following two kinds of methods are arranged:
1) in the described step 2, the match index of described D distance be with the first route with respect to the D of the second route apart from the length of the overlapping region length divided by the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the length of the overlapping region length divided by the second route, can obtain the second route with respect to the D of the first route apart from match index; Described D is multistage when along the line interval apart from the overlapping region, and its length equals the summation of these burst lengths along the line, and the length of a described route refers to the distance along the line from the starting point of this route to the terminal point of this route.Route 314 is that the length of the area along the line on the route 314 [316,320] is divided by the length of route 314 apart from match index with respect to the D of route 300; And route 300 is that the length of the area along the line on the route 300 [318,306] is divided by the length of route 300 apart from match index with respect to the D of route 314.The match index of the D distance here is the overlapping match index of route of D distance, knows the overlapping percentage that accounts for integral body of traffic path, makes things convenient for user's reference.
2) described D apart from match index be with the first route with respect to the D of the second route apart from the traffic time of the overlapping region total traffic time divided by the first route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.Same second route that calculates with respect to the D of the first route apart from the method for match index also can be, with the second route with respect to the traffic time in the D overlap distance zone of the first route total traffic time divided by the second route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.Route 314 is that the traffic time of the area along the line on the route 314 [316,320] is divided by total traffic time of route 314 apart from match index with respect to the D of route 300; And route 300 is that the traffic time of the area along the line on the route 300 [318,306] is divided by total traffic time of route 300 apart from match index with respect to the D of route 314.The match index of the D distance here is the time match index of D distance, knows that the traffic path common factor time accounts for the percentage of whole time, makes things convenient for user's reference.
In upper step, when D is that multistage along the line is when interval apart from the overlapping region, its traffic time equals the summation of the traffic time in each interval along the line, and described traffic time refers to the user with corresponding mode of transportation or walking or takes public transport or the self-driving process used time of respective regions.
Embodiment two, and generating the trip circuit that contains particular geometric feature is the set of several location points.
Article two, go on a journey circuit as shown in Figure 3, among the figure, location point 402,404 and 406 consists of the location point set of the first route, i.e. { 402,404,406}; Location point 408,410,412 and 414 consists of the location point set of the second route, i.e. { 408,410,412,414}.
The described D distance of drafting is identical with embodiment one, the D distance of drafting is relevant with the mode of the individual instances of match people, trip, or draft voluntarily definite or determine by recommendation by match people, described recommendation trip for the D distance of walking circuit be 10 meters, trip for the D distance of public bus network be that 20 meters, trip are 50 meters for the D distance of self driving.
Concrete matching process is, for for the first route in the two lines of being mated and the second route, ask the subset of the location point set of the first route, so that any point in this subset, can in the location point set of the second route, find a bit, so that the subset of the first via line position point that the distance of this point-to-point transmission less than or equal to the D distance, is asked for set be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the subset of the location point set of the second route, so that any point in this subset, can in the location point set of the first route, find at least a bit, so that the subset of the location point of the second route that the distance of this point-to-point transmission less than or equal to the D distance, is asked for set be called the second route with respect to the D of the first route apart from the overlapping region; Described D is apart from the subset of overlapping region for not existing or gathering for route allocation point.
The match index of described D distance be with the first route with respect to the D of the second route apart from the number of the location point of the overlapping region sum divided by the location point of the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the number of the location point of the overlapping region sum divided by the location point of the second route, can obtain the second route with respect to the D of the first route apart from match index.
Among this embodiment, for the distance relation between the first route and the second route allocation point, only has the distance 418 of 412 of the distance 416 of 408 of location point 402 and location points and location point 404 and location points less than or equal to threshold value D.Therefore, the first route with respect to the D of the second route apart from the overlapping region be the first route the location point subset 402,404}, the first route is 2/3 with respect to the D of the second route apart from match index, namely 0.66; The second route with respect to the D of the first route apart from the overlapping region be the second route the location point subset 408,412}, the second route is 2/4 with respect to the D of the first route apart from match index, namely 0.50.
Step 3, social networks are to user platform output matching result, described matching result comprises common factor and/or the match index of two or more traffic paths that mated, provide simultaneously the fellow traveler's information list that matches, drawn result confesses pedestrian's reference.
Fig. 4 is system chart according to an embodiment of the invention.Among the figure, system 600 comprises client 602, server end 616, reaches the mixed-media network modules mixed-media 618 that connects client 602 and server end 616; Described client 602 is connected to form with subscriber interface module 604 by route acquisition module 606, electronic chart subsystem 608, and described server end 616 is connected to form successively by applied logic module 610, route engine module 612, data storage subsystem 614.The subscriber interface module 604 of native system provides one or more information screen and operation interface, comprises route data acquisition interface, visualization display route of user information, demonstration fellow traveler tabulation, visualization display and fellow traveler's the zone etc. of meeting.Establishment and editor that route acquisition module 606 is responsible for route.The route acquisition method can come Real-time Collection by GPS or other device systems that possesses positioning function, also can use the visual edit instrument based on electronic chart to create and edit route, can also directly upload the route data file that uses third party device system acquisition position to generate.In addition also comprehensively the above three kinds of method or wherein two kinds create and edit route.Electronic chart subsystem 608 is responsible for visualization display user's the functions such as traffic path, mark route overlapping region and editor's traffic path; Applied logic module 610 is responsible for receiving and is processed client 602 and send service request, and accordingly result is returned to client 602.Route engine module 612 is responsible for processing the route coupling and is calculated.Data storage subsystem 614 is responsible for user account data, route data, related other data storage of route matching result and system and inquiry.Data storage subsystem 614 can be that Database Systems, file system or other can be used for storing arbitrarily the system of data.Network connection 618 can be the Internet, LAN (Local Area Network), telephone network, mobile radio communication and other any network connection that can communicate by letter.
The below further specifies the operation of system 600 with embodiment three.In this embodiment, the user at first creates the working route of oneself, take the GPS mobile phone terminal as example, the user presses the route start-of-record button that user interface 604 provides during from family, press the route conclusion button that user interface 604 provides when arriving work unit, and the label of input route, such as working, time period and other behavior description information, so far client 602 is finished the collection of route data, and route data is sent to server end 616.Applied logic module 610 deposits route data in data storage subsystem 614.The user is by user interface the working route route that visualization display oneself creates on electronic chart subsystem 608, route label and other descriptors.Simultaneously, the user can click the fellow traveler's inquire button on the user interface 604, and client 602 is sent fellow traveler's query requests of route to server end 616.After 610 of applied logic moulds were received this request, notice route engine 612 was taken out route to be matched from data-storage system, and the working route with this user mates calculating successively, and matching result is returned to applied logic module 610.Applied logic module 610 is analyzed matching result, and matching result is returned to client 602.User interface 604 the most therewith go to work people that route goes the same way of user show with the form of tabulation, simultaneously by explanatory note or on electronic chart subsystem 608 visual mark and corresponding fellow traveler's the zone of meeting.
Below be described in conjunction with the embodiments, above-described embodiment is not construed as limiting the invention, as long as employing is equal to the technical scheme that the form of replacement or equivalent transformation obtains, all drops within protection scope of the present invention.
Claims (12)
1. the application of matching process in social networks based on trip circuit geometric properties is characterized in that, step is as follows:
Step 1, social networks user gather and generate trip circuit, the access social networks user platform that contains particular geometric feature.
Step 2, social networking service device mate two or more traffic path, match the common factor of two traffic paths by the D that drafts distance, i.e. the overlapping region of D distance, and the matching degree of two trip circuits is the match index of D distance;
Step 3, social networks are to user platform output matching result, and described matching result comprises common factor and/or the match index of two or more traffic paths that mated, and provide simultaneously the fellow traveler's information list that matches.
2. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 is characterized in that, the described trip circuit that contains particular geometric feature is that some specified points reach the broken line that is linked to be by these specified points.
3. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 is characterized in that, the described traffic path of particular geometric feature that contains is the set of several location points.
4. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 and 2, it is characterized in that, in the described step 2, the individual instances of the described D distance of drafting and match people, the mode of trip are relevant, or draft voluntarily definite or determine by recommendation by match people, the D distance of the walking circuit of described recommendation trip be 10 meters, trip for the D distance of public bus network be that 20 meters, trip are 50 meters for the D distance of self driving.
5. the application of matching process in social networks based on trip circuit geometric properties according to claim 3, it is characterized in that, in the described step 2, the individual instances of the described D distance of drafting and match people, the mode of trip are relevant, or draft voluntarily definite or determine by recommendation by match people, the D distance of the walking circuit of described recommendation trip be 10 meters, trip for the D distance of public bus network be that 20 meters, trip are 50 meters for the D distance of self driving.
6. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 and 2, it is characterized in that, in the described step 2, described D is for the first route in the two lines of being mated and the second route apart from coupling, ask for the zone on the first route, so that any point in should the zone, can on the second route, find at least a bit, so that the zone on the first route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the zone on the second route, so that any point in should the zone, can on the first route, find a bit at least so that the zone on the second route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for be called the second route with respect to the D of the first route apart from the overlapping region; Described D apart from the overlapping region for do not exist or route on one or more snippets is interval along the line.
7. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 and 2, it is characterized in that, in the described step 2, the match index of described D distance be with the first route with respect to the D of the second route apart from the length of the overlapping region length divided by the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the length of the overlapping region length divided by the second route, can obtain the second route with respect to the D of the first route apart from match index; Described D is multistage when along the line interval apart from the overlapping region, and its length equals the summation of these burst lengths along the line, and the length of a described route refers to the distance along the line from the starting point of this route to the terminal point of this route.
8. the application of matching process in social networks based on trip circuit geometric properties according to claim 1 and 2, it is characterized in that, in the described step 2, described D apart from match index be with the first route with respect to the D of the second route apart from the traffic time of the overlapping region total traffic time divided by the first route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.Same second route that calculates with respect to the D of the first route apart from the method for match index also can be, with the second route with respect to the traffic time in the D overlap distance zone of the first route total traffic time divided by the second route, described traffic time refer to the user with corresponding mode of transportation or walking take public transport or self-driving through the used time of respective regions.
9. the application of matching process in social networks based on trip circuit geometric properties according to claim 8, it is characterized in that, in the described step 2, when D is that multistage along the line is when interval apart from the overlapping region, its traffic time equals the summation of the traffic time in each interval along the line, and described traffic time refers to the user with corresponding mode of transportation or walking or takes public transport or the self-driving process used time of respective regions.
10. according to claim 1 or the 3 described application of matching process in social networks based on trip circuit geometric properties, it is characterized in that, in the described step 2, described D is for the first route in the two lines of being mated and the second route apart from coupling, ask the subset of the location point set of the first route, so that any point in this subset, can in the location point set of the second route, find a bit, so that the subset of the first via line position point that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for set be called the first route with respect to the D of the second route apart from the overlapping region; Ask for equally the subset of the location point set of the second route, so that any point in this subset, can in the location point set of the first route, find at least a bit, so that the subset of the location point of the second route that the distance of this point-to-point transmission less than or equal to numerical value D, is asked for set be called the second route with respect to the D of the first route apart from the overlapping region; Described D is apart from the subset of overlapping region for not existing or gathering for route allocation point.
11. according to claim 1 or the 3 described application of matching process in social networks based on trip circuit geometric properties, it is characterized in that, the match index of described D distance be with the first route with respect to the D of the second route apart from the number of the location point of the overlapping region sum divided by the location point of the first route, can obtain the first route with respect to the D of the second route apart from match index; With the second route with respect to the D of the first route apart from the number of the location point of the overlapping region sum divided by the location point of the second route, can obtain the second route with respect to the D of the first route apart from match index.
12. the application of matching system in social networks based on trip circuit geometric properties is characterized in that, comprises client, server end, reaches the mixed-media network modules mixed-media that connects the client and server end; Described client is connected to form successively by route acquisition module and electronic chart subsystem, subscriber interface module, and described server end is connected to form successively by applied logic module, route engine module, data storage subsystem.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110212482 CN102902689A (en) | 2011-07-26 | 2011-07-26 | Application of matching method and system based on traveling line geometrical characteristics to social network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 201110212482 CN102902689A (en) | 2011-07-26 | 2011-07-26 | Application of matching method and system based on traveling line geometrical characteristics to social network |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102902689A true CN102902689A (en) | 2013-01-30 |
Family
ID=47574926
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 201110212482 Pending CN102902689A (en) | 2011-07-26 | 2011-07-26 | Application of matching method and system based on traveling line geometrical characteristics to social network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102902689A (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104598543A (en) * | 2014-11-28 | 2015-05-06 | 广东工业大学 | Social matching data mining system |
| CN105049482A (en) * | 2015-06-03 | 2015-11-11 | 李博 | Geographic position information matching system and method after unexpected meeting |
| CN105577832A (en) * | 2016-02-05 | 2016-05-11 | 腾讯科技（深圳）有限公司 | Method and device for establishing network communication |
| CN105589939A (en) * | 2015-12-15 | 2016-05-18 | 北京百度网讯科技有限公司 | Method and apparatus for identifying group motion track |
| CN105701105A (en) * | 2014-11-26 | 2016-06-22 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN107167151A (en) * | 2016-03-08 | 2017-09-15 | 高德软件有限公司 | Bus routes method to set up, route planning method and device |
| CN107609168A (en) * | 2017-09-27 | 2018-01-19 | 珠海市魅族科技有限公司 | Processing method and processing device, computer installation and the readable storage medium storing program for executing of social information |
| CN107850443A (en) * | 2015-07-28 | 2018-03-27 | 索尼公司 | Information processor, information processing method and program |
| CN108734325A (en) * | 2017-04-13 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | The evaluation method and device of planning path |
| CN110823234A (en) * | 2018-08-10 | 2020-02-21 | 北京搜狗科技发展有限公司 | Data processing method and device and electronic equipment |
| CN111765901A (en) * | 2019-04-02 | 2020-10-13 | 北京三快在线科技有限公司 | Path planning quality evaluation method and device, storage medium and electronic device |
-
2011
- 2011-07-26 CN CN 201110212482 patent/CN102902689A/en active Pending
Cited By (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105701105A (en) * | 2014-11-26 | 2016-06-22 | 联想(北京)有限公司 | Information processing method and electronic equipment |
| CN104598543A (en) * | 2014-11-28 | 2015-05-06 | 广东工业大学 | Social matching data mining system |
| CN104598543B (en) * | 2014-11-28 | 2018-12-14 | 广东工业大学 | A kind of Social Match data digging system |
| CN105049482A (en) * | 2015-06-03 | 2015-11-11 | 李博 | Geographic position information matching system and method after unexpected meeting |
| CN107850443A (en) * | 2015-07-28 | 2018-03-27 | 索尼公司 | Information processor, information processing method and program |
| CN105589939B (en) * | 2015-12-15 | 2020-02-11 | 北京百度网讯科技有限公司 | Method and device for identifying group motion trail |
| CN105589939A (en) * | 2015-12-15 | 2016-05-18 | 北京百度网讯科技有限公司 | Method and apparatus for identifying group motion track |
| CN105577832A (en) * | 2016-02-05 | 2016-05-11 | 腾讯科技（深圳）有限公司 | Method and device for establishing network communication |
| CN105577832B (en) * | 2016-02-05 | 2019-05-03 | 腾讯科技（深圳）有限公司 | Establish the method and device of network communication |
| CN107167151A (en) * | 2016-03-08 | 2017-09-15 | 高德软件有限公司 | Bus routes method to set up, route planning method and device |
| CN107167151B (en) * | 2016-03-08 | 2021-03-05 | 阿里巴巴（中国）有限公司 | Bus route setting method, route planning method and device |
| CN108734325A (en) * | 2017-04-13 | 2018-11-02 | 北京嘀嘀无限科技发展有限公司 | The evaluation method and device of planning path |
| CN108734325B (en) * | 2017-04-13 | 2021-10-15 | 北京嘀嘀无限科技发展有限公司 | Evaluation method and device for planned path |
| CN107609168A (en) * | 2017-09-27 | 2018-01-19 | 珠海市魅族科技有限公司 | Processing method and processing device, computer installation and the readable storage medium storing program for executing of social information |
| CN110823234A (en) * | 2018-08-10 | 2020-02-21 | 北京搜狗科技发展有限公司 | Data processing method and device and electronic equipment |
| CN111765901A (en) * | 2019-04-02 | 2020-10-13 | 北京三快在线科技有限公司 | Path planning quality evaluation method and device, storage medium and electronic device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102902689A (en) | Application of matching method and system based on traveling line geometrical characteristics to social network | |
| CN110008413B (en) | Traffic travel problem query method and device | |
| US6834229B2 (en) | Integrated journey planner | |
| CN106289289B (en) | A kind of navigation destination recommended method and device | |
| CN103884345B (en) | Interest point information collecting method, interest point information displaying method, interest point information collecting device, interest point information displaying device, and interest point retrieval system | |
| CN104111935B (en) | Server and microblog pushing method and system | |
| JP2018528415A (en) | Navigation reference point identification and navigation method, apparatus, and storage medium | |
| CN105554704A (en) | Fake-locus-based location privacy protection method for use in recommendation system | |
| CN102543082A (en) | Voice operation method for in-vehicle information service system adopting natural language and voice operation system | |
| CN101409748A (en) | System and method for collecting, indexing, subscribing and publishing mobile terminal information | |
| CN107167136A (en) | Recommend method and system in a kind of position towards electronic map | |
| CN104794181A (en) | Method and device for processing services based on electronic map | |
| CN102385575A (en) | Timely carpooling service system and method based on GIS (Geographic Information System) | |
| CN106407377A (en) | Search method and device based on artificial intelligence | |
| CN102682046A (en) | Member searching and analyzing method in social network and searching system | |
| CN103942312A (en) | Public transportation transfer line planning method and device | |
| JP2007219655A (en) | Facility information management system, facility information management method and facility information management program | |
| JP4737645B2 (en) | Information distribution system, information distribution method, information distribution server, and terminal device | |
| JP2012059005A (en) | Information service system, relay device and terminal device | |
| CN106886592A (en) | A kind of city space-time data collecting system and method based on data source service | |
| CN114422885A (en) | Route searching method, device, equipment and medium based on topological route | |
| JP2016024600A (en) | Inquiry-and-answering system and control method of inquiry-and-answering system | |
| CN102937954A (en) | One-stop type travel information searching method | |
| CN103984766A (en) | Bus route query method and device | |
| CN114500428A (en) | Navigation sharing method and device, electronic equipment, storage medium and program product |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130130 |