CN105243131B - Path query method and device - Google Patents
Path query method and device Download PDFInfo
- Publication number
- CN105243131B CN105243131B CN201510639696.7A CN201510639696A CN105243131B CN 105243131 B CN105243131 B CN 105243131B CN 201510639696 A CN201510639696 A CN 201510639696A CN 105243131 B CN105243131 B CN 105243131B
- Authority
- CN
- China
- Prior art keywords
- track
- user
- urban road
- history
- web area
- 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.)
- Active
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/29—Geographical information databases
Landscapes
- Engineering & Computer Science (AREA)
- Databases & Information Systems (AREA)
- Theoretical Computer Science (AREA)
- Remote Sensing (AREA)
- Data Mining & Analysis (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Navigation (AREA)
Abstract
The present invention provides a kind of path query method and device.The embodiment of the present invention is by obtaining inquiry data, the inquiry data packet includes departure place and destination, and then according to the inquiry data, obtain the cluster result of the user's history track from the departure place to the destination, make it possible to export the cluster result, due to eliminating the reliance on road weight execution route inquiry operation, therefore, it can be avoided the problem that query result is unreasonable caused by can not timely updating due to the road weight of certain roads in the prior art, to improve the reliability of path query operation.
Description
[technical field]
The present invention relates to inquiring technology more particularly to a kind of path query method and devices.
[background technique]
With the development of communication technology, terminal is integrated with more and more functions, so that the system function of terminal arranges
More and more corresponding applications (Application, APP) are contained in table.It can be related to some path query clothes in some applications
Business, for example, Baidu map etc..These applications show path query query interface to user first, so that user inputs, so
Afterwards, then can according to user input information, setting inquiry terminal point information for example, the endpoints such as departure place and destination letter
Breath, and then query engine is requested to provide path data.Query engine can be based in urban road network and the urban road network
Road road weight, execution route inquiry operation.
However, in some cases for example, influence road weight variation certain factors may change at any time as,
The road weight of road width, pavement quality etc., certain roads possibly can not timely update, so that relying on road weight executes road
Diameter inquiry operation, query result obtained may be unreasonable, for example, query result is not optimal query result, or even may be used also
It can be poor query result, so as to cause the reduction of the reliability of path query operation.
[summary of the invention]
Many aspects of the invention provide a kind of path query method and device, to improve the reliable of path query operation
Property.
An aspect of of the present present invention provides a kind of path query method, comprising:
Inquiry data are obtained, the inquiry data packet includes departure place and destination；
According to the inquiry data, the cluster of the user's history track from the departure place to the destination is obtained
As a result；
Export the cluster result.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, it is described according to institute
Inquiry data are stated, the cluster result of the user's history track from the departure place to the destination is obtained, comprising:
According to the departure place, urban road web area belonging to the departure place is obtained；
According to the destination, urban road web area belonging to the destination is obtained；
According to urban road barrier belonging to urban road web area belonging to the departure place and the destination
Domain obtains the urban road web area belonging to the urban road web area to the destination belonging to the departure place
The cluster result of user's history track, using the cluster as the user's history track from the departure place to the destination
As a result.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the method is also
Include:
With the first appointed interval distance, urban road network is divided, generates several in the urban road network
Urban road web area.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, it is described with first
Appointed interval distance, divides urban road network, generates several urban road web areas in the urban road network
Later, further includes:
According to urban road web area two-by-two generated, the user obtained between the urban road web area two-by-two is gone through
History track；
Clustering processing is carried out to the user's history track between the web area of urban road two-by-two, it is described two-by-two with acquisition
The generation of each track classification at least one track classification and at least one described track classification between urban road web area
Table historical track, the cluster result as the user's history track between the web area of urban road two-by-two.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, it is described to described
The user's history track between urban road web area carries out clustering processing two-by-two, to obtain the urban road web area two-by-two
Between at least one track classification and at least one described track classification in each track classification representative historical track, as
The cluster result of user's history track between the web area of urban road two-by-two, comprising:
For any user historical track between any web area of urban road two-by-two,
If the representative of the user's history track and the already existing track classification between urban road web area two-by-two
Similarity between historical track meets pre-set cluster condition, which is divided into the track classification
In, and the path length of the user's history track and the path length of the representative historical track of the track classification are compared
Compared with representative historical track of the historical track for selecting path length short as the track classification；
If the similarity between the user's history track and the representative historical track of the already existing track classification is not
Meet pre-set cluster condition, which is divided into new track classification, and by the user's history rail
Representative historical track of the mark as the new track classification.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, it is described to described
The user's history track between urban road web area carries out clustering processing two-by-two, to obtain the urban road web area two-by-two
Between at least one track classification and at least one described track classification in each track classification representative historical track, as
The cluster result of user's history track between the web area of urban road two-by-two, further includes:
With the second appointed interval distance, to the affiliated range in user's history track between the web area of urban road two-by-two
It is divided, generates several net regions；The second appointed interval distance is less than the first appointed interval distance；
According to the representative history of net region occupied by the user's history track and the already existing track classification
Net region occupied by track obtains the representative historical track of the user's history track Yu the already existing track classification
The generation of the first quantity of the network area occupied jointly and the user's history track and the already existing track classification
Second quantity of the network area that table historical track occupies in total；
According to first quantity and second quantity, the user's history track and the already existing track are obtained
Similarity between the representative historical track of classification.
Another aspect of the present invention provides a kind of path query device, comprising:
Acquiring unit, for obtaining inquiry data, the inquiry data packet includes departure place and destination；
Query unit, for obtaining the user from the departure place to the destination according to the inquiry data
The cluster result of historical track；
Output unit, for exporting the cluster result.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the cargo tracer
Member is specifically used for
According to the departure place, urban road web area belonging to the departure place is obtained；
According to the destination, urban road web area belonging to the destination is obtained；And
According to urban road barrier belonging to urban road web area belonging to the departure place and the destination
Domain obtains the urban road web area belonging to the urban road web area to the destination belonging to the departure place
The cluster result of user's history track, using the cluster as the user's history track from the departure place to the destination
As a result.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, described device is also
Including division unit, it is used for
With the first appointed interval distance, urban road network is divided, generates several in the urban road network
Urban road web area.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, described device is also
Including processing unit, it is used for
According to urban road web area two-by-two generated, the user obtained between the urban road web area two-by-two is gone through
History track；And
Clustering processing is carried out to the user's history track between the web area of urban road two-by-two, it is described two-by-two with acquisition
The generation of each track classification at least one track classification and at least one described track classification between urban road web area
Table historical track, the cluster result as the user's history track between the web area of urban road two-by-two.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the processing are single
Member is specifically used for
For any user historical track between any web area of urban road two-by-two,
If the representative of the user's history track and the already existing track classification between urban road web area two-by-two
Similarity between historical track meets pre-set cluster condition, which is divided into the track classification
In, and the path length of the user's history track and the path length of the representative historical track of the track classification are compared
Compared with representative historical track of the historical track for selecting path length short as the track classification；
If the similarity between the user's history track and the representative historical track of the already existing track classification is not
Meet pre-set cluster condition, which is divided into new track classification, and by the user's history rail
Representative historical track of the mark as the new track classification.
The aspect and any possible implementation manners as described above, it is further provided a kind of implementation, the processing are single
Member is also used to
With the second appointed interval distance, to the affiliated range in user's history track between the web area of urban road two-by-two
It is divided, generates several net regions；The second appointed interval distance is less than the first appointed interval distance；
According to the representative history of net region occupied by the user's history track and the already existing track classification
Net region occupied by track obtains the representative historical track of the user's history track Yu the already existing track classification
The generation of the first quantity of the network area occupied jointly and the user's history track and the already existing track classification
Second quantity of the network area that table historical track occupies in total；And
According to first quantity and second quantity, the user's history track and the already existing track are obtained
Similarity between the representative historical track of classification.
As shown from the above technical solution, the embodiment of the present invention includes hair by obtaining inquiry data, the inquiry data packet
Place and destination, and then according to the inquiry data, it obtains the user from the departure place to the destination and goes through
The cluster result of history track makes it possible to export the cluster result, due to eliminating the reliance on road weight execution route inquiry behaviour
Make, therefore, can be avoided query result caused by can not timely updating due to the road weight of certain roads in the prior art
Unreasonable problem, to improve the reliability of path query operation.
In addition, using technical solution provided by the present invention, due to using this track big data of user's history track
Execution route inquiry operation makes it possible to find the experience route of user, can provide more reasonable query result, for example,
It was found that new road, hide jam road etc., it being capable of significant increase user experience.
[Detailed description of the invention]
It to describe the technical solutions in the embodiments of the present invention more clearly, below will be to embodiment or description of the prior art
Needed in attached drawing be briefly described, it should be apparent that, the accompanying drawings in the following description is some realities of the invention
Example is applied, it for those of ordinary skill in the art, without any creative labor, can also be attached according to these
Figure obtains other attached drawings.
Fig. 1 is the flow diagram for the path query method that one embodiment of the invention provides；
Fig. 2 be another embodiment of the present invention provides path query device structural schematic diagram；
Fig. 3 be another embodiment of the present invention provides path query device structural schematic diagram；
Fig. 4 be another embodiment of the present invention provides path query device structural schematic diagram.
[specific embodiment]
In order to make the object, technical scheme and advantages of the embodiment of the invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, technical scheme in the embodiment of the invention is clearly and completely described, it is clear that described embodiment is
A part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
Whole other embodiments obtained without creative efforts, shall fall within the protection scope of the present invention.
It should be noted that terminal involved in the embodiment of the present invention can include but is not limited to mobile phone, individual digital
Assistant (Personal Digital Assistant, PDA), radio hand-held equipment, tablet computer (Tablet Computer),
PC (Personal Computer, PC), MP3 player, MP4 player, wearable device (for example, intelligent glasses,
Smartwatch, Intelligent bracelet etc.) etc..
In addition, the terms "and/or", only a kind of incidence relation for describing affiliated partner, indicates may exist
Three kinds of relationships, for example, A and/or B, can indicate: individualism A exists simultaneously A and B, these three situations of individualism B.Separately
Outside, character "/" herein typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Fig. 1 is the flow diagram for the path query method that one embodiment of the invention provides, as shown in Figure 1.
101, inquiry data are obtained, the inquiry data packet includes departure place and destination.
102, according to the inquiry data, the user's history track from the departure place to the destination is obtained
Cluster result.
The so-called user's history track from the departure place to the destination, can refer to the departure place
Point is traveling starting point, and is the user's history track for travelling terminal with the destination, or can also refer to described
Departure place is traveling starting point, and passes over or through the destination and continue the user's history track travelled to other places
Described in track before destination, or can also refer to pass over or through the departure place, and with the purpose
Place is the track travelled after departure place described in the user's history track of terminal, or can also refer to refer to and pass through or lead to
The departure place is crossed, and passes over or through the destination and continues the institute into the user's history track that other places travel
The track between departure place and the destination is stated, the present embodiment is to this without being particularly limited to.So-called user's history
Track, the set being made of several tracing points of user.
103, the cluster result is exported.
It should be noted that some or all of 101~103 executing subject can be to be located locally the application of terminal,
It or can also be the plug-in unit or Software Development Kit (Software being arranged in the application of local terminal
Development Kit, SDK) etc. functional units, perhaps can also in network side server query engine or
It can also be for positioned at the distributed system of network side, the present embodiment be to this without being particularly limited to.
It is understood that the application can be mounted in the local program (nativeApp) in terminal, or may be used also
To be a web page program (webApp) of browser in terminal, the present embodiment is to this without limiting.
In this way, the inquiry data packet includes departure place and destination, and then according to described by obtaining inquiry data
Data are inquired, the cluster result of the user's history track from the departure place to the destination is obtained, makes it possible to defeated
The cluster result out, due to eliminating the reliance on road weight execution route inquiry operation, can be avoided in the prior art by
The unreasonable problem of query result, is looked into improve path caused by the road weight of certain roads can not timely update
Ask the reliability of operation.
Main idea is that: by being based on user's history track, execution route inquiry operation, to provide a user
Experience route, to replace the road weight based on the road in urban road network and the urban road network, execution route inquiry
Operation, to provide a user coupling path.In such manner, it is possible to avoid in the prior art due to the road weight of certain roads can not and
The unreasonable problem of query result caused by Shi Gengxin, to improve the reliability of path query operation.
So-called urban road network (urban road network) refers in city scope by different function, grade, area
The road of position, the network structure formed with certain density and form appropriate.
In general, some path query services can be related in some applications, for example, Baidu map etc..These application first to
User shows path query query interface, so that user inputs, then, then the information that can be inputted according to user, setting
Inquire terminal point information for example, the endpoints such as departure place and destination information, and then request query engine provide path data.
Optionally, in a possible implementation of the present embodiment, in 101, it can specifically acquire user and be mentioned
The searching keyword of confession is referred to as inquiry data.
Specifically, it can be realized by the querying command that user is triggered.It can specifically be triggered using following two ways
Querying command:
Mode one:
The searching keyword that user can input or select on the page that current application is showed, the searching keyword
It may include departure place and destination.It then,, should to trigger querying command by clicking the inquiry button on the page
It include the searching keyword in querying command.In this way, then can be parsed out and wherein wrapped after receiving the querying command
The searching keyword contained.
Mode two:
Using asynchronous loading technique for example, the asynchronous load of Ajax or the asynchronous load of Jsonp etc., obtain user current in real time
Using the input content inputted on the page showed, in order to distinguish with searching keyword, input content at this time can
To be known as input keyword.Then, an input character has been obtained, has included institute in the querying command to trigger querying command
State searching keyword.In this way, then can be parsed out the inquiry key included in it after receiving the querying command
Word.Specifically, the interfaces such as Ajax interface or Jsonp interface can be specifically provided, Java, supertext can be used in these interfaces
The language such as pretreatment (Hypertext Preprocessor, PHP) language are write, and specific call can be used
The language such as Jquery or primary JavaScript are write.
In most cases, the purpose of user query may have random or nonspecific, this will to use
Included departure place and destination may have certain uncertainty in inquiry data provided by family, therefore, can
To carry out extension process appropriate to included departure place in inquiry data and destination, the inquiry starting point that this is inquired
Expand with the range of inquiry terminal, so that inquiry starting point is no longer limited to departure place, inquiry terminal is also no longer limited to mesh
Place.It really goes on a journey intention in this way, it is possible to which query result is made to be more in line with user.
Optionally, in a possible implementation of the present embodiment, it can use going out included by inquiring in data
Urban road web area belonging to place is sent out, to extend the departure place, utilizes destination institute included in inquiry data
The urban road web area of category, to extend the destination, execution route inquiry operation.
So-called urban road network (urban road network) refers in city scope by different function, grade, area
The road of position, the network structure formed with certain density and form appropriate.
In the implementation, so-called urban road web area refers to the specified region in urban road network.These are specified
Region, can be for based on urban road network, several regions in the urban road network of random division, or can also for
First appointed interval distance, divides urban road network, generates several urban road networks in the urban road network
Region, the present embodiment is to this without being particularly limited to.
During a concrete implementation, in 102, can be specifically set out described in acquisition according to the departure place
Urban road web area belonging to place obtains urban road barrier belonging to the destination according to the destination
Domain.Then, urban road barrier belonging to urban road web area and the destination according to belonging to the departure place
Domain obtains the urban road web area belonging to the urban road web area to the destination belonging to the departure place
The cluster result of user's history track, using the cluster as the user's history track from the departure place to the destination
As a result.In this way, the range of inquiry starting point and inquiry terminal due to inquiring this expands, so that inquiry starting point is no longer limited to
In destination, inquires terminal and be also no longer limited to destination, therefore, more user's history tracks can be obtained, as
Path query operates foundation, to more enrich the data source of path query operation foundation.
Optionally, several in the urban road network generating in a possible implementation of the present embodiment
, can also be further according to urban road web area two-by-two generated after a urban road web area, acquisition is described two-by-two
It user's history track between urban road web area in turn then can be to the use between the web area of urban road two-by-two
Family historical track carries out clustering processing, to obtain at least one track classification and the institute between the urban road web area two-by-two
The representative historical track for stating each track classification at least one track classification, as between the web area of urban road two-by-two
User's history track cluster result.
In this embodiment, the user's history track between urban road web area two-by-two, i.e., from a urban road
Web area can form an individual independent road network to the user's history track of another urban road web area, should
In independent road network, every user's history track can be from a urban road web area to another urban road
The user's history track of web area.
In order to improve path query operation efficiency, can use the independent road network to these user's history tracks into
Line index.In this way, according to certain urban road web area two-by-two, the user's history between urban road web area two-by-two is inquired
It when track, is directly inquired according to index, the efficiency of path query operation can be effectively improved.
It in this embodiment, specifically can with the following method, to the use between any web area of urban road two-by-two
Family historical track carries out clustering processing.
For any user historical track between any web area of urban road two-by-two, if the user's history track with should
The similarity between the representative historical track of the already existing track classification between urban road web area meets preparatory two-by-two
The user's history track is divided into the track classification by the cluster condition of setting, and by the track of the user's history track
Length is compared with the path length of the representative historical track of the track classification, and the historical track for selecting path length short is made
For the representative historical track of the track classification；If the user's history track and the representative of the already existing track classification are gone through
Similarity between history track is unsatisfactory for pre-set cluster condition, which is divided into new track classification
In, and using the user's history track as the representative historical track of the new track classification.
Specifically, a user's history track and already existing track classification can be specifically calculated with the following method
Represent the similarity between historical track.
It specifically, specifically can be with the second appointed interval distance, to the user between the web area of urban road two-by-two
The affiliated range of historical track is divided, several net regions are generated.Wherein, the second appointed interval distance is less than described
First appointed interval distance, that is to say, that many small grid regions have been divided in urban road web area.Then, according to this
Net occupied by the representative historical track of net region occupied by user's history track and the already existing track classification
Lattice region obtains the net that the representative historical track of the user's history track and the already existing track classification occupies jointly
The representative historical track institute of first quantity in network region and the user's history track and the already existing track classification is total
Second quantity of the network area occupied altogether.In this way, then the use can be obtained according to first quantity and second quantity
Similarity between family historical track and the representative historical track of the already existing track classification.
The meaning of so-called " user's history track occupies a net region ", does not imply that the user's history track is complete
Cover the network area, as long as but there are any tracing points in some user's history track in the net region, so that it may
Referred to as the user's history track occupies the net region.
Optionally, in a possible implementation of the present embodiment, in 103, various ways can specifically be used
Cluster result obtained is exported, the present embodiment is to this without being particularly limited to.
During a concrete implementation, directly cluster result obtained can be exported, that is, export a series of rails
Mark point.
It, can will be in the representative historical track of track each in cluster result classification during another concrete implementation
Adjacent tracing point connects to form an experience route using straight line, and the experience route is presented to user.
During another concrete implementation, difference arithmetic can use, to track each in cluster result classification
The tracing point represented in historical track carries out difference processing, forms an experience route, and the experience route is presented to user.
In the present embodiment, data are inquired by obtaining, the inquiry data packet includes departure place and destination, Jin Ergen
According to the inquiry data, the cluster result of the user's history track from the departure place to the destination is obtained, so that
The cluster result can be exported, due to eliminating the reliance on road weight execution route inquiry operation, can be avoided existing skill
The unreasonable problem of query result caused by road weight in art due to certain roads can not timely update, to improve
The reliability of path query operation.
In addition, using technical solution provided by the present invention, due to using this track big data of user's history track
Execution route inquiry operation makes it possible to find the experience route of user, can provide more reasonable query result, for example,
It was found that new road, hide jam road etc., it being capable of significant increase user experience.
It should be noted that for the various method embodiments described above, for simple description, therefore, it is stated as a series of
Combination of actions, but those skilled in the art should understand that, the present invention is not limited by the sequence of acts described because
According to the present invention, some steps may be performed in other sequences or simultaneously.Secondly, those skilled in the art should also know
It knows, the embodiments described in the specification are all preferred embodiments, and related actions and modules is not necessarily of the invention
It is necessary.
In the above-described embodiments, it all emphasizes particularly on different fields to the description of each embodiment, there is no the portion being described in detail in some embodiment
Point, reference can be made to the related descriptions of other embodiments.
Fig. 2 be another embodiment of the present invention provides path query device structural schematic diagram, as shown in Figure 2.This implementation
The path query device of example may include acquiring unit 21, query unit 22 and output unit 23.Wherein, acquiring unit 21 are used
Data are inquired in obtaining, the inquiry data packet includes departure place and destination；Query unit 22, for according to the inquiry
Data obtain the cluster result of the user's history track from the departure place to the destination；Output unit 23, is used for
Export the cluster result.
It should be noted that some or all of path query device provided by the present embodiment can be to be located locally end
The application at end, or can also be the plug-in unit being arranged in the application of local terminal or Software Development Kit
Functional units such as (Software Development Kit, SDK), or can also be the inquiry in network side server
Engine, or can also be for positioned at the distributed system of network side, the present embodiment is to this without being particularly limited to.
It is understood that the application can be mounted in the local program (nativeApp) in terminal, or may be used also
To be a web page program (webApp) of browser in terminal, the present embodiment is to this without limiting.
Optionally, in a possible implementation of the present embodiment, the query unit 22 specifically can be used for root
According to the departure place, urban road web area belonging to the departure place is obtained；According to the destination, described in acquisition
Urban road web area belonging to destination；And urban road web area and the mesh according to belonging to the departure place
Place belonging to urban road web area, obtain from urban road web area belonging to the departure place to the destination
The cluster result of the user's history track of urban road web area belonging to point, as from the departure place to the purpose
The cluster result of the user's history track in place.
Optionally, in a possible implementation of the present embodiment, as shown in figure 3, the path query of the present embodiment
Device can further include division unit 31, can be used for drawing urban road network with the first appointed interval distance
Point, generate several urban road web areas in the urban road network.
Optionally, in a possible implementation of the present embodiment, as shown in figure 4, the path query of the present embodiment
Device can further include processing unit 41, can be used for obtaining institute according to urban road web area two-by-two generated
State the user's history track between urban road web area two-by-two；And to the user between the web area of urban road two-by-two
Historical track carries out clustering processing, to obtain at least one track classification between the urban road web area two-by-two and described
The representative historical track of each track classification at least one track classification, as between the web area of urban road two-by-two
The cluster result of user's history track.
Specifically, the processing unit 41 specifically can be used for for appointing between any web area of urban road two-by-two
One user's history track, if the user's history track and the already existing track classification between urban road web area two-by-two
Representative historical track between similarity meet pre-set cluster condition, which is divided into the rail
In mark classification, and by the path length of the path length of the user's history track and the representative historical track of the track classification into
Row compares, representative historical track of the historical track for selecting path length short as the track classification；If the user's history rail
Similarity between mark and the representative historical track of the already existing track classification is unsatisfactory for pre-set cluster condition,
The user's history track is divided into new track classification, and using the user's history track as the new track classification
Represent historical track.
Further, the processing unit 41, can also be further used for the second appointed interval distance, to it is described two-by-two
The affiliated range in user's history track between urban road web area is divided, several net regions are generated；Described second
Appointed interval distance is less than the first appointed interval distance；According to net region occupied by the user's history track and described
Net region occupied by the representative historical track of already existing track classification, obtain the user's history track and it is described
First quantity of the network area that the representative historical track of existing track classification occupies jointly and the user's history track
Second quantity of the network area occupied in total with the representative historical track of the already existing track classification；And according to
First quantity and second quantity, obtain the user's history track and the representative of the already existing track classification is gone through
Similarity between history track.
It should be noted that method in the corresponding embodiment of Fig. 1, it can be real by path query device provided in this embodiment
It is existing.Detailed description may refer to the related content in the corresponding embodiment of Fig. 1, and details are not described herein again.
In the present embodiment, inquiry data are obtained by acquiring unit, the inquiry data packet includes departure place and destination
Point, and then the user's history from the departure place to the destination is obtained according to the inquiry data by query unit
The cluster result of track enables output unit to export the cluster result, due to eliminating the reliance on road weight execution route
Therefore inquiry operation can be avoided and look into caused by can not being timely updated due to the road weight of certain roads in the prior art
The unreasonable problem of result is ask, to improve the reliability of path query operation.
In addition, using technical solution provided by the present invention, due to using this track big data of user's history track
Execution route inquiry operation makes it possible to find the experience route of user, can provide more reasonable query result, for example,
It was found that new road, hide jam road etc., it being capable of significant increase user experience.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, can refer to corresponding processes in the foregoing method embodiment, and details are not described herein.
In several embodiments provided by the present invention, it should be understood that disclosed system, device and method can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.Another point, it is shown or
The mutual coupling, direct-coupling or communication connection discussed can be through some interfaces, the indirect coupling of device or unit
It closes or communicates to connect, can be electrical property, mechanical or other forms.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.It can select some or all of unit therein according to the actual needs to realize the mesh of this embodiment scheme
's.
It, can also be in addition, the functional units in various embodiments of the present invention may be integrated into one processing unit
It is that each unit physically exists alone, can also be integrated in one unit with two or more units.Above-mentioned integrated list
Member both can take the form of hardware realization, can also realize in the form of hardware adds SFU software functional unit.
The above-mentioned integrated unit being realized in the form of SFU software functional unit can store and computer-readable deposit at one
In storage media.Above-mentioned SFU software functional unit is stored in a storage medium, including some instructions are used so that a computer
It is each that device (can be personal computer, server or network equipment etc.) or processor (processor) execute the present invention
The part steps of embodiment the method.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (Read-
Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic or disk etc. it is various
It can store the medium of program code.
Finally, it should be noted that the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although
Present invention has been described in detail with reference to the aforementioned embodiments, those skilled in the art should understand that: it still may be used
To modify the technical solutions described in the foregoing embodiments or equivalent replacement of some of the technical features；
And these are modified or replaceed, technical solution of various embodiments of the present invention that it does not separate the essence of the corresponding technical solution spirit and
Range.
Claims (10)
1. a kind of path query method characterized by comprising
Inquiry data are obtained, the inquiry data packet includes departure place and destination；
According to the inquiry data, the cluster knot of the user's history track from the departure place to the destination is obtained
Fruit；
Export the cluster result；Wherein,
It is described according to the inquiry data, obtain the cluster of the user's history track from the departure place to the destination
As a result, comprising:
According to the departure place, urban road web area belonging to the departure place is obtained；
According to the destination, urban road web area belonging to the destination is obtained；
According to urban road web area belonging to urban road web area belonging to the departure place and the destination, obtain
It must be from the user of urban road web area belonging to urban road web area to the destination belonging to the departure place
The cluster result of historical track, using the cluster knot as the user's history track from the departure place to the destination
Fruit.
2. the method according to claim 1, wherein the method also includes:
With the first appointed interval distance, urban road network is divided, generates several cities in the urban road network
Road web area.
3. according to the method described in claim 2, it is characterized in that, described with the first appointed interval distance, to urban road network
It is divided, after generating several urban road web areas in the urban road network, further includes:
According to urban road web area two-by-two generated, the user's history rail between the urban road web area two-by-two is obtained
Mark；
Clustering processing is carried out to the user's history track between the web area of urban road two-by-two, to obtain the city two-by-two
The representative of each track classification is gone through at least one track classification and at least one described track classification between road web area
History track, the cluster result as the user's history track between the web area of urban road two-by-two.
4. according to the method described in claim 3, it is characterized in that, the use between the web area of urban road two-by-two
Family historical track carries out clustering processing, to obtain at least one track classification and the institute between the urban road web area two-by-two
The representative historical track for stating each track classification at least one track classification, as between the web area of urban road two-by-two
User's history track cluster result, comprising:
For any user historical track between any web area of urban road two-by-two,
If the representative history of the user's history track and the already existing track classification between urban road web area two-by-two
Similarity between track meets pre-set cluster condition, which is divided into the track classification,
And be compared the path length of the user's history track with the path length of the representative historical track of the track classification, it selects
Select representative historical track of the short historical track of path length as the track classification；
If the similarity between the user's history track and the representative historical track of the already existing track classification is unsatisfactory for
The user's history track is divided into new track classification by pre-set cluster condition, and the user's history track is made
For the representative historical track of the new track classification.
5. according to the method described in claim 4, it is characterized in that, the use between the web area of urban road two-by-two
Family historical track carries out clustering processing, to obtain at least one track classification and the institute between the urban road web area two-by-two
The representative historical track for stating each track classification at least one track classification, as between the web area of urban road two-by-two
User's history track cluster result, further includes:
With the second appointed interval distance, the affiliated range in user's history track between the web area of urban road two-by-two is carried out
It divides, generates several net regions；The second appointed interval distance is less than the first appointed interval distance；
According to the representative historical track of net region occupied by the user's history track and the already existing track classification
Occupied net region, the representative historical track for obtaining the user's history track and the already existing track classification are total to
It is gone through with the first quantity of the network area occupied and the user's history track and the representative of the already existing track classification
Second quantity of the network area that history track occupies in total；
According to first quantity and second quantity, the user's history track and the already existing track classification are obtained
Representative historical track between similarity.
6. a kind of path query device characterized by comprising
Acquiring unit, for obtaining inquiry data, the inquiry data packet includes departure place and destination；
Query unit, for obtaining the user's history from the departure place to the destination according to the inquiry data
The cluster result of track；
Output unit, for exporting the cluster result；Wherein,
The query unit, is specifically used for
According to the departure place, urban road web area belonging to the departure place is obtained；
According to the destination, urban road web area belonging to the destination is obtained；And
According to urban road web area belonging to urban road web area belonging to the departure place and the destination, obtain
It must be from the user of urban road web area belonging to urban road web area to the destination belonging to the departure place
The cluster result of historical track, using the cluster knot as the user's history track from the departure place to the destination
Fruit.
7. device according to claim 6, which is characterized in that described device further includes division unit, is used for
With the first appointed interval distance, urban road network is divided, generates several cities in the urban road network
Road web area.
8. device according to claim 7, which is characterized in that described device further includes processing unit, is used for
According to urban road web area two-by-two generated, the user's history rail between the urban road web area two-by-two is obtained
Mark；And
Clustering processing is carried out to the user's history track between the web area of urban road two-by-two, to obtain the city two-by-two
The representative of each track classification is gone through at least one track classification and at least one described track classification between road web area
History track, the cluster result as the user's history track between the web area of urban road two-by-two.
9. device according to claim 8, which is characterized in that the processing unit is specifically used for for any city two-by-two
Any user historical track between city's road web area,
If the representative history of the user's history track and the already existing track classification between urban road web area two-by-two
Similarity between track meets pre-set cluster condition, which is divided into the track classification,
And be compared the path length of the user's history track with the path length of the representative historical track of the track classification, it selects
Select representative historical track of the short historical track of path length as the track classification；
If the similarity between the user's history track and the representative historical track of the already existing track classification is unsatisfactory for
The user's history track is divided into new track classification by pre-set cluster condition, and the user's history track is made
For the representative historical track of the new track classification.
10. device according to claim 9, which is characterized in that the processing unit, be also used to the second appointed interval away from
From being divided to the affiliated range in user's history track between the web area of urban road two-by-two, generate several grids
Region；The second appointed interval distance is less than the first appointed interval distance；
According to the representative historical track of net region occupied by the user's history track and the already existing track classification
Occupied net region, the representative historical track for obtaining the user's history track and the already existing track classification are total to
It is gone through with the first quantity of the network area occupied and the user's history track and the representative of the already existing track classification
Second quantity of the network area that history track occupies in total；And
According to first quantity and second quantity, the user's history track and the already existing track classification are obtained
Representative historical track between similarity.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510639696.7A CN105243131B (en) | 2015-09-30 | 2015-09-30 | Path query method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510639696.7A CN105243131B (en) | 2015-09-30 | 2015-09-30 | Path query method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105243131A CN105243131A (en) | 2016-01-13 |
| CN105243131B true CN105243131B (en) | 2019-04-30 |
Family
ID=55040779
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510639696.7A Active CN105243131B (en) | 2015-09-30 | 2015-09-30 | Path query method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105243131B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107545318B (en) * | 2016-06-28 | 2021-08-17 | 阿里巴巴（中国）有限公司 | Bus line priority determination and bus transfer line sequencing method and device |
| CN109781123B (en) * | 2017-11-10 | 2022-06-24 | 腾讯科技（深圳）有限公司 | Navigation method, device and system |
| CN112116805B (en) * | 2019-06-21 | 2022-04-05 | 杭州海康威视系统技术有限公司 | Method and device for determining specified driving route |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101226687A (en) * | 2008-01-31 | 2008-07-23 | 浙江工业大学 | Method for analysis of prototype run route in urban traffic |
| CN102840867A (en) * | 2011-06-21 | 2012-12-26 | 歌乐株式会社 | Route searching system and method based on commonly used route |
| CN103217166A (en) * | 2012-01-21 | 2013-07-24 | 日电（中国）有限公司 | Method and system used for extracting route choice preference of users |
| CN103323018A (en) * | 2013-06-21 | 2013-09-25 | 广州市香港科大霍英东研究院 | Time-interval-based feature identification and fast search method for hotspot path |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140222330A1 (en) * | 2011-12-27 | 2014-08-07 | Tobias M. Kohlenberg | Integration of contextual and historical data into route determination |
-
2015
- 2015-09-30 CN CN201510639696.7A patent/CN105243131B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101226687A (en) * | 2008-01-31 | 2008-07-23 | 浙江工业大学 | Method for analysis of prototype run route in urban traffic |
| CN102840867A (en) * | 2011-06-21 | 2012-12-26 | 歌乐株式会社 | Route searching system and method based on commonly used route |
| CN103217166A (en) * | 2012-01-21 | 2013-07-24 | 日电（中国）有限公司 | Method and system used for extracting route choice preference of users |
| CN103323018A (en) * | 2013-06-21 | 2013-09-25 | 广州市香港科大霍英东研究院 | Time-interval-based feature identification and fast search method for hotspot path |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105243131A (en) | 2016-01-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112766607B (en) | Travel route recommendation method and device, electronic device and readable storage medium | |
| Yang et al. | Stochastic skyline route planning under time-varying uncertainty | |
| CN104596531B (en) | A kind of generation method of navigation routine, device and server | |
| CN106528589B (en) | Data managing method and device | |
| EP3358474B1 (en) | Route search method, device and apparatus, and non-volatile computer storage medium | |
| CN104537070B (en) | The method and apparatus for excavating tourist famous-city sight spot | |
| Tang et al. | A network Kernel Density Estimation for linear features in space–time analysis of big trace data | |
| CN105243131B (en) | Path query method and device | |
| CN105043400A (en) | Route planning method and device | |
| CN108228887A (en) | For generating the method and apparatus of information | |
| CN112665601A (en) | Path planning method and device, electronic equipment and readable storage medium | |
| CN103365886A (en) | Method for querying space events in internet of vehicles and optimizing querier | |
| CN108627164A (en) | A kind of route planning method and device | |
| JP2019511719A (en) | Navigation method based on map, device, storage medium and device | |
| CN110095134A (en) | It is a kind of using the preference of user as the method and system of the path planning of core and navigation | |
| CN112988936A (en) | Travel track prediction method and device, computing equipment and storage medium | |
| Bahuleyan et al. | Arterial path-level travel-time estimation using machine-learning techniques | |
| CN103197857A (en) | Method, equipment and system for realizing route inquiry | |
| CN107526815A (en) | The determination method and electronic equipment of Move Mode in the range of target area | |
| CN110516017A (en) | Location information processing method, device, electronic equipment and storage medium based on terminal device | |
| CN108140027A (en) | For the accessing points of map | |
| CN105160026B (en) | Path query method and device | |
| CN109558961A (en) | Determine method and system, storage medium, processor and the device of location information | |
| CN107958303A (en) | A kind of congestion propagation data generation method and device, congestion propagation prediction method and system | |
| Belcastro et al. | Evaluation of large scale roi mining applications in edge computing environments |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |