CN107203823A - A kind of user rides address method of adjustment and device - Google Patents

A kind of user rides address method of adjustment and device Download PDF

Info

Publication number
CN107203823A
CN107203823A CN201610150555.3A CN201610150555A CN107203823A CN 107203823 A CN107203823 A CN 107203823A CN 201610150555 A CN201610150555 A CN 201610150555A CN 107203823 A CN107203823 A CN 107203823A
Authority
CN
China
Prior art keywords
candidate site
address
bus
deviation
editor
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.)
Granted
Application number
CN201610150555.3A
Other languages
Chinese (zh)
Other versions
CN107203823B (en
Inventor
张凌宇
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Didi Infinity Technology and Development Co Ltd
Original Assignee
Didi (china) Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Priority to CN201610150555.3A priority Critical patent/CN107203823B/en
Application filed by Didi (china) Technology Co Ltd filed Critical Didi (china) Technology Co Ltd
Priority to AU2016397278A priority patent/AU2016397278B2/en
Priority to JP2018502643A priority patent/JP2018537739A/en
Priority to EP16894237.3A priority patent/EP3311554B1/en
Priority to CN201680083007.1A priority patent/CN108702382A/en
Priority to PCT/CN2016/112783 priority patent/WO2017157078A1/en
Priority to GB1800680.9A priority patent/GB2557749A/en
Publication of CN107203823A publication Critical patent/CN107203823A/en
Priority to US15/873,433 priority patent/US10527446B2/en
Priority to US16/516,318 priority patent/US11193786B2/en
Priority to JP2020085187A priority patent/JP2020129003A/en
Application granted granted Critical
Publication of CN107203823B publication Critical patent/CN107203823B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00Administration; Management
    • G06Q10/04Forecasting or optimisation specially adapted for administrative or management purposes, e.g. linear programming or "cutting stock problem"
    • G06Q10/047Optimisation of routes or paths, e.g. travelling salesman problem
    • G06Q50/40

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Engineering & Computer Science (AREA)
  • Strategic Management (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Development Economics (AREA)
  • Operations Research (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Document Processing Apparatus (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

Address method of adjustment and device this disclosure relates to which a kind of user rides.Methods described includes:Obtain the address information by bus of user;Editor's deviation of each candidate site in the address information by bus and database is calculated, to obtain editor's less top n candidate site of deviation;N is positive integer;The address information by bus and Euler's distance of the top n candidate site are calculated, to obtain the M candidate site that Euler's distance is less than preset value;M is positive integer and is less than N;Calculate the M candidate site longitude and latitude and apart from the M candidate site center pre-determined distance any point longitude and latitude.The present apparatus and system are ridden address method of adjustment realization based on above-mentioned user.The embodiment of the present disclosure can improve service provider services' efficiency, improve user's chauffeur experience.

Description

A kind of user rides address method of adjustment and device
Technical field
This disclosure relates to computer processing technology field, and in particular to a kind of user ride address tune Adjusting method and device.
Background technology
At present, user is when using transport class software chauffeur, and the transport class software can will be manual defeated The address by bus entered is sent to server, and then server is sent to clothes according to above-mentioned address by bus Be engaged in supplier.But it is due to that address above mentioned there may be deviation, causes in ISP's arrival Being presently in position with user when stating address by bus has a certain distance, even results in service and provides Person can not find user, so as to reduce the efficiency of service of ISP and the body by bus of user Test.
The content of the invention
For defect of the prior art, the embodiment of the present disclosure provide a kind of diagram bootstrap technique, Apparatus and system, is changed unintentionally when can solve to be consulted a map due to user in the prior art The problem of starting point influences user and the chauffeur experience of ISP and efficiency of service.
In a first aspect, being ridden address method of adjustment, methods described present disclose provides a kind of user Including:
Obtain the address information by bus of user;
Editor's deviation of each candidate site in the address information by bus and database is calculated, with Obtain editor's less top n candidate site of deviation;N is positive integer;
The address information by bus and Euler's distance of the top n candidate site are calculated, to obtain Euler's distance is taken to be less than M candidate site of preset value;M is positive integer and is less than N;
Calculate the longitude and latitude of the M candidate site and in the M candidate site The longitude and latitude at any point of heart position pre-determined distance.
Alternatively, address information of being ridden described in the calculating and each candidate site in database Editor's deviation is obtained using nearest neighbor algorithm KNN in the step of editing deviation.
Alternatively, the step of nearest neighbor algorithm KNN obtains editor's deviation includes:
S21, take out a candidate site successively from the database;
In each word and the address by bus that are taken out successively in candidate site described in S22, comparison Each word;
If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being last word in the address by bus, terminate this Comparison procedure;
S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
Alternatively, to obtain accurately editor's deviation, the nearest neighbor algorithm also needs to meet following Condition includes:
When the address of riding is identical with the candidate site, editor's deviation is 0;
When input is address and the candidate site, or the candidate site and institute by bus When stating address by bus, gained editor's deviation is compared twice identical;
When input is one in null value and the address by bus or the candidate site, the volume It is the length of one in the address by bus or described candidate site to collect deviation.
Alternatively, obtained using arithmetic mean method apart from the center of the M candidate site The longitude and latitude at any point of pre-determined distance.
Second aspect, the embodiment of the present disclosure additionally provides a kind of user and ridden address adjusting apparatus, Described device includes:
Address information acquisition module by bus, the address information by bus for obtaining user;
Deviation computing module is edited, it is each in the address information by bus and database for calculating Editor's deviation of candidate site, to obtain editor's less top n candidate site of deviation; N is positive integer;
Euler's distance calculation module, is waited for calculating the address information by bus with the top n Euler's distance of selection of land location, to obtain the M candidate site that Euler's distance is less than preset value; M is positive integer and is less than N;
Center computing module, for calculate the M candidate site longitude and latitude and away from From the longitude and latitude at any point of the center pre-determined distance of the M candidate site.
Alternatively, editor's deviation computing module obtains the editor using nearest neighbor algorithm KNN Deviation.
Alternatively, editor's deviation computing module passes through following steps using nearest neighbor algorithm KNN Obtain editor's deviation:
S21, take out a candidate site successively from the database;
In each word and the address by bus that are taken out successively in candidate site described in S22, comparison Each word;
If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being last word in the address by bus, terminate this Comparison procedure;
S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
Alternatively, editor's deviation computing module is used to meet following bar when obtaining editor's deviation Part includes:
When the address of riding is identical with the candidate site, editor's deviation is 0;
When input is address and the candidate site, or the candidate site and institute by bus When stating address by bus, gained editor's deviation is compared twice identical;
When input is one in null value and the address by bus or the candidate site, the volume It is the length of one in the address by bus or described candidate site to collect deviation.
Alternatively, the center computing module is obtained apart from the M using arithmetic mean method The longitude and latitude at any point of the center pre-determined distance of individual candidate site.
As shown from the above technical solution, the disclosure can be inputted to user address and data by bus Candidate site in storehouse is matched, and then calculates the Europe of satisfactory top n candidate site Distance is drawn, the intermediate address that Euler's distance is less than M candidate site of pre-determined distance is finally obtained Longitude and latitude there is provided to driver.Can be most by the processing of address progress by bus inputted to user The reduction driver place of arrival of big degree rides the distance between address, to improve driver's with user Efficiency of service and the experience by bus of user.
Brief description of the drawings
The feature and advantage of the disclosure can be more clearly understood from by reference to accompanying drawing, accompanying drawing is to show Meaning property and should not be construed as carrying out the disclosure any limitation, in the accompanying drawings:
Fig. 1 is that a kind of user that the embodiment of the disclosure one is provided rides address method of adjustment flow chart element Figure;
Fig. 2 is that a kind of user that another embodiment of the disclosure is provided rides address adjusting apparatus block diagram.
Embodiment
, below will knot to make the purpose, technical scheme and advantage of the embodiment of the present disclosure clearer The accompanying drawing in the embodiment of the present disclosure is closed, clear to the technical scheme progress in the embodiment of the present disclosure, It is fully described by, it is clear that described embodiment is a part of embodiment of the disclosure, rather than Whole embodiments.Based on the embodiment in the disclosure, those of ordinary skill in the art are not having The every other embodiment obtained under the premise of creative work is made, disclosure protection is belonged to Scope.
It should be understood that, although hereinafter mainly for car application of calling a taxi/use, but the reality of the disclosure Apply example and be not limited to this, it could be applicable to other vehicles (such as, non-motor vehicle, privates Family's car, ship, aircraft etc.) the prompting of spelling list, especially it is following occur it is domestic or commercial Object is transported described in the vehicles and is also not limited to user, also may include that express mail, canteen etc. are needed Transport/transport thing.
In a first aspect, the embodiment of the present disclosure is ridden address method of adjustment there is provided a kind of user, such as Shown in Fig. 1, methods described includes:
S1, the address information by bus for obtaining user.
Server is obtained rides address information from user.In practical application, have many consumers happiness Vigorously it is manually entered address information by bus.Above-mentioned address information by bus at least wishes to get on the bus including user Geographical position.Above-mentioned address information by bus exists in a text form.Also there is user's choosing Select by bus address letter of the reconvert into textual form after the input of the multi-forms such as picture or audio Breath.
S2, the editor's deviation for calculating each candidate site in the address information by bus and database, To obtain editor's less top n candidate site of deviation.
Server obtains candidate site after above-mentioned address information by bus is obtained from database, Calculate above-mentioned address information by bus and editor's deviation (Edit distance) of acquired candidate site. It should be noted that above-mentioned editor's deviation is used for describing above-mentioned address information and candidate site by bus Difference condition.Preferably, described compile is obtained using nearest neighbor algorithm KNN in the embodiment of the present disclosure Collect deviation.Nearest neighbor algorithm KNN obtains ride address information and each candidate site in database Editor's deviation include:
S21, take out a candidate site successively from database;
S22, compare each word for being taken out successively in candidate site and each text in address by bus Word;
If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being by bus last word in address, terminate this and compare Process;
S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
It should be noted that be continually changing in the embodiment of the present disclosure in database, can be with people Work adds candidate site, the address information by bus acquired in this can also be added into database In, so that abundant database, to reduce editor's deviation.
In practical application, the address information by bus of user's input is possible to as ineffective law, rule, etc. sheet, or number It is space-time to complete a candidate site finally gathering according to matching in storehouse, i.e., ought input for null value with When one in the address by bus or the candidate site, editor's deviation is the address by bus Or the length of one in the candidate site.That is F (0, A)=F (A, 0)=len (A), Wherein, len (A) is the length function for obtaining text A.
When the address information of riding that user inputs is identical with the candidate site in database, now It is 0, i.e. F (A, A)=F (B, B)=0 to edit deviation.
In practical application, when some in the address information A and database by bus that user inputs Candidate site B is calculated;Another user can input by bus address information B (with data Candidate site B in storehouse is identical, therefore is replaced with B), and candidate site A in database (with The address information A by bus of first user's input is identical, therefore is replaced with A), both feelings Editor's deviation obtained by shape is identical, i.e. F (B, A)=F (A, B).
When the candidate site in the address information and database by bus that user inputs does not occur above-mentioned feelings During condition, then both editor's deviations are obtained using below equation:
F (A, B)=min { F (A-1, B), F (A, B-1), F (A-1, B-1) }.
According to described above, if address information is identical with candidate site by bus, editor is inclined Difference is 0, for example, address information is " building of Chaoyang District, Beijing City seven-star garden the 22nd ", candidate by bus Address is " building of Chaoyang District, Beijing City seven-star garden the 22nd ", then both editor's deviations are 0.And for example, Address information is " building of Chaoyang District, Beijing City seven-star garden the 22nd " by bus, and candidate site is " Beijing City Chaoyang District seven-star garden cell supermarket ", then both editor's deviations are 4.
Using editor's deviation acquisition methods described above in the embodiment of the present disclosure, when institute in database Some candidate sites are all calculated after completion, and editor's deviation corresponding to all candidate sites is entered Row sequence, for example, being ranked up according to the order of editor's deviation from small to large, N before then choosing Individual editor's less candidate site of deviation.Wherein, N is the positive integer more than 1.
It should be noted that being described in the embodiment of the present disclosure in address information by bus and database The process that calculates successively of all candidate sites.In practical application, the embodiment of the present disclosure can also Using the computational methods similar to pointer form, for example, address information is " court of Beijing by bus Positive No. 22 building in area's seven-star garden ", when first word of acquisition is " north ", only by database In comprising " north " candidate site selection;When it is " capital " to obtain second word, from bag Include to screen again in the candidate site in " north " and include the candidate site in " capital ", the like, The speed for calculating editor's deviation can so be improved.
Selected every time from address information by bus it should be noted that being described in the embodiment of the present disclosure Take the cutting word mode of a word.Certainly, other cutting words can also be used in the embodiment of the present disclosure Mode, for example, address information is " building of Chaoyang District, Beijing City seven-star garden the 22nd " by bus, can be with It is divided into " Beijing " " Chaoyang District " " seven " " star " " garden " " 22 " " number building ", or " Beijing City Chaoyang District " " seven-star garden " " No. 22 building " etc., it is above-mentioned to make sure to keep in mind mode and can be used for calculating every Editor's deviation of individual candidate site and by bus address information, is not described in detail herein.
Obtained it should also be noted that, being described in the embodiment of the present disclosure using nearest neighbor algorithm KNN Deviation is edited, the disclosure can also can also be according to address by bus using such as K-means algorithms Information is classified to the candidate site in database, and the top n for then obtaining relevant classification is waited Selection of land location.Those skilled in the art can select and nearest neighbor algorithm KNN or K-means algorithm Other algorithms with identical function realize the function of selection candidate site, and the disclosure is not construed as limiting.
S3, the calculating address information by bus and Euler's distance of the top n candidate site, To obtain the M candidate site that Euler's distance is less than preset value.
After top n candidate site is obtained, the embodiment of the present disclosure is also needed to calculating each candidate Location and the Euler's distance for the address information that should ride.Each candidate site is obtained in the embodiment of the present disclosure Longitude and latitude, then the longitude and latitude with address information by bus compared, utilize longitude difference and latitude Difference obtains Euler's distance.For example, address information longitude and latitude is (x1, y1), candidate site by bus Longitude and latitude is (x2, y2), then Euler between the two is apart from L:
According to corresponding to top n candidate site Euler distance after be ranked up, choose Euler away from From less preceding M candidate site.Wherein M is less than N, and is positive integer.
S4, the longitude and latitude for calculating the M candidate site and apart from the M candidate site Center pre-determined distance any point longitude and latitude.
Before the disclosure is obtained after M candidate site, the M candidate site has met use in fact The situation of chauffeur is asked at family, i.e., any one in M candidate site is sent into service provides After the terminal of person, the ISP can be quickly found out user.To make ISP quick User is found to ensure in service quality, the embodiment of the present disclosure, using arithmetic average method, root The longitude and latitude of their center is obtained according to the longitude and latitude degree of above-mentioned M candidate site.
In practical application, above-mentioned center is likely to be packaging area, building or service and carried The not accessible region of donor, therefore, the embodiment of the present disclosure is also repaiied to above-mentioned center Just.When ISP can not enter center, in the pre-determined distance of the center A point is randomly selected, the longitude and latitude of the point is sent to ISP.
It should be noted that above-mentioned pre-determined distance can be 100 meters, 50 meters etc..To obtain more Good experience effect, those skilled in the art can rationally be set according to specific usage scenario Put, the disclosure is not construed as limiting.
Disclosure above-described embodiment is described to the treated of the address information by bus of textual form Journey, it is known that, the address letter by bus for the speech form that disclosed method can also be inputted to user Breath is handled, and segmentation is carried out to voice and forms the sound bite for only including a word, then Matched with database (now what database included is the candidate site of speech form).Below Method it is identical, will not be repeated here.Those skilled in the art can be according to specifically using field Scape, selects the forms such as text, voice or picture to carry out address adjustment of riding, and the present invention does not make Limit.
Second aspect, the embodiment of the present disclosure additionally provides a kind of user and ridden address adjusting apparatus, As shown in Fig. 2 described device includes:
Address information acquisition module M1 by bus, the address information by bus for obtaining user;
Deviation computing module M2 is edited, it is every in the address information by bus and database for calculating Editor's deviation of individual candidate site, to obtain editor's less top n candidate site of deviation; N is positive integer;
Euler distance calculation module M3, for calculating the address information by bus and the preceding N Euler's distance of individual candidate site, to obtain the M candidate that Euler's distance is less than preset value Address;M is positive integer and is less than N;
Center computing module M4, for calculate the longitude and latitude of the M candidate site with And apart from the M candidate site center pre-determined distance any point longitude and latitude.
Alternatively, editor's deviation computing module M2 obtains described using nearest neighbor algorithm KNN Edit deviation.
Alternatively, the editor deviation computing module M2 is passed through following using nearest neighbor algorithm KNN Step obtains editor's deviation:
S21, take out a candidate site successively from the database;
In each word and the address by bus that are taken out successively in candidate site described in S22, comparison Each word;
If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being last word in the address by bus, terminate this Comparison procedure;
S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
Alternatively, the editor deviation computing module M2 be used to meeting when obtaining editor's deviation with Lower condition includes:
When the address of riding is identical with the candidate site, editor's deviation is 0;
When input is address and the candidate site, or the candidate site and institute by bus When stating address by bus, gained editor's deviation is compared twice identical;
When input is one in null value and the address by bus or the candidate site, the volume It is the length of one in the address by bus or described candidate site to collect deviation.
Alternatively, the center computing module M4 is obtained apart from institute using arithmetic mean method State the longitude and latitude at any point of the center pre-determined distance of M candidate site.
For device embodiment, because the device corresponds to method as discussed above, thus It can solve identical technical problem as method, reach identical technique effect, herein Repeat no more.
It should be noted that disclosed in the present embodiment in all parts of device, will according to it The function of realization and logical partitioning has been carried out to part therein, still, the disclosure is not only restricted to All parts can be repartitioned or combined as needed by this, for example, can be by Some component combinations are single part, or can be further broken into some parts more Subassembly.
The all parts embodiment of the disclosure can realize with hardware, or with one or many The software module run on individual processor is realized, or is realized with combinations thereof.This area It will be appreciated by the skilled person that microprocessor or digital signal processor can be used in practice (DSP) come realize some or all parts in the system according to the embodiment of the present disclosure some Or repertoire.The disclosure be also implemented as perform method as described herein one Partly or completely equipment or program of device are (for example, computer program and computer program Product).Such program for realizing the disclosure can be stored on a computer-readable medium, or There can be the form of one or more signal.Such signal can be from internet website Download is obtained, and is either provided or is provided in any other form on carrier signal.
It should be noted that above-described embodiment illustrates rather than to enter the disclosure to the disclosure Row limitation, and those skilled in the art are without departing from the scope of the appended claims Alternative embodiment can be designed.In the claims, should not be by any ginseng between bracket Symbol construction is examined into limitations on claims.Word "comprising" does not exclude the presence of the power of not being listed in Element or step in profit requirement.Word "a" or "an" before element is not arranged Except there are multiple such elements.The disclosure can be by means of including the hard of some different elements Part and realized by means of properly programmed computer.If being weighed in the unit for listing equipment for drying During profit is required, several in these devices can be embodied by same hardware branch. The use of word first, second, and third does not indicate that any order.Can be by these words It is construed to title.
Embodiment of above is only suitable to the explanation disclosure, and limitation not of this disclosure is relevant The those of ordinary skill of technical field, in the case where not departing from spirit and scope of the present disclosure, It can also make a variety of changes and modification, therefore all equivalent technical schemes fall within the disclosure Category, the scope of patent protection of the disclosure should be defined by the claims.

Claims (10)

  1. The address method of adjustment 1. a kind of user rides, it is characterised in that methods described includes:
    Obtain the address information by bus of user;
    Editor's deviation of each candidate site in the address information by bus and database is calculated, with Obtain editor's less top n candidate site of deviation;N is positive integer;
    The address information by bus and Euler's distance of the top n candidate site are calculated, to obtain Euler's distance is taken to be less than M candidate site of preset value;M is positive integer and is less than N;
    Calculate the longitude and latitude of the M candidate site and in the M candidate site The longitude and latitude at any point of heart position pre-determined distance.
  2. The address method of adjustment 2. user according to claim 1 rides, it is characterised in that Ridden described in the calculating in address information and database each step of editor's deviation of candidate site Editor's deviation is obtained using nearest neighbor algorithm KNN in rapid.
  3. The address method of adjustment 3. user according to claim 2 rides, it is characterised in that The step of nearest neighbor algorithm KNN obtains editor's deviation includes:
    S21, take out a candidate site successively from the database;
    In each word and the address by bus that are taken out successively in candidate site described in S22, comparison Each word;
    If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being last word in the address by bus, terminate this Comparison procedure;
    S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
  4. The address method of adjustment 4. user according to claim 3 rides, it is characterised in that To obtain accurately editor's deviation, the nearest neighbor algorithm, which also needs to meet following condition, to be included:
    When the address of riding is identical with the candidate site, editor's deviation is 0;
    When input is address and the candidate site, or the candidate site and institute by bus When stating address by bus, gained editor's deviation is compared twice identical;
    When input is one in null value and the address by bus or the candidate site, the volume It is the length of one in the address by bus or described candidate site to collect deviation.
  5. The address method of adjustment 5. the user according to Claims 1 to 4 any one rides, its It is characterised by, it is pre- apart from the center of the M candidate site using arithmetic mean method acquisition If the longitude and latitude at any point of distance.
  6. The address adjusting apparatus 6. a kind of user rides, it is characterised in that described device includes:
    Address information acquisition module by bus, the address information by bus for obtaining user;
    Deviation computing module is edited, it is each in the address information by bus and database for calculating Editor's deviation of candidate site, to obtain editor's less top n candidate site of deviation; N is positive integer;
    Euler's distance calculation module, is waited for calculating the address information by bus with the top n Euler's distance of selection of land location, to obtain the M candidate site that Euler's distance is less than preset value; M is positive integer and is less than N;
    Center computing module, for calculate the M candidate site longitude and latitude and away from From the longitude and latitude at any point of the center pre-determined distance of the M candidate site.
  7. The address adjusting apparatus 7. user according to claim 6 rides, it is characterised in that Editor's deviation computing module obtains editor's deviation using nearest neighbor algorithm KNN.
  8. The address adjusting apparatus 8. user according to claim 7 rides, it is characterised in that Editor's deviation computing module obtains the volume using nearest neighbor algorithm KNN by following steps Collect deviation:
    S21, take out a candidate site successively from the database;
    In each word and the address by bus that are taken out successively in candidate site described in S22, comparison Each word;
    If S23, two word differences, continue to take out a word from the address by bus, Continue executing with step S22;If being last word in the address by bus, terminate this Comparison procedure;
    S23, if identical from the candidate site take out a word, continue executing with step S22,;If being last word in the candidate site, terminate this comparison procedure.
  9. The address adjusting apparatus 9. user according to claim 8 rides, it is characterised in that Meeting following condition when editor's deviation computing module is for obtaining editor's deviation includes:
    When the address of riding is identical with the candidate site, editor's deviation is 0;
    When input is address and the candidate site, or the candidate site and institute by bus When stating address by bus, gained editor's deviation is compared twice identical;
    When input is one in null value and the address by bus or the candidate site, the volume It is the length of one in the address by bus or described candidate site to collect deviation.
  10. The address adjusting apparatus 10. the user according to claim 6~9 any one rides, Characterized in that, the center computing module is obtained apart from the M using arithmetic mean method The longitude and latitude at any point of the center pre-determined distance of individual candidate site.
CN201610150555.3A 2016-03-16 2016-03-16 User riding address adjusting method and device Active CN107203823B (en)

Priority Applications (10)

Application Number Priority Date Filing Date Title
CN201610150555.3A CN107203823B (en) 2016-03-16 2016-03-16 User riding address adjusting method and device
JP2018502643A JP2018537739A (en) 2016-03-16 2016-12-28 System and method for determining position
EP16894237.3A EP3311554B1 (en) 2016-03-16 2016-12-28 System and method for determining location
CN201680083007.1A CN108702382A (en) 2016-03-16 2016-12-28 System and method for determining position
PCT/CN2016/112783 WO2017157078A1 (en) 2016-03-16 2016-12-28 System and method for determining location
GB1800680.9A GB2557749A (en) 2016-03-16 2016-12-28 System and method for determining location
AU2016397278A AU2016397278B2 (en) 2016-03-16 2016-12-28 System and method for determining location
US15/873,433 US10527446B2 (en) 2016-03-16 2018-01-17 System and method for determining location
US16/516,318 US11193786B2 (en) 2016-03-16 2019-07-19 System and method for determining location
JP2020085187A JP2020129003A (en) 2016-03-16 2020-05-14 System and method for determining location

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201610150555.3A CN107203823B (en) 2016-03-16 2016-03-16 User riding address adjusting method and device

Publications (2)

Publication Number Publication Date
CN107203823A true CN107203823A (en) 2017-09-26
CN107203823B CN107203823B (en) 2020-12-25

Family

ID=59903963

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201610150555.3A Active CN107203823B (en) 2016-03-16 2016-03-16 User riding address adjusting method and device

Country Status (1)

Country Link
CN (1) CN107203823B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109325185A (en) * 2018-07-16 2019-02-12 北京三快在线科技有限公司 A kind of determination is got on the bus method, apparatus, equipment and storage medium a little
CN110532482A (en) * 2019-08-19 2019-12-03 北京三快在线科技有限公司 It is a kind of to show the method and device got on the bus a little
CN111522838A (en) * 2020-04-23 2020-08-11 数网金融有限公司 Address similarity calculation method and related device
CN111566677A (en) * 2018-12-13 2020-08-21 北京嘀嘀无限科技发展有限公司 System and method for changing boarding location in transportation services

Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1320001A (en) * 2000-02-03 2001-10-31 数码通电讯有限公司 Positioning system
CN101650188A (en) * 2008-08-15 2010-02-17 希姆通信息技术(上海)有限公司 Method and device for tracking station stop board by using mobile phone GPS
US20100287178A1 (en) * 2009-05-08 2010-11-11 Google Inc. Refining location estimates and reverse geocoding based on a user profile
CN103985247A (en) * 2014-04-24 2014-08-13 北京嘀嘀无限科技发展有限公司 Taxi transport capacity scheduling system based on city taxi calling demand distribution density
CN104580499A (en) * 2015-01-23 2015-04-29 北京嘀嘀无限科技发展有限公司 Method and device for accurately labeling positions
CN104933539A (en) * 2015-04-03 2015-09-23 浙江工业大学 Express delivery single generation method based on RFID technology
CN105005577A (en) * 2015-05-08 2015-10-28 裴克铭管理咨询(上海)有限公司 Address matching method
CN105339914A (en) * 2013-07-21 2016-02-17 株式会社谈宝阿络藤 Method and system for exchanging messages on the basis of current position

Patent Citations (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1320001A (en) * 2000-02-03 2001-10-31 数码通电讯有限公司 Positioning system
CN101650188A (en) * 2008-08-15 2010-02-17 希姆通信息技术(上海)有限公司 Method and device for tracking station stop board by using mobile phone GPS
US20100287178A1 (en) * 2009-05-08 2010-11-11 Google Inc. Refining location estimates and reverse geocoding based on a user profile
CN105339914A (en) * 2013-07-21 2016-02-17 株式会社谈宝阿络藤 Method and system for exchanging messages on the basis of current position
CN103985247A (en) * 2014-04-24 2014-08-13 北京嘀嘀无限科技发展有限公司 Taxi transport capacity scheduling system based on city taxi calling demand distribution density
CN104580499A (en) * 2015-01-23 2015-04-29 北京嘀嘀无限科技发展有限公司 Method and device for accurately labeling positions
CN104933539A (en) * 2015-04-03 2015-09-23 浙江工业大学 Express delivery single generation method based on RFID technology
CN105005577A (en) * 2015-05-08 2015-10-28 裴克铭管理咨询(上海)有限公司 Address matching method

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109325185A (en) * 2018-07-16 2019-02-12 北京三快在线科技有限公司 A kind of determination is got on the bus method, apparatus, equipment and storage medium a little
CN109325185B (en) * 2018-07-16 2020-01-03 北京三快在线科技有限公司 Method, device and equipment for determining getting-on point and storage medium
CN111566677A (en) * 2018-12-13 2020-08-21 北京嘀嘀无限科技发展有限公司 System and method for changing boarding location in transportation services
CN110532482A (en) * 2019-08-19 2019-12-03 北京三快在线科技有限公司 It is a kind of to show the method and device got on the bus a little
CN110532482B (en) * 2019-08-19 2022-03-08 北京三快在线科技有限公司 Method and device for displaying boarding point
CN111522838A (en) * 2020-04-23 2020-08-11 数网金融有限公司 Address similarity calculation method and related device
CN111522838B (en) * 2020-04-23 2023-07-21 数网金融有限公司 Address similarity calculation method and device

Also Published As

Publication number Publication date
CN107203823B (en) 2020-12-25

Similar Documents

Publication Publication Date Title
CN107203823A (en) A kind of user rides address method of adjustment and device
CN104063383B (en) Information recommendation method and device
CN102802114B (en) Method and system for screening seat by using voices
CN103389979B (en) Recommend system, the device and method of classified lexicon in input method
CN106407420B (en) Multimedia resource recommendation method and system
CN106445954B (en) Business object display method and device
CN107731229A (en) Method and apparatus for identifying voice
CN103810184A (en) Method for determining web page address velocity, optimization method and device of methods
CN108053290B (en) Multi-order combination processing method and system for O2O service platform
CN106503108A (en) Geographical position search method and device
CN103714080A (en) Spatial index structure tree based method and device for providing results of searching spatial objects
CN105761154B (en) A kind of socialization recommended method and device
CN104121922B (en) Map path acquiring method and device
CN104636457B (en) A kind of method and device of location finding cognition
Zhang et al. A tourism route-planning approach based on comprehensive attractiveness
CN113139654A (en) Method and device for training neural network model
CN111967964A (en) Intelligent recommendation method and device for bank client website
CN103699614B (en) A kind of method and apparatus for determining Default saving path when downloading resource
CN109739989A (en) File classification method and computer equipment
CN112685646A (en) Recommendation information generation method and device, electronic equipment and storage medium
Dalumpines et al. Making mode detection transferable: extracting activity and travel episodes from GPS data using the multinomial logit model and Python
CN112085058A (en) Object combination recall method and device, electronic equipment and storage medium
CN110297967B (en) Method, device and equipment for determining interest points and computer readable storage medium
CN110427546A (en) A kind of information displaying method and device
JP5375217B2 (en) Map service server and map service method

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
TA01 Transfer of patent application right

Effective date of registration: 20201207

Address after: 100193, No. 34, building No. 8, West flourishing road, Haidian District, Beijing

Applicant after: BEIJING DIDI INFINITY TECHNOLOGY AND DEVELOPMENT Co.,Ltd.

Address before: Office building D comprehensive service district Nangang Industrial Zone 300480 in Tianjin Binhai Economic and Technological Development Zone, 2 floor room 219-22

Applicant before: Didi (China) Technology Co.,Ltd.

TA01 Transfer of patent application right
GR01 Patent grant
GR01 Patent grant