WO2020019976A1 - 一种期望时长区间确定方法、行程验证方法及装置 - Google Patents

一种期望时长区间确定方法、行程验证方法及装置 Download PDF

Info

Publication number
WO2020019976A1
WO2020019976A1 PCT/CN2019/095207 CN2019095207W WO2020019976A1 WO 2020019976 A1 WO2020019976 A1 WO 2020019976A1 CN 2019095207 W CN2019095207 W CN 2019095207W WO 2020019976 A1 WO2020019976 A1 WO 2020019976A1
Authority
WO
WIPO (PCT)
Prior art keywords
trip
information
travel
historical
gate
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.)
Ceased
Application number
PCT/CN2019/095207
Other languages
English (en)
French (fr)
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.)
Alibaba Group Holding Ltd
Original Assignee
Alibaba Group Holding 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
Application filed by Alibaba Group Holding Ltd filed Critical Alibaba Group Holding Ltd
Publication of WO2020019976A1 publication Critical patent/WO2020019976A1/zh
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING OR CALCULATING; COUNTING
    • G06Q—INFORMATION 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
    • G06Q30/00—Commerce
    • G06Q30/02—Marketing; Price estimation or determination; Fundraising
    • G06Q30/0283—Price estimation or determination
    • G06Q30/0284—Time or distance, e.g. usage of parking meters or taximeters

Definitions

  • Embodiments of the present specification relate to the field of information technology, and in particular, to a method for determining an expected time interval, a method and a device for verifying a trip.
  • the inter-site itinerary billing model means that the service provides itinerary services to users (such as bus services, highway services, etc.). Users enter from one station to start the itinerary, leave from another station to end the itinerary, and pay the servicer for the itinerary.
  • the cost of the trip is calculated by the service provider based on the trip between the two stations. Generally, the longer the trip between these two stations, the higher the corresponding trip cost.
  • a trip of the user X can be described as follows:
  • User X first uses his own user ID as a pass and enters site A to start the journey. At this time, the server will establish a correspondence between the user ID and site A and save it. Subsequently, the user X again uses his own user ID as the voucher and requests to leave the site B to end the trip. At this time, the service party determines that the user X starts the trip from the site A according to the user ID, and then determines that the user X passed The itinerary is from site A to site B, and the itinerary fee that user X should pay is calculated based on the itinerary that user X passes.
  • the service provider uses the user identification as a clue to determine the start and end of a trip, and then charges based on the start and end of a trip.
  • this gives malicious users the opportunity to avoid paying the full cost of the trip.
  • the embodiments of the present specification provide a method for determining an expected time interval, an itinerary verification method, and a device.
  • the technical solution is as follows:
  • a method for determining an expected duration interval including:
  • An expected duration interval corresponding to the station pair is determined according to the travel durations corresponding to the multiple pieces of historical travel information.
  • a trip verification method including:
  • the expected duration interval is determined according to the foregoing expected duration interval determination method
  • another method for determining an expected duration interval is provided.
  • the site is provided with at least one entrance gate and at least one exit gate.
  • the method includes:
  • an expected duration interval corresponding to the gate pair is determined.
  • another itinerary verification method including:
  • the expected duration interval is determined according to another method for determining an expected duration interval described above;
  • a device for determining an expected duration interval including:
  • Designating a module designating any site as the start of the trip, and designating any site as the end of the trip;
  • a pairing module which combines the start site of the trip and the stop site of the trip into a site pair
  • An acquisition module which acquires multiple historical itinerary information corresponding to the site pair
  • the travel duration determination module determines, for each historical travel information of the plurality of historical travel information, a travel duration corresponding to the historical travel information
  • the expected duration interval determination module determines an expected duration interval corresponding to the station pair according to the respective travel durations corresponding to the multiple historical travel information.
  • a stroke verification device including:
  • An acquisition module to acquire target trip information corresponding to the target trip
  • a determining module according to the target itinerary information, determining a station pair and a target trip duration corresponding to the target itinerary information
  • the judgment processing module determines whether the target trip duration falls within an expected duration interval corresponding to the station pair; the expected duration interval is determined according to the foregoing expected duration interval determination method; if so, it is determined that the target journey passes verification.
  • another apparatus for determining a desired time interval is provided.
  • the site is provided with at least one entrance gate and at least one exit gate.
  • the apparatus includes:
  • a designated module designating any entrance gate as a trip start gate, and designating any exit gate as a trip end gate;
  • a pairing module which forms the gate pair of the stroke start gate and the stroke end gate
  • An acquisition module which acquires multiple historical trip information corresponding to the gate pair
  • the travel duration determination module determines, for each historical travel information of the plurality of historical travel information, a travel duration corresponding to the historical travel information
  • the expected duration interval determination module determines an expected duration interval corresponding to the gate pair according to the respective travel durations corresponding to the multiple historical travel information.
  • another stroke verification device including:
  • An acquisition module to acquire target trip information corresponding to the target trip
  • a determining module according to the target travel information, determining a gate pair and a target travel time corresponding to the target travel information
  • the judgment processing module determines whether the target trip duration falls within an expected duration interval corresponding to the gate pair; the expected duration interval is determined according to another method for determining an expected duration interval described above; if so, determining The target itinerary is verified.
  • the technical solution provided in the embodiment of the present specification forms a site pair between a trip start site and a trip termination site.
  • multiple historical trip information corresponding to the station pair statistics are collected in multiple historical trips.
  • the length of time i.e. the duration of the trip
  • the target trip corresponding to the station pair is verified, if the trip duration corresponding to the target trip falls within the desired duration interval, it is determined that the target trip passes the verification. In this way, it is possible to effectively reduce the economic loss of the service provider providing the itinerary service.
  • Figure 1 is a trip route map
  • FIG. 2 is a schematic flowchart of a method for determining an expected duration interval provided by an embodiment of the present specification
  • FIG. 3 is a schematic diagram of a probability distribution with travel duration as a variable according to an embodiment of the present specification
  • FIG. 5 is a schematic flowchart of another method for determining a desired duration interval provided by an embodiment of the present specification
  • FIG. 6 is a schematic flowchart of another itinerary verification method provided by an embodiment of the present specification.
  • FIG. 8 is a schematic structural diagram of a device for determining an expected duration interval provided by an embodiment of the present specification.
  • FIG. 9 is a schematic structural diagram of a travel verification device provided by an embodiment of the present specification.
  • FIG. 10 is a schematic structural diagram of another device for determining a desired duration interval provided by an embodiment of the present specification.
  • FIG. 11 is a schematic structural diagram of another travel verification device provided by an embodiment of the present specification.
  • FIG. 12 is a schematic structural diagram of a device for configuring a method according to an embodiment of the present specification.
  • the service side often uses the user ID as a clue to determine the start and end of a trip.
  • the implicit premise here is that the service side believes that for any user, the user ID held by the user at the start of the trip and the end of the trip. Some user IDs are the same user ID. This premise is correct, the itinerary determined by the service party for the user is accurate, and furthermore, the itinerary cost calculated based on the determined itinerary is accurate.
  • Figure 1 shows a trip route map.
  • FIG. 1 there are four (stations 1 to 4) on the itinerary. It is assumed that the itinerary service provider of this itinerary route stipulates that the user must pay a trip fee of 1 yuan for each trip between two adjacent stations.
  • User A starts at site 1 after presenting the user ID A to the server (the server establishes the correspondence between site 1 and user ID A and saves), and goes to site 3;
  • user B presents the user ID B to the server's management device at site 4 Then set off (the server establishes the correspondence between site 4 and user ID B and saves it), and then goes to site 2. Under normal circumstances, after user A arrives at site 3, he presents the user ID A to the server again.
  • the server determines that the journey traveled by user A is from site 1 to site 3, and then asks user A to pay 2 yuan. Similarly, after user B arrives at site 3, the service provider will also ask user B to pay 3 yuan.
  • user A can collude with user B to deceive the server. After user A arrives at site 3, he can show user ID B to the server, and after user B arrives at site 2, he can show user ID A to the server. In this way, the service provider will mistakenly think that the journey that User A has traveled is Station 4 to Station 3, and will only ask User A to pay 1 yuan. In the same way, the service provider will mistakenly think that the journey that User B has taken is Site 1 to Site 2, and will only ask User B to pay 1 yuan. Obviously, user A and user B colluded and deceived the service provider and suffered a loss of 2 yuan.
  • criminals can hold a large number of different user IDs, which are registered with the payment service provider in advance.
  • the criminals provide user A with a QR code containing the user ID X in order for user A to enter site 1; when user B wants to enter site 4 At this time, the criminal provides the user B with an inbound QR code containing the user ID Y, so that the user A enters the site 4.
  • the criminals provide user A with an outbound QR code that contains user ID Y, causing the subway company to mistakenly think that user A's journey is station 4 to station 3;
  • the criminals provide user B with an outbound QR code that contains user ID X, causing the subway company to mistakenly think that user B's journey is station 1 to station 2.
  • the user's QR code presented to the subway gate at the time of entering and leaving the station is not a QR code generated based on the same user ID.
  • User A only needs to pay for one stop of the journey (Site 4 to Site 3). The cost is the same for user B. Obviously, this will cause the metro company to suffer economic losses.
  • the applicant believes that by examining an itinerary from the time dimension, it can be identified whether a malicious user evades paying the full amount of the itinerary for this itinerary.
  • the time point for entering from station 4 (showing the QR code containing the user ID C) is T1, and from station 3
  • the time of exiting (showing the outbound QR code containing the user ID C) is T2.
  • User C enters from station 4 and leaves from station 3.
  • the interval is T2-T1. This is also recorded by the subway company.
  • the time point for malicious user A to enter from site 1 is T3, and to exit from site 3 (show the outbound QR code containing the user ID Y, it needs to be explained) Yes, the QR code containing the user ID Y is presented to the subway gate of station 4 by user Y at time T4.
  • the QR code containing the user ID Y is presented to the subway gate of station 4 by user Y at time T4.
  • user A leaves the station he only needs to pay the travel costs of stations 4 to 3.
  • the point is T5.
  • User A enters from station 1 and leaves from station 3.
  • the interval between them is T5-T3.
  • the travel time corresponding to the trip from station 4 to station 3 is T5-T4. .
  • T4 is actually the time point when user Y entered the station, not the time point when user A enters the station (T3); on the other hand, T5 is actually the time point when user A is out of the station, not The time point when user Y is outbound.
  • T5-T4 and T2-T1 are often significantly different.
  • the user changes the user ID in the middle of the trip that is, the user ID used for the inbound station is not consistent with the user ID used for the outbound station
  • FIG. 2 is a schematic flowchart of a method for determining a desired duration interval provided by an embodiment of the present specification, including the following steps:
  • S200 Specify any station as the start of the trip, and specify any station as the end of the trip.
  • S202 Form a site pair between the trip start site and the trip termination site.
  • the execution subject of the method may be a service-side device (herein referred to as a service-side device) that provides itinerary services, such as a server-side computer, a mobile phone, a server, a gate with a data processing function, and the like.
  • a service-side device that provides itinerary services, such as a server-side computer, a mobile phone, a server, a gate with a data processing function, and the like.
  • the starting point of the trip is the stop corresponding to the start point of the trip
  • the ending point of the trip is the stop corresponding to the end point of the trip.
  • the trip start site and the trip termination site form a site pair, and the site pair uniquely determines this trip. For example, if the trip start site is site 1 and the trip end site is site 2, then the site pair (site 1, site 2) uniquely determines itinerary site 1 to site 2.
  • the trip start site and the trip termination site may be the same site.
  • the site pair site 1, site 1 uniquely determines itinerary site 1 to site 1.
  • users can enter from station 1 and then exit from station 1. At this time, itinerary from station 1 to station 1 will also generate corresponding travel expenses.
  • S204 Acquire a plurality of historical trip information corresponding to the site pair.
  • a piece of historical trip information refers to information generated by any user in the history to complete a trip corresponding to the site pair, and is generally recorded by a server device.
  • a server device For example, in the subway scenario, assuming that the station pair is (Site 1, Site 2), then any user enters from Station 1 and exits from Station 2, and the user's pit stop time will be pitted by Station 1. Gate record, the user's outbound time will be recorded by the outbound gate of station 2. In the end, the trip start information (stop 1), inbound time, end of travel information (stop 2), and outbound time, etc. Historical itinerary information.
  • the station information corresponding to the start point of the trip and the station information corresponding to the end point of the trip included in the historical trip information may be obtained. If the station information corresponding to the starting point of the trip is the information of the starting point of the trip, and the station information corresponding to the ending point of the trip is the information of the ending point of the trip, then the historical trip information is determined to be corresponding to the station pair. Historical itinerary information.
  • an inbound time and an outbound time included in the historical trip information may be obtained, and according to the inbound time and the outbound time, Stop time, calculate the travel time corresponding to the historical travel information. For example, if the inbound time is 10 o'clock and the outbound time is 12 o'clock, then the corresponding trip duration is 1 hour.
  • S208 Determine an expected duration interval corresponding to the station pair according to the respective travel durations corresponding to the multiple historical travel information.
  • the itinerary of the station pair has a reasonable range of duration, which corresponds to an expected duration interval of the station pair. If the trip duration corresponding to a certain trip falls within the desired duration interval, there is a high probability that it does not involve a malicious user evading payment of the full trip fee. If the trip duration corresponding to a certain trip does not fall within the expected duration interval, There is a high probability that it will involve malicious users evading payment of full travel expenses.
  • the expected time interval may be specified according to actual service requirements. For example, the left and right endpoint values of the desired duration interval may be specified, so that the travel duration corresponding to more than 80% of the historical journey information in the multiple historical trip information falls within the expected duration interval.
  • the probability distribution with the travel duration as a variable may be determined according to the travel duration corresponding to the multiple historical travel information, and according to the expected value of the travel duration corresponding to the probability distribution, it is determined to correspond to The expected duration of the site pair.
  • the expected duration interval corresponding to the site pair may be ( ⁇ -N * ⁇ , ⁇ + N * ⁇ ).
  • ⁇ represents the expected value (that is, the average of the duration of each trip)
  • ⁇ represents the standard deviation corresponding to the probability distribution
  • N is greater than 0.
  • FIG. 3 is a schematic diagram of a probability distribution with a travel duration as a variable according to an embodiment of the present specification.
  • multiple historical trip information corresponding to the site pair often exhibits a normal distribution.
  • the average of the trip duration can be extended to the left and right by one standard deviation, to obtain ( ⁇ - ⁇ , ⁇ + ⁇ ), as the desired duration interval.
  • a confidence interval corresponding to a specified confidence (eg, 90%, 95%) of the probability distribution may also be taken as the expected duration interval.
  • all site pairs with the site as the starting point of the trip may be determined, and steps S204 to S208 are performed for each determined site pair. That is, for each site, all possible site pairs are exhausted, and for each site pair, an expected duration interval corresponding to the site pair is determined.
  • an embodiment of the present specification provides a method for verifying a trip. As shown in FIG. 4, the method includes the following steps:
  • S400 Obtain target trip information corresponding to the target trip.
  • S402 Determine, according to the target travel information, a station pair and a target travel time corresponding to the target travel information.
  • the execution subject of the method may be the server device.
  • the service-side device verifies whether the target trip involves a malicious user to avoid paying the full trip fee.
  • the server device may generate target itinerary information corresponding to the target itinerary.
  • the target itinerary information usually includes a trip start station, an inbound time, a trip end station, and an outbound time of the target trip.
  • the server device may determine the station pair and the target trip duration corresponding to the target trip information accordingly.
  • the service-side equipment uses the user identification as a clue to determine the start site and end site of the target trip.
  • the entry site that the user requests to enter is the trip start site, and the user presents the user ID to the trip start site to generate an inbound record.
  • the exit site that the user requested to leave is the itinerary termination site.
  • the user presents the user ID to the itinerary termination site.
  • the itinerary termination site uses the user ID as a clue, and queries the entry with the user ID as the pass. Station records to determine the corresponding trip starting station. In this way, the station pair corresponding to the target trip can be determined.
  • S408 Determine that the target itinerary fails verification; or, add an abnormal record to a user ID included in the target itinerary information; if the number of abnormal records corresponding to the user ID is greater than a specified number, determine that the target itinerary has failed approved.
  • the expected time interval corresponding to the site pair is actually an interval in which a non-malicious user completes the corresponding trip of the site pair, and the time it takes will fall with a high probability. Based on this, if the target trip duration falls within the desired duration interval, the target trip can be considered to be completed by a non-malicious user, and thus verified.
  • the target trip duration does not fall within the expected duration interval, the target trip may be considered to be completed by a malicious user, and thus fails to pass verification.
  • the target trip duration does not fall within the desired duration interval, it may also be that an unexpected situation (such as staying in the trip for a long time before leaving the station) causes a non-malicious user to cause the target trip duration to be abnormal.
  • the server device may add an exception record for the user ID included in the target trip information. If the number of records is greater than the specified number (for example, 3 times), it is determined that the target trip has not passed verification.
  • the travel time of multiple historical trips corresponding to the station pair is used as a reference to determine the corresponding expectation of the station. Duration.
  • the expected time interval corresponding to the site pair is actually an interval in which a non-malicious user starts from the starting point of the trip in the site pair and arrives at the ending point of the trip in the site pair.
  • the same user completes two consecutive trips within two close time periods, which may cause the server equipment to determine the wrong trip. For example, the user enters from station A, leaves from station B, and then, again enters from station C, and leaves from station D. If there is a network delay or a device failure, the server device fails to obtain the user's departure information from station B in time, but instead obtains the user's departure information from station D. In this case, the server device may only determine the user Completed a trip "Station A to Station D". In this way, the service provider may also cause economic losses.
  • this situation will also show an anomaly in the time dimension, that is, the travel time of the "A station ⁇ D station" determined by the server equipment will be abnormal and will not fall into the station pair (A station, D station ) Corresponding expected duration interval. Therefore, this solution can also identify abnormal trips due to network delays or equipment failures.
  • FIG. 5 is another method for determining an expected duration interval provided by an embodiment of this specification, including the following steps:
  • S500 Designate any entrance gate as the trip start gate, and designate any exit gate as the trip end gate.
  • a gate pair is formed by the stroke start gate and the stroke end gate.
  • the station is usually arranged with at least one entrance gate and at least one exit gate.
  • the station pair is no longer analyzed, but the gate is used instead. Analyze the target.
  • the entrance gate and the exit gate in the gate pair may belong to the same site.
  • S504 Acquire a plurality of historical trip information corresponding to the gate pair.
  • the entry gate information corresponding to the start point of the trip and the exit gate information corresponding to the end point of the trip included in the historical trip information can be obtained.
  • the entrance gate information is the information of the gate at the beginning of the trip
  • the exit gate information corresponding to the end of the trip is the information at the end of the trip.
  • the historical trip information is determined to be the history corresponding to the gate pair. Itinerary information.
  • S506 For each historical trip information in the multiple historical trip information, determine a trip duration corresponding to the historical trip information.
  • S508 Determine an expected duration interval corresponding to the gate pair according to the respective travel durations corresponding to the multiple historical travel information.
  • a probability distribution with the travel duration as a variable may be determined according to the travel durations corresponding to the multiple historical travel information, and according to the expected value of the travel duration corresponding to the probability distribution, it is determined to correspond to the gate.
  • the expected duration of the machine pair may be determined according to the travel durations corresponding to the multiple historical travel information, and according to the expected value of the travel duration corresponding to the probability distribution, it is determined to correspond to the gate. The expected duration of the machine pair.
  • the expected duration interval corresponding to the gate pair is ( ⁇ -N * ⁇ , ⁇ + N * ⁇ ); where ⁇ represents the expected value, ⁇ represents the standard deviation corresponding to the probability distribution, and N Greater than 0.
  • FIG. 6 is a method for verifying a trip provided by an embodiment of the present specification, including:
  • S602 Determine a gate pair and a target trip duration corresponding to the target trip information according to the target trip information.
  • S608 Determine that the target itinerary fails verification; or, add an abnormal record to a user ID included in the target itinerary information; if the number of abnormal records corresponding to the user ID is greater than a specified number, determine that the target itinerary has not approved.
  • the service equipment uses the user ID as a clue to determine the trip start gate and end trip gate of the target trip.
  • the entrance gate requested by the user to enter is the trip start gate
  • the exit gate that the user requests to leave is the end-of-trip gate.
  • the user presents the user ID to the end-of-trip gate.
  • the end-of-trip gate uses the user ID as a clue. An inbound record of passes to determine the corresponding trip start gate. In this way, the gate pair corresponding to the target stroke can be determined.
  • FIG. 7 is a flow chart of itinerary verification in a subway QR code riding scene provided by an embodiment of this specification, including the following steps:
  • S700 The target entrance gate scans the inbound QR code.
  • the target exit gate scans the outbound QR code containing the user ID A.
  • S704 The target exit gate uploads the target trip information to the payment server.
  • the payment server determines the gate pair corresponding to the target trip information, the target trip duration, and the corresponding expected duration interval.
  • the inbound two-dimensional code does not necessarily include the user identification A. If the inbound two-dimensional code does not include the user ID A, it means that the entry gate (called a real entry gate) that scans the inbound two-dimensional code that includes the user ID is not the target entry gate. Furthermore, the gate pair corresponding to the target trip information is actually (the real entrance gate, the target exit gate).
  • the payment server determines whether the target trip duration falls within the desired duration range, and if so, the normal charging is performed, and the trip fee is deducted from the account corresponding to the user ID A.
  • the payment server determines that the number of abnormal records is greater than the specified number, it freezes the account corresponding to the user ID A. If it determines that the number of abnormal records is less than the specified number, then it charges normally and deducts the travel expenses from the account corresponding to the user ID A .
  • target entrance gate and the target exit gate are equipment (servant equipment) of the subway company that provides itinerary services.
  • the payment service refers to the electronic payment that provides the ride QR code generation service and itinerary settlement service. Service providers (such as Alipay).
  • an embodiment of the present specification also provides a device for determining an expected duration interval, as shown in FIG. 8, including:
  • a designation module 801 designating any site as a trip start site, and designating any site as a trip end site;
  • a pairing module 802 which forms a site pair between the trip start site and the trip termination site;
  • the travel duration determination module 804 determines, for each historical travel information of the plurality of historical travel information, a travel duration corresponding to the historical travel information
  • the expected duration interval determining module 805 determines an expected duration interval corresponding to the station pair according to the respective travel durations corresponding to the multiple historical travel information.
  • the trip start site and the trip end site are the same site.
  • the obtaining module 803 obtains, for each historical itinerary information, the station information corresponding to the start point of the trip and the station information corresponding to the end point of the trip contained in the historical itinerary information; if the station information corresponding to the start point of the trip is the itinerary The information of the starting station, and the information of the station corresponding to the end of the trip is the information of the ending station of the trip, then the historical trip information is determined as the historical trip information corresponding to the station pair.
  • the itinerary duration determination module 804 obtains, for each historical itinerary information of the plurality of historical itinerary information, an inbound time and an outbound time included in the historical itinerary information; according to the inbound time and the outbound time Stop time, calculate the travel time corresponding to the historical travel information.
  • the expected duration interval determining module 805 determines a probability distribution with the travel duration as a variable according to the travel durations corresponding to the multiple historical travel information, and determines the corresponding travel duration according to the expected value of the travel duration corresponding to the probability distribution. The expected duration of the site pair.
  • the expected time interval corresponding to the site pair is ( ⁇ -N * ⁇ , ⁇ + N * ⁇ );
  • ⁇ represents the expected value
  • ⁇ represents the standard deviation corresponding to the probability distribution
  • N is greater than 0.
  • the embodiment of the present specification also provides a itinerary verification device, as shown in FIG. 9, including:
  • the acquisition module 901 acquires target trip information corresponding to the target trip
  • a determining module 902 according to the target trip information, determining a station pair and a target trip duration corresponding to the target trip information;
  • the judging processing module 903 judges whether the target trip duration falls within an expected duration interval corresponding to the station pair; the expected duration interval is determined according to the expected duration interval determination method shown in FIG. 2; The target itinerary is verified.
  • the judgment processing module 903 determines that the target trip does not pass the verification if the target trip duration does not fall within the expected duration interval corresponding to the station pair; or is a user identifier included in the target trip information Adding abnormal records; if the number of abnormal records corresponding to the user ID is greater than the specified number, it is determined that the target trip fails verification.
  • an embodiment of the present specification also provides a device for determining an expected duration interval.
  • the station is provided with at least one entrance gate and at least one An exit gate, the device includes:
  • a designation module 1001 designating any entrance gate as a trip start gate, and designating any exit gate as a trip end gate;
  • a pairing module 1002 which forms the gate pair of the trip start gate and the trip end gate;
  • the obtaining module 1003 obtains a plurality of historical trip information corresponding to the gate pair;
  • the travel duration determination module 1004 determines, for each historical travel information of the plurality of historical travel information, a travel duration corresponding to the historical travel information
  • the expected duration interval determination module 1005 determines an expected duration interval corresponding to the gate pair according to the respective travel durations corresponding to the plurality of historical travel information.
  • the entrance gate and the exit gate belong to the same site.
  • the acquisition module 1003 obtains, for each historical trip information, the entry gate information corresponding to the start of the trip and the exit gate information corresponding to the end of the trip contained in the historical trip information; if the entry gate corresponds to the start of the trip Machine information is the information of the gate at the beginning of the trip, and the information of the exit gate corresponding to the end of the trip is the information at the end of the trip, the historical trip information is determined as the historical trip information corresponding to the gate pair .
  • the expected duration interval determination module 1005 determines a probability distribution with the travel duration as a variable according to the travel durations corresponding to the multiple historical travel information, and determines the corresponding travel duration according to the expected value of the travel duration corresponding to the probability distribution. The expected duration of the gate pair.
  • the expected time interval corresponding to the gate pair is ( ⁇ -N * ⁇ , ⁇ + N * ⁇ );
  • ⁇ represents the expected value
  • ⁇ represents the standard deviation corresponding to the probability distribution
  • N is greater than 0.
  • an embodiment of the present specification also provides a itinerary verification device, as shown in FIG. 11, including:
  • the acquisition module 1101 acquires target trip information corresponding to the target trip
  • a determining module 1102 according to the target travel information, determining a gate pair and a target travel time corresponding to the target travel information;
  • the judgment processing module 1103 determines whether the target trip duration falls within an expected duration interval corresponding to the gate pair; the expected duration interval is determined according to the method according to any one of claims 9 to 13; if yes, It is determined that the target trip passes verification.
  • the judgment processing module 1103 determines that the target trip does not pass verification if the target trip duration does not fall within the expected duration interval corresponding to the gate pair; or is a user identifier included in the target trip information Adding abnormal records; if the number of abnormal records corresponding to the user ID is greater than the specified number, it is determined that the target trip fails verification.
  • An embodiment of the present specification further provides a computer device including at least a memory, a processor, and a computer program stored on the memory and executable on the processor, where the processor implements the program to implement FIG. 2, FIG. 4, The method shown in FIG. 5 or FIG. 6.
  • FIG. 12 shows a more specific schematic diagram of the hardware structure of a computing device provided by an embodiment of the present specification.
  • the device may include a processor 1210, a memory 1220, an input / output interface 1230, a communication interface 1240, and a bus 1250.
  • the processor 1210, the memory 1220, the input / output interface 1230, and the communication interface 1240 implement a communication connection within the device through a bus 1250.
  • the processor 1210 may be implemented by a general-purpose CPU (Central Processing Unit), a microprocessor, an Application Specific Integrated Circuit (ASIC), or one or more integrated circuits, etc., for performing related operations. Program to implement the technical solutions provided by the embodiments of this specification.
  • a general-purpose CPU Central Processing Unit
  • ASIC Application Specific Integrated Circuit
  • the memory 1220 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory), static storage devices, and dynamic storage devices.
  • the memory 1220 may store an operating system and other application programs. When the technical solutions provided in the embodiments of the present specification are implemented by software or firmware, related program codes are stored in the memory 1220 and are called and executed by the processor 1210.
  • the input / output interface 1230 is used to connect an input / output module to implement information input and output.
  • the input / output / module can be configured in the device as a component (not shown in the figure), or it can be externally connected to the device to provide corresponding functions.
  • the input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc.
  • the output device may include a display, a speaker, a vibrator, and an indicator light.
  • the communication interface 1240 is used to connect a communication module (not shown in the figure) to implement communication interaction between the device and other devices.
  • the communication module can implement communication through a wired method (such as USB, network cable, etc.), and can also implement communication through a wireless method (such as mobile network, WIFI, Bluetooth, etc.).
  • the bus 1250 includes a path for transmitting information between various components of the device (for example, the processor 1210, the memory 1220, the input / output interface 1230, and the communication interface 1240).
  • the device may also include necessary for achieving normal operation Other components.
  • the foregoing device may also include only components necessary to implement the solutions of the embodiments of the present specification, and does not necessarily include all the components shown in the drawings.
  • An embodiment of the present specification also provides a computer-readable storage medium on which a computer program is stored.
  • the program is executed by a processor, the methods shown in FIG. 2, FIG. 4, FIG. 5, and FIG. 6 are implemented.
  • Computer-readable media includes both permanent and non-persistent, removable and non-removable media.
  • Information can be stored by any method or technology.
  • Information may be computer-readable instructions, data structures, modules of a program, or other data.
  • Examples of computer storage media include, but are not limited to, phase change memory (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), and read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, read-only disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, Magnetic tape cartridges, magnetic tape magnetic disk storage or other magnetic storage devices or any other non-transmission media may be used to store information that can be accessed by computing devices.
  • computer-readable media does not include temporary computer-readable media, such as modulated data signals and carrier waves.
  • the embodiments of the present specification can be implemented by means of software plus a necessary universal hardware platform. Based on such an understanding, the technical solutions of the embodiments of the present specification may be embodied in the form of software products that are essentially or contribute to the existing technology.
  • the computer software product may be stored in a storage medium, such as ROM / RAM, Magnetic disks, optical disks, and the like include a number of instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform the methods described in various embodiments or portions of the embodiments of this specification.
  • the system, method, module, or unit described in the foregoing embodiments may be specifically implemented by a computer chip or entity or a product with a certain function.
  • a typical implementation device is a computer, and the specific form of the computer may be a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email sending and receiving device, and a game control Desk, tablet computer, wearable device, or a combination of any of these devices.

Landscapes

  • Business, Economics & Management (AREA)
  • Development Economics (AREA)
  • Strategic Management (AREA)
  • Engineering & Computer Science (AREA)
  • Accounting & Taxation (AREA)
  • Finance (AREA)
  • Economics (AREA)
  • Game Theory and Decision Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)
  • Devices For Checking Fares Or Tickets At Control Points (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

公开了一种期望时长区间确定方法、行程验证方法及装置。将行程起始站点与行程终止站点组成站点对，根据对应于所述站点对的多个历史行程信息，统计在多个历史行程中，用户从所述行程起始站点出发到达所述行程终止站点所耗费的时长（即行程时长），并基于统计结果，确定为对应于所述站点对的期望时长区间。当针对对应于所述站点对的目标行程进行验证时，如果该目标行程对应的行程时长落入所述期望时长区间，则确定该目标行程通过验证。

Description

一种期望时长区间确定方法、行程验证方法及装置 技术领域
本说明书实施例涉及信息技术领域，尤其涉及一种期望时长区间确定方法、行程验证方法及装置。
背景技术
在生活中，站点间行程计费模式的适用场景较为常见。站点间行程计费模式是指，服务方向用户提供行程服务(如公交服务、高速公路服务等)，用户从一个站点进入以开始行程，从另一个站点离开以结束行程，并向服务方支付行程费用，该行程费用是服务方根据这两个站点间的行程计算得到的。通常，这两个站点间的行程越长，相应的行程费用就越高。
具体地，针对任一用户X而言，用户X的一次行程可以描述如下：
用户X首先以自己的用户标识为通行凭证，进入站点A以开始行程，此时，服务方会建立该用户标识与站点A之间的对应关系并保存。随后，用户X再次以自己的用户标识为通行凭证，请求离开站点B以结束行程，此时，服务方会根据该用户标识确定用户X是从站点A出发开始行程的，进而确定用户X经过的行程为站点A至站点B，并根据用户X经过的行程计算得到用户X应当支付的行程费用。
可见，服务方以用户标识为线索来确定一次行程的起点和终点，并进而基于一次行程的起点和终点进行计费。然而，这却给了恶意用户可乘之机，以逃避支付全额的行程费用。
发明内容
针对现有技术中存在的提供行程服务的服务方容易遭受经济损失的问题，本说明书实施例提供一种期望时长区间确定方法、行程验证方法及装置，技术方案如下：
根据本说明书实施例的第1方面，提供一种期望时长区间确定方法，包括：
指定任一站点为行程起始站点，以及指定任一站点为行程终止站点；
将所述行程起始站点和所述行程终止站点组成站点对；
获取对应于所述站点对的多个历史行程信息；
针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
根据本说明书实施例的第2方面，提供一种行程验证方法，包括：
获取目标行程对应的目标行程信息；
根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长；
判断所述目标行程时长是否落入对应于所述站点对的期望时长区间；所述期望时长区间是根据上述的期望时长区间确定方法确定的；
若是，则确定所述目标行程通过验证。
根据本说明书实施例的第3方面，提供另一种期望时长区间确定方法，针对每个站点，该站点布置有至少一个入口闸机和至少一个出口闸机，所述方法包括：
指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机；
将所述行程起始闸机和所述行程终止闸机组成闸机对；
获取对应于所述闸机对的多个历史行程信息；
针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
根据本说明书实施例的第4方面，提供另一种行程验证方法，包括：
获取目标行程对应的目标行程信息；
根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长；
判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；所述期望时长区间是根据上述的另一种期望时长区间确定方法确定的；
若是，则确定所述目标行程通过验证。
根据本说明书实施例的第5方面，提供一种期望时长区间确定装置，包括：
指定模块，指定任一站点为行程起始站点，以及指定任一站点为行程终止站点；
组对模块，将所述行程起始站点和所述行程终止站点组成站点对；
获取模块，获取对应于所述站点对的多个历史行程信息；
行程时长确定模块，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
根据本说明书实施例的第6方面，提供一种行程验证装置，包括：
获取模块，获取目标行程对应的目标行程信息；
确定模块，根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长；
判断处理模块，判断所述目标行程时长是否落入对应于所述站点对的期望时长区间；所述期望时长区间是根据上述的期望时长区间确定方法确定的；若是，则确定所述目标行程通过验证。
根据本说明书实施例的第7方面，提供另一种期望时长区间确定装置，针对每个站点，该站点布置有至少一个入口闸机和至少一个出口闸机，所述装置包括：
指定模块，指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机；
组对模块，将所述行程起始闸机和所述行程终止闸机组成闸机对；
获取模块，获取对应于所述闸机对的多个历史行程信息；
行程时长确定模块，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
根据本说明书实施例的第8方面，提供另一种行程验证装置，包括：
获取模块，获取目标行程对应的目标行程信息；
确定模块，根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长；
判断处理模块，判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；所述期望时长区间是根据上述的另一种期望时长区间确定方法确定的；若是，则确定所述目标行程通过验证。
本说明书实施例所提供的技术方案，将行程起始站点与行程终止站点组成站点对，根据对应于所述站点对的多个历史行程信息，统计在多个历史行程中，用户从所述行程起始站点出发到达所述行程终止站点所耗费的时长(即行程时长)，并基于统计结果，确定为对应于所述站点对的期望时长区间。当针对对应于所述站点对的目标行程进行验证时，如果该目标行程对应的行程时长落入所述期望时长区间，则确定该目标行程通过验证。如此，可以有效降低提供行程服务的服务方的经济损失。
应当理解的是，以上的一般描述和后文的细节描述仅是示例性和解释性的，并不能限制本说明书实施例。
此外，本说明书实施例中的任一实施例并不需要达到上述的全部效果。
附图说明
为了更清楚地说明本说明书实施例或现有技术中的技术方案，下面将对实施例或现有技术描述中所需要使用的附图作简单地介绍，显而易见地，下面描述中的附图仅仅是本说明书实施例中记载的一些实施例，对于本领域普通技术人员来讲，还可以根据这些附图获得其他的附图。
图1是一种行程路线图；
图2是本说明书实施例提供的一种期望时长区间确定方法的流程示意图；
图3是本说明书实施例提供的以行程时长为变量的概率分布示意图；
图4是本说明书实施例提供的一种行程验证方法的流程示意图；
图5是本说明书实施例提供的另一种期望时长区间确定方法的流程示意图；
图6是本说明书实施例提供的另一种行程验证方法的流程示意图；
图7是本说明书实施例提供的地铁二维码乘车场景下，行程验证流程图；
图8是本说明书实施例提供的一种期望时长区间确定装置的结构示意图；
图9是本说明书实施例提供的一种行程验证装置的结构示意图；
图10是本说明书实施例提供的另一种期望时长区间确定装置的结构示意图；
图11是本说明书实施例提供的另一种行程验证装置的结构示意图；
图12是用于配置本说明书实施例方法的一种设备的结构示意图。
具体实施方式
站点间行程计费模式的适用场景有很多，如高速公路收费场景、地铁收费场景、包含多个收费点的旅游景区收费场景等。在这些场景下，只要服务方是以用户标识为线索计算一次行程的，就会存在行程服务的服务方容易遭受经济损失的问题。
下面详细说明此问题产生的原因。
服务方往往是以用户标识为线索来确定一次行程的起点和终点的，这里隐含的前提是，服务方相信，针对任一用户，该用户开始行程时持有的用户标识和结束行程时持有的用户标识是同一用户标识。此前提正确无误，服务方确定的该用户经过的行程才是准确的，进而，基于确定的行程计算的行程费用才是准确的。
然而，实践中，此前提中的假设存在漏洞，即该用户开始行程时持有的用户标识和结束行程时持有的用户标识不是同一用户标识，可能导致服务方确定的该用户经过的行程，短于该用户实际经过的行程。
图1示出了一种行程路线图。在图1中，行程路线上存在4个(站点1～4)。假设该行程路线的行程服务方规定，用户每经过相邻两站间的行程，须支付行程费用1元。用户A在站点1向服务方出示用户标识A后出发(服务方建立站点1与用户标识A的对应关系并保存)，前往站点3；用户B在站点4向服务方的管理设备出示用户标识B后出发(服务方建立站点4与用户标识B的对应关系并保存)，前往站点2。正常情况下，用户A到达站点3后，向服务方再次出示用户标识A，服务方根据用户标识A，确定用户A经过的行程为站点1～站点3，于是要求用户A支付2元。同理，用户B到达站点3后，服务方也会要求用户B支付3元。
但是，用户A可以和用户B串通欺骗服务方，用户A到达站点3后，可以向服务方出示用户标识B，用户B到达站点2后，可以向服务方出示用户标识A。如此，服务 方会误以为用户A经过的行程为站点4～站点3，仅会要求用户A支付1元。同理，服务方会误以为用户B经过的行程为站点1～站点2，也仅会要求用户B支付1元。显然，用户A和用户B串通欺骗的行为，使服务方蒙受了2元的损失。
为了便于本领域技术人员理解此问题，以地铁收费场景为例进行更详细的说明。目前，通过地铁闸机扫描用户出示的二维码(包含用户标识)，实现用户进出地铁站和交通费结算的模式逐渐普及。在这种模式下，上述的服务方是地铁公司，此外，用户通常需要预先向电子支付服务商(如支付宝公司)注册用户标识。继续参见图1，当用户A想要进入站点1时，可以使用自己的手机上安装的支付应用(如支付宝应用)生成进站二维码，该进站二维码包含该用户预先注册的用户标识A，站点1的地铁闸机扫描用户A出示的进站二维码后，建立站点1与用户标识A的对应关系并保存。当用户想要从站点3离开离开时，可以再次使用自己的手机上安装的支付应用生成包含用户标识A的出站二维码，站点3的地铁闸机扫描用户A出示的出站二维码后，确定用户A经历的行程为站点1～站点3，生成行程记录，随后，地铁公司将用户A本次行程的行程记录发送给支付服务商进行结算。
在这种模式下，不法分子可以持有大量不同的用户标识，这些用户标识都是预先向支付服务商注册的。继续参见图1，一方面，当用户A想要进入站点1时，不法分子向用户A提供包含用户标识X的进站二维码，以便用户A进入站点1；当用户B想要进入站点4时，不法分子向用户B提供包含用户标识Y的进站二维码，以便用户A进入站点4。另一方面，当用户A想要从站点3离开时，不法分子却向用户A提供包含用户标识Y的出站二维码，导致地铁公司误以为用户A经过的行程为站点4～站点3；当用户A想要从站点3离开时，不法分子却向用户B提供包含用户标识X的出站二维码，导致地铁公司误以为用户B经过的行程为站点1～站点2。也就是说，用户A进站时和出站时向地铁闸机出示的乘车二维码不是基于同一用户标识生成的二维码，用户A仅需要支付一站行程(站点4～站点3)的费用，用户B亦然。显然，这会使地铁公司蒙受经济损失。
申请人认为，从时间维度上考察一次行程，可以识别出这次行程是否存在恶意用户逃避支付全额的行程费用的情况。
具体地，沿用上例，假设用户C非恶意，以自己的用户标识C正常乘车，从站点4进站(出示包含用户标识C的进站二维码)的时间点是T1，从站点3出站(出示包含用户标识C的出站二维码)的时间点是T2，用户C从站点4进入，从站点3离开，中 间相隔的时长为T2-T1，这也是地铁公司记录的，站点4～站点3这一行程所对应的行程时长。此外，恶意用户A从站点1进站(出示包含用户标识X的进站二维码)的时间点是T3，从站点3出站(出示包含用户标识Y的出站二维码，需要说明的是，包含用户标识Y的进站二维码被用户Y于时间点T4出示给站点4的地铁闸机，用户A出站时，仅需要支付站点4～站点3的行程费用即可)的时间点是T5，用户A从站点1进入，从站点3离开，之间相隔的时长为T5-T3，而地铁方记录的，站点4～站点3这一行程所对应的行程时长却是T5-T4。此处的关键在于，一方面，T4实际上是用户Y进站的时间点，不是用户A进站的时间点(T3)；另一方面，T5实际上是用户A出站的时间点，不是用户Y出站的时间点。
而在实践中，T5-T4和T2-T1往往存在显著差别。也就是说，用户如果在行程中途更换了用户标识(即用于进站的用户标识与用于出站的用户标识不一致)，就往往会导致服务方记录的行程时长出现异常。这意味着，针对某一个待验证的行程，若服务方记录的对应于该行程的行程时长与正常情况下对应于该行程的行程时长差别较大，则说明该行程涉及恶意用户中途更换用户标识以逃避支付全额行程费用的情况。
于是，可以据此识别出一次行程是否存在恶意用户逃避支付全额的行程费用的情况，从而可以阻止恶意用户逃避支付全额的行程费用，减少提供行程服务的服务方的经济损失。
为了使本领域技术人员更好地理解本说明书实施例中的技术方案，下面将结合本说明书实施例中的附图，对本说明书实施例中的技术方案进行详细地描述，显然，所描述的实施例仅仅是本说明书的一部分实施例，而不是全部的实施例。基于本说明书中的实施例，本领域普通技术人员所获得的所有其他实施例，都应当属于保护的范围。
以下结合附图，详细说明本说明书各实施例提供的技术方案。
图2是本说明书实施例提供的一种期望时长区间的确定方法的流程示意图，包括以下步骤：
S200：指定任一站点为行程起始站点，以及指定任一站点为行程终止站点。
S202：将所述行程起始站点和所述行程终止站点组成站点对。
本方法的执行主体可以是提供行程服务的服务方的设备(本文称之为服务方设备)，如服务方的电脑、手机、服务器、具有数据处理功能的闸机等。
所述行程起始站点是一段行程的起点对应的站点，所述行程终止站点是这段行程的 终点对应的站点。行程起始站点与行程终止站点组成站点对，所述站点对就唯一确定了这段行程。例如，行程起始站点为站点1，行程终止站点为站点2，那么站点对(站点1，站点2)就唯一确定了行程站点1～站点2。
需要说明的是，所述行程起始站点和所述行程终止站点可以是同一站点。例如，行程起始站点为站点1，行程终止站点也为站点1，那么站点对(站点1，站点1)就唯一确定了行程站点1～站点1。在实践中，用户可以从站点1进站，随后再从站点1出站，此时，行程站点1～站点1也会产生相应的行程费用。
S204：获取对应于所述站点对的多个历史行程信息。
在本说明书实施例中，一个历史行程信息是指，历史上任一用户完成对应于所述站点对的行程所产生的信息，其一般是服务方设备记录的。例如，在地铁场景下，假设所述站点对为(站点1，站点2)，那么任一用户从站点1进站，从站点2出站，该用户的进站时间会被站点1的进站闸机记录，该用户的出站时间会被站点2的出站闸机记录，最终，行程起点信息(站点1)、入站时间、行程终点信息(站点2)、出站时间等信息行程一个历史行程信息。
在本说明书实施例中，可以针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的站点信息和对应于行程终点的站点信息。若对应于行程起点的站点信息为所述行程起始站点的信息，且对应于行程终点的站点信息为所述行程终止站点的信息，则将该历史行程信息确定为对应于所述站点对的历史行程信息。
S206：针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长。
在本说明书实施例中，可以针对所述多个历史行程信息中的每个历史行程信息，获取该历史行程信息中包含的入站时间、出站时间，根据所述入站时间和所述出站时间，计算该历史行程信息对应的行程时长。例如，所述入站时间为10点，所述出站时间为12点，那么，相应的行程时长为1个小时。
S208：根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
在本说明书实施例中，由于存在恶意用户逃避支付全额行程费用情况的行程总是少数的，因此，可以根据所述多个历史行程信息分别对应的行程时长，确定一个非恶意用户完成对应于所述站点对的行程，所花费的时长的合理范围，即对应于所述站点对的期 望时长区间。如果某个行程对应的行程时长落入所述期望时长区间，其有较大概率不涉及恶意用户逃避支付全额行程费用情况，如果某个行程对应的行程时长未落入所述期望时长区间，其有较大概率涉及恶意用户逃避支付全额行程费用情况。
所述期望时长区间具体可以根据实际业务需要指定。例如，可以对所述期望时长区间的左右端点值进行指定，使得所述多个历史行程信息中，80％以上的历史行程信息对应的行程时长落入所述期望时长区间。
本领域技术人员在理解了本发明的核心思想之后，很容易想到多种方式，以所述多个历史行程信息分别对应的行程时长为参考，确定一个合理的时长区间作为所述期望时长区间。
进一步地，在本说明书实施例中，可以根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值，确定对应于所述站点对的期望时长区间。
例如，对应于所述站点对的期望时长区间可以是，(μ-N*σ，μ+N*σ)。其中，μ表示所述期望值(也就是各行程时长的平均值)，σ表示所述概率分布对应的标准差，N大于0。
图3是本说明书实施例提供的以行程时长为变量的概率分布示意图。实践中，对应于所述站点对的多个历史行程信息往往呈现出正态分布的特性，可以将行程时长的平均值向左和向右分别扩展一个标准差，得到(μ-σ，μ+σ)，作为所述期望时长区间。
此外，针对所述概率分布，也可以取对应于所述概率分布的指定置信度(如90％、95％)的置信区间，作为所述期望时长区间。
需要说明的是，实践中，可以针对每个站点，确定以该站点为行程起始站点的所有站点对，并针对确定的每个站点对，执行步骤S204～S208。也就是说，对于各站点，穷尽所有可能的站点对，并针对每个站点对，确定对应于该站点对的期望时长区间。
基于图2所示的期望时长区间确定方法，本说明书实施例提供了一种行程验证方法，如图4所示，包括以下步骤：
S400：获取目标行程对应的目标行程信息。
S402：根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长。
本方法的执行主体可以是所述服务方设备。
在本说明书实施例中，所述服务方设备针对目标行程是否涉及恶意用户逃避支付全额行程费用进行验证。当所述目标行程完成时，即用户从所述目标行程对应的行程终止站点出站时，服务方设备可以生成所述目标行程对应的目标行程信息。
所述目标行程信息中通常包含所述目标行程的行程起始站点、入站时间、行程终止站点、出站时间。服务方设备可以据此确定所述目标行程信息对应的站点对和目标行程时长。
需要说明的是，服务方设备是以用户标识为线索，确定目标行程的行程起始站点和行程终止站点的。具体而言，针对任一用户而言，当该用户入站时，该用户请求进入的入口站点就是行程起始站点，该用户向行程起始站点出示用户标识，产生进站记录。当该用户在出站时，该用户请求离开的出口站点就是行程终止站点，该用户向行程终止站点出示用户标识，行程终止站点以该用户标识为线索，查询以该用户标识为通行凭证的入站记录，以确定相应的行程起始站点。这样，就可以确定目标行程对应的站点对。
S404：判断所述目标行程时长是否落入对应于所述站点对的期望时长区间，若是，执行步骤S406，否则，执行步骤S408。
S406：确定所述目标行程通过验证。
S408：确定所述目标行程未通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
如前所述，对应于所述站点对的期望时长区间实际上是一个非恶意用户完成所述站点对对应的行程，所花费的时长较大概率会落入的区间。基于此，如果所述目标行程时长落入所述期望时长区间，就可以认为所述目标行程是非恶意用户完成的，因而通过验证。
若所述目标行程时长未落入所述期望时长区间，就可以认为所述目标行程是恶意用户完成的，因而未通过验证。
进一步地，若所述目标行程时长未落入所述期望时长区间，则也有可能是非恶意用户出现了意外情况(如在行程中驻留很久才出站)导致所述目标行程时长出现异常。
为此，若所述目标行程时长未落入对应于所述站点对的期望时长区间，服务方 设备可以为所述目标行程信息中包含的用户标识增加异常记录，若所述用户标识对应的异常记录的数量大于指定数量(如3次)，则确定所述目标行程未通过验证。
通过图2所示的期望时长区间确定方法和图4所示的行程验证方法，针对任一站点对，以该站点对对应的多个历史行程的行程时长为参考，确定该站点对对应的期望时长区间。对应于该站点对的期望时长区间，实际上是一个非恶意用户从该站点对中的行程起始站点出发，到达该站点对中的行程终止站点，所花费的时长大概率落入的区间。利用对应于所述站点对的期望时长区间，可以对所述站点对对应的行程进行验证，识别出异常的行程，防止恶意用户逃避支付全额的行程费用，有效降低服务方的经济损失。
此外，本发明提供的技术方案还可以解决如下技术问题：
在实践中，同一用户在较为接近的两个时间段内，连续完成两个行程，可能会导致服务方设备确定行程错误。例如，用户从A站进入，从B站离开，紧接着，又从C站进入，从D站离开。如果存在网络延时或设备故障，服务方设备未能及时获取到用户从B站离开的信息，反而先获取到用户从D站离开的信息，这种情况下，服务方设备可能只会确定用户完成了一个行程“A站～D站”，这样，也可能给服务方造成经济损失。
然而，这种情况同样会在时间维度上呈现出异常，也即，服务方设备确定的“A站～D站”的行程时长会呈现出异常，不会落入站点对(A站，D站)对应的期望时长区间。因此，通过本方案，也可以识别出由于网络延时或设备故障导致的行程异常。
图5是本说明书实施例提供的另一种期望时长区间确定方法，包括如下步骤：
S500：指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机。
S502：将所述行程起始闸机和所述行程终止闸机组成闸机对。
在有些场景下(如地铁场景)，针对每个站点，该站点通常布置有至少一个入口闸机和至少一个出口闸机。这种情况下，由于用户通常是从入口闸机开始行程，从出口闸机终止行程，因此为了更为准确的对行程时长进行统计，不再以站点对为对象进行分析，而是以闸机对为对象进行分析。
需要说明的是，所述闸机对中的入口闸机与出口闸机可能归属于同一站点。
S504：获取对应于所述闸机对的多个历史行程信息。
在本说明书实施例中，可以针对每个历史行程信息，获取该历史行程信息中包 含的，对应于行程起点的入口闸机信息和对应于行程终点的出口闸机信息；若对应于行程起点的入口闸机信息为所述行程起始闸机的信息，且对应于行程终点的出口闸机信息为行程终止闸机的信息，则将该历史行程信息确定为对应于所述闸机对的历史行程信息。
S506：针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长。
S508：根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
在本说明书实施例中，可以根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值，确定对应于所述闸机对的期望时长区间。
进一步地，对应于所述闸机对的期望时长区间为，(μ-N*σ，μ+N*σ)；其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
需要说明的是，实践中，可以穷尽所有可能的闸机对，并针对每个闸机对，确定对应于该闸机对的期望时长区间。
还需要说明的是，若地铁公司对地铁线路进行调整(可能导致对应于闸机对的正常行程时长发生变化)，则为了期望时长区间的准确，可以获取调整后的地铁线路运营一段时间内的历史行程信息，以重新确定对应于每个闸机对的期望时长区间。
基于图5所示的期望时长区间确定方法，图6是本说明书实施例提供的一种行程验证方法，包括：
S600：获取目标行程对应的目标行程信息。
S602：根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长。
S604：判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；若是，则执行步骤S606，否则，执行步骤S608。
S606：确定所述目标行程通过验证。
S608：确定所述目标行程不通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
需要说明的是，服务方设备是以用户标识为线索，确定目标行程的行程起始闸机和行程终止闸机的。具体而言，针对任一用户而言，当该用户入站时，该用户请求进入的入口闸机就是行程起始闸机，该用户向行程起始闸机出示用户标识，产生进站记录。当该用户在出站时，该用户请求离开的出口闸机就是行程终止闸机，该用户向行程终止闸机出示用户标识，行程终止闸机以该用户标识为线索，查询以该用户标识为通行凭证的入站记录，以确定相应的行程起始闸机。这样，就可以确定目标行程对应的闸机对。
还需要说明的是，本领域技术人员在理解了本文对图1和图4所示方法的说明之后，基于同样的发明构思，很容易想到图5和图6所示的方法的具体实施方式，不再赘述。
图7是本说明书实施例提供的，地铁二维码乘车场景下，行程验证流程图，包括如下步骤：
S700：目标入口闸机扫描入站二维码。
S702：目标出口闸机扫描包含用户标识A的出站二维码。
S704：目标出口闸机向支付服务端上传目标行程信息。
S706：支付服务端确定目标行程信息对应的闸机对、目标行程时长和相应的期望时长区间。
需要说明的是，所述入站二维码不一定包含用户标识A。如果所述入站二维码不包含用户标识A，则说明扫描包含所述用户标识的入站二维码的入口闸机(称为真实入口闸机)不是所述目标入口闸机。进而，所述目标行程信息对应的闸机对实际上是(所述真实入口闸机，所述目标出口闸机)。
S708：支付服务端判断所述目标行程时长是否落入所述期望时长区间，若是，则正常计费，从用户标识A对应的账户中扣除行程费用。
S710：支付服务端若目标行程时长未落入期望时长区间，为用户标识B增加一次异常记录，并进一步判断用户标识A对应的异常记录的数量是否大于指定数量。
S712：支付服务端如果确定异常记录的数量大于指定数量，则冻结用户标识A对应的账户，如果确定异常记录的数量小于指定数量，则正常计费，从用户标识A对应的账户中扣除行程费用。
需要说明的是，目标入口闸机和目标出口闸机是提供行程服务的地铁公司的设 备(服务方设备)，支付服务端是指提供乘车二维码生成服务和行程费用结算服务的电子支付服务商(如支付宝公司)。
基于图2所示的期望时长区间确定方法，本说明书实施例还对应提供了一种期望时长区间确定装置，如图8所示，包括：
指定模块801，指定任一站点为行程起始站点，以及指定任一站点为行程终止站点；
组对模块802，将所述行程起始站点和所述行程终止站点组成站点对；
获取模块803，获取对应于所述站点对的多个历史行程信息；
行程时长确定模块804，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
期望时长区间确定模块805，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
所述行程起始站点和所述行程终止站点为同一站点。
所述获取模块803，针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的站点信息和对应于行程终点的站点信息；若对应于行程起点的站点信息为所述行程起始站点的信息，且对应于行程终点的站点信息为所述行程终止站点的信息，则将该历史行程信息确定为对应于所述站点对的历史行程信息。
所述行程时长确定模块804，针对所述多个历史行程信息中的每个历史行程信息，获取该历史行程信息中包含的入站时间、出站时间；根据所述入站时间和所述出站时间，计算该历史行程信息对应的行程时长。
所述期望时长区间确定模块805，根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值，确定对应于所述站点对的期望时长区间。
对应于所述站点对的期望时长区间为，(μ-N*σ，μ+N*σ)；
其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
基于图4所示的行程验证方法，本说明书实施例还对应提供了一种行程验证装置，如图9所示，包括：
获取模块901，获取目标行程对应的目标行程信息；
确定模块902，根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长；
判断处理模块903，判断所述目标行程时长是否落入对应于所述站点对的期望时长区间；所述期望时长区间是根据图2所示的期望时长区间确定方法确定的；若是，则确定所述目标行程通过验证。
所述判断处理模块903，若所述目标行程时长未落入对应于所述站点对的期望时长区间，则确定所述目标行程未通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
基于图5所示的期望时长区间确定方法，本说明书实施例还对应提供了一种期望时长区间确定装置，如图10所示，针对每个站点，该站点布置有至少一个入口闸机和至少一个出口闸机，所述装置包括：
指定模块1001，指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机；
组对模块1002，将所述行程起始闸机和所述行程终止闸机组成闸机对；
获取模块1003，获取对应于所述闸机对的多个历史行程信息；
行程时长确定模块1004，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
期望时长区间确定模块1005，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
所述入口闸机与所述出口闸机归属于同一站点。
所述获取模块1003，针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的入口闸机信息和对应于行程终点的出口闸机信息；若对应于行程起点的入口闸机信息为所述行程起始闸机的信息，且对应于行程终点的出口闸机信息为行程终止闸机的信息，则将该历史行程信息确定为对应于所述闸机对的历史行程信息。
所述期望时长区间确定模块1005，根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值， 确定对应于所述闸机对的期望时长区间。
对应于所述闸机对的期望时长区间为，(μ-N*σ，μ+N*σ)；
其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
基于图6所示的行程验证方法，本说明书实施例还对应提供了一种行程验证装置，如图11所示，包括：
获取模块1101，获取目标行程对应的目标行程信息；
确定模块1102，根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长；
判断处理模块1103，判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；所述期望时长区间是根据权利要求9～13任一项所述的方法确定的；若是，则确定所述目标行程通过验证。
所述判断处理模块1103，若所述目标行程时长未落入对应于所述闸机对的期望时长区间，确定所述目标行程未通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
本说明书实施例还提供一种计算机设备，其至少包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，处理器执行所述程序时实现图2、图4、图5或图6所示的方法。
图12示出了本说明书实施例所提供的一种更为具体的计算设备硬件结构示意图，该设备可以包括：处理器1210、存储器1220、输入/输出接口1230、通信接口1240和总线1250。其中处理器1210、存储器1220、输入/输出接口1230和通信接口1240通过总线1250实现彼此之间在设备内部的通信连接。
处理器1210可以采用通用的CPU(Central Processing Unit，中央处理器)、微处理器、应用专用集成电路(Application Specific Integrated Circuit，ASIC)、或者一个或多个集成电路等方式实现，用于执行相关程序，以实现本说明书实施例所提供的技术方案。
存储器1220可以采用ROM(Read Only Memory，只读存储器)、RAM(Random Access Memory，随机存取存储器)、静态存储设备，动态存储设备等形式实现。存储 器1220可以存储操作系统和其他应用程序，在通过软件或者固件来实现本说明书实施例所提供的技术方案时，相关的程序代码保存在存储器1220中，并由处理器1210来调用执行。
输入/输出接口1230用于连接输入/输出模块，以实现信息输入及输出。输入输出/模块可以作为组件配置在设备中(图中未示出)，也可以外接于设备以提供相应功能。其中输入设备可以包括键盘、鼠标、触摸屏、麦克风、各类传感器等，输出设备可以包括显示器、扬声器、振动器、指示灯等。
通信接口1240用于连接通信模块(图中未示出)，以实现本设备与其他设备的通信交互。其中通信模块可以通过有线方式(例如USB、网线等)实现通信，也可以通过无线方式(例如移动网络、WIFI、蓝牙等)实现通信。
总线1250包括一通路，在设备的各个组件(例如处理器1210、存储器1220、输入/输出接口1230和通信接口1240)之间传输信息。
需要说明的是，尽管上述设备仅示出了处理器1210、存储器1220、输入/输出接口1230、通信接口1240以及总线1250，但是在具体实施过程中，该设备还可以包括实现正常运行所必需的其他组件。此外，本领域的技术人员可以理解的是，上述设备中也可以仅包含实现本说明书实施例方案所必需的组件，而不必包含图中所示的全部组件。
本说明书实施例还提供一种计算机可读存储介质，其上存储有计算机程序，该程序被处理器执行时实现图2、图4、图5、图6所示的方法。
计算机可读介质包括永久性和非永久性、可移动和非可移动媒体可以由任何方法或技术来实现信息存储。信息可以是计算机可读指令、数据结构、程序的模块或其他数据。计算机的存储介质的例子包括，但不限于相变内存(PRAM)、静态随机存取存储器(SRAM)、动态随机存取存储器(DRAM)、其他类型的随机存取存储器(RAM)、只读存储器(ROM)、电可擦除可编程只读存储器(EEPROM)、快闪记忆体或其他内存技术、只读光盘只读存储器(CD-ROM)、数字多功能光盘(DVD)或其他光学存储、磁盒式磁带，磁带磁磁盘存储或其他磁性存储设备或任何其他非传输介质，可用于存储可以被计算设备访问的信息。按照本文中的界定，计算机可读介质不包括暂存电脑可读媒体(transitory media)，如调制的数据信号和载波。
通过以上的实施方式的描述可知，本领域的技术人员可以清楚地了解到本说明书实施例可借助软件加必需的通用硬件平台的方式来实现。基于这样的理解，本说明书 实施例的技术方案本质上或者说对现有技术做出贡献的部分可以以软件产品的形式体现出来，该计算机软件产品可以存储在存储介质中，如ROM/RAM、磁碟、光盘等，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本说明书实施例各个实施例或者实施例的某些部分所述的方法。
上述实施例阐明的系统、方法、模块或单元，具体可以由计算机芯片或实体实现，或者由具有某种功能的产品来实现。一种典型的实现设备为计算机，计算机的具体形式可以是个人计算机、膝上型计算机、蜂窝电话、相机电话、智能电话、个人数字助理、媒体播放器、导航设备、电子邮件收发设备、游戏控制台、平板计算机、可穿戴设备或者这些设备中的任意几种设备的组合。
本说明书中的各个实施例均采用递进的方式描述，各个实施例之间相同相似的部分互相参见即可，每个实施例重点说明的都是与其他实施例的不同之处。尤其，对于方法实施例而言，由于其基本相似于方法实施例，所以描述得比较简单，相关之处参见方法实施例的部分说明即可。以上所描述的方法实施例仅仅是示意性的，其中所述作为分离部件说明的模块可以是或者也可以不是物理上分开的，在实施本说明书实施例方案时可以把各模块的功能在同一个或多个软件和/或硬件中实现。也可以根据实际的需要选择其中的部分或者全部模块来实现本实施例方案的目的。本领域普通技术人员在不付出创造性劳动的情况下，即可以理解并实施。
以上所述仅是本说明书实施例的具体实施方式，应当指出，对于本技术领域的普通技术人员来说，在不脱离本说明书实施例原理的前提下，还可以做出若干改进和润饰，这些改进和润饰也应视为本说明书实施例的保护范围。

Claims (34)

  1. 一种期望时长区间确定方法，包括：
    指定任一站点为行程起始站点，以及指定任一站点为行程终止站点；
    将所述行程起始站点和所述行程终止站点组成站点对；
    获取对应于所述站点对的多个历史行程信息；
    针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
    根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
  2. 如权利要求1所述的方法，所述行程起始站点和所述行程终止站点为同一站点。
  3. 如权利要求1所述的方法，获取对应于所述站点对的多个历史行程信息，具体包括：
    针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的站点信息和对应于行程终点的站点信息；
    若对应于行程起点的站点信息为所述行程起始站点的信息，且对应于行程终点的站点信息为所述行程终止站点的信息，则将该历史行程信息确定为对应于所述站点对的历史行程信息。
  4. 如权利要求1所述的方法，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长，具体包括：
    针对所述多个历史行程信息中的每个历史行程信息，获取该历史行程信息中包含的入站时间、出站时间；
    根据所述入站时间和所述出站时间，计算该历史行程信息对应的行程时长。
  5. 如权利要求1所述的方法，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间，具体包括：
    根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；
    根据所述概率分布对应的行程时长的期望值，确定对应于所述站点对的期望时长区间。
  6. 如权利要求5所述的方法，对应于所述站点对的期望时长区间为，(μ-N*σ，μ+N*σ)；
    其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
  7. 一种行程验证方法，包括：
    获取目标行程对应的目标行程信息；
    根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长；
    判断所述目标行程时长是否落入对应于所述站点对的期望时长区间；所述期望时长区间是根据权利要求1～6任一项所述的方法确定的；
    若是，则确定所述目标行程通过验证。
  8. 如权利要求7所述的方法，若所述目标行程时长未落入对应于所述站点对的期望时长区间，则所述方法还包括：
    确定所述目标行程未通过验证；
    或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
  9. 一种期望时长区间确定方法，针对每个站点，该站点布置有至少一个入口闸机和至少一个出口闸机，所述方法包括：
    指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机；
    将所述行程起始闸机和所述行程终止闸机组成闸机对；
    获取对应于所述闸机对的多个历史行程信息；
    针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
    根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
  10. 如权利要求9所述的方法，所述入口闸机与所述出口闸机归属于同一站点。
  11. 如权利要求9所述的方法，获取对应于所述闸机对的多个历史行程信息，具体包括：
    针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的入口闸机信息和对应于行程终点的出口闸机信息；
    若对应于行程起点的入口闸机信息为所述行程起始闸机的信息，且对应于行程终点的出口闸机信息为行程终止闸机的信息，则将该历史行程信息确定为对应于所述闸机对的历史行程信息。
  12. 如权利要求9所述的方法，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间，具体包括：
    根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；
    根据所述概率分布对应的行程时长的期望值，确定对应于所述闸机对的期望时长区间。
  13. 如权利要求12所述的方法，对应于所述闸机对的期望时长区间为，(μ-N*σ，μ+N*σ)；
    其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
  14. 一种行程验证方法，包括：
    获取目标行程对应的目标行程信息；
    根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长；
    判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；所述期望时长区间是根据权利要求9～13任一项所述的方法确定的；
    若是，则确定所述目标行程通过验证。
  15. 如权利要求14所述的方法，若所述目标行程时长未落入对应于所述闸机对的期望时长区间，则所述方法还包括：
    确定所述目标行程不通过验证；
    或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
  16. 一种期望时长区间确定装置，包括：
    指定模块，指定任一站点为行程起始站点，以及指定任一站点为行程终止站点；
    组对模块，将所述行程起始站点和所述行程终止站点组成站点对；
    获取模块，获取对应于所述站点对的多个历史行程信息；
    行程时长确定模块，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
    期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述站点对的期望时长区间。
  17. 如权利要求16所述的装置，所述行程起始站点和所述行程终止站点为同一站点。
  18. 如权利要求16所述的装置，所述获取模块，针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的站点信息和对应于行程终点的站点信息；若对应于行程起点的站点信息为所述行程起始站点的信息，且对应于行程终点的站点信息为所述行程终止站点的信息，则将该历史行程信息确定为对应于所述站点对的历史行程信息。
  19. 如权利要求16所述的装置，所述行程时长确定模块，针对所述多个历史行程信息中的每个历史行程信息，获取该历史行程信息中包含的入站时间、出站时间；根据所述入站时间和所述出站时间，计算该历史行程信息对应的行程时长。
  20. 如权利要求16所述的装置，所述期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值，确定对应于所述站点对的期望时长区间。
  21. 如权利要求20所述的装置，对应于所述站点对的期望时长区间为，(μ-N*σ，μ+N*σ)；
    其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
  22. 一种行程验证装置，包括：
    获取模块，获取目标行程对应的目标行程信息；
    确定模块，根据所述目标行程信息，确定所述目标行程信息对应的站点对和目标行程时长；
    判断处理模块，判断所述目标行程时长是否落入对应于所述站点对的期望时长区间；所述期望时长区间是根据权利要求1～6任一项所述的方法确定的；若是，则确定所述目标行程通过验证。
  23. 如权利要求22所述的装置，所述判断处理模块，若所述目标行程时长未落入对应于所述站点对的期望时长区间，则确定所述目标行程未通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
  24. 一种期望时长区间确定装置，针对每个站点，该站点布置有至少一个入口闸机和至少一个出口闸机，所述装置包括：
    指定模块，指定任一入口闸机为行程起始闸机，以及指定任一出口闸机为行程终止闸机；
    组对模块，将所述行程起始闸机和所述行程终止闸机组成闸机对；
    获取模块，获取对应于所述闸机对的多个历史行程信息；
    行程时长确定模块，针对所述多个历史行程信息中的每个历史行程信息，确定该历史行程信息对应的行程时长；
    期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定对应于所述闸机对的期望时长区间。
  25. 如权利要求24所述的装置，所述入口闸机与所述出口闸机归属于同一站点。
  26. 如权利要求24所述的装置，所述获取模块，针对每个历史行程信息，获取该历史行程信息中包含的，对应于行程起点的入口闸机信息和对应于行程终点的出口闸机信息；若对应于行程起点的入口闸机信息为所述行程起始闸机的信息，且对应于行程终点的出口闸机信息为行程终止闸机的信息，则将该历史行程信息确定为对应于所述闸机对的历史行程信息。
  27. 如权利要求24所述的装置，所述期望时长区间确定模块，根据所述多个历史行程信息分别对应的行程时长，确定以行程时长为变量的概率分布；根据所述概率分布对应的行程时长的期望值，确定对应于所述闸机对的期望时长区间。
  28. 如权利要求27所述的装置，对应于所述闸机对的期望时长区间为，(μ-N*σ，μ+N*σ)；
    其中，μ表示所述期望值，σ表示所述概率分布对应的标准差，N大于0。
  29. 一种行程验证装置，包括：
    获取模块，获取目标行程对应的目标行程信息；
    确定模块，根据所述目标行程信息，确定所述目标行程信息对应的闸机对和目标行程时长；
    判断处理模块，判断所述目标行程时长是否落入对应于所述闸机对的期望时长区间；所述期望时长区间是根据权利要求9～13任一项所述的方法确定的；若是，则确定所述目标行程通过验证。
  30. 如权利要求29所述的装置，所述判断处理模块，若所述目标行程时长未落入对应于所述闸机对的期望时长区间，确定所述目标行程未通过验证；或，为所述目标行程信息中包含的用户标识增加异常记录；若所述用户标识对应的异常记录的数量大于指定数量，则确定所述目标行程未通过验证。
  31. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求1至6任一项所述的期望时长区间确定方法。
  32. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求7或8所述的行程验证方法。
  33. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求9至13任一项所述的期望时长区间确定方法。
  34. 一种计算机设备，包括存储器、处理器及存储在存储器上并可在处理器上运行的计算机程序，其中，所述处理器执行所述程序时实现如权利要求14或15所述的行程验证方法。
PCT/CN2019/095207 2018-07-27 2019-07-09 一种期望时长区间确定方法、行程验证方法及装置 Ceased WO2020019976A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201810848269.3 2018-07-27
CN201810848269.3A CN109191174A (zh) 2018-07-27 2018-07-27 一种期望时长区间确定方法、行程验证方法及装置

Publications (1)

Publication Number Publication Date
WO2020019976A1 true WO2020019976A1 (zh) 2020-01-30

Family

ID=64937755

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2019/095207 Ceased WO2020019976A1 (zh) 2018-07-27 2019-07-09 一种期望时长区间确定方法、行程验证方法及装置

Country Status (3)

Country Link
CN (1) CN109191174A (zh)
TW (1) TWI734117B (zh)
WO (1) WO2020019976A1 (zh)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113393029A (zh) * 2021-06-11 2021-09-14 上海逸迅信息科技有限公司 一种轨交客流量的预测方法和设备

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN109191174A (zh) * 2018-07-27 2019-01-11 阿里巴巴集团控股有限公司 一种期望时长区间确定方法、行程验证方法及装置
CN111489171B (zh) * 2020-04-07 2022-10-14 支付宝(杭州)信息技术有限公司 基于二维码的乘车行程匹配方法、装置、电子设备及介质
CN112133093A (zh) * 2020-09-23 2020-12-25 佳都新太科技股份有限公司 一种快速进行乘车路径确认的方法及装置

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101470905A (zh) * 2007-12-29 2009-07-01 上海市闵行中学 一种地铁进、出口车票检验方法和系统
US20130317742A1 (en) * 2012-05-25 2013-11-28 Xerox Corporation System and method for estimating origins and destinations from identified end-point time-location stamps
CN107038562A (zh) * 2017-03-13 2017-08-11 阿里巴巴集团控股有限公司 交通分段计费的支付方法、计费系统和支付系统
CN108151756A (zh) * 2017-12-21 2018-06-12 深圳市综合交通运行指挥中心 一种城市公共交通系统的行程时间计算方法和装置
CN109191174A (zh) * 2018-07-27 2019-01-11 阿里巴巴集团控股有限公司 一种期望时长区间确定方法、行程验证方法及装置

Family Cites Families (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7221287B2 (en) * 2002-03-05 2007-05-22 Triangle Software Llc Three-dimensional traffic report
TW200516454A (en) * 2003-11-14 2005-05-16 Hon Hai Prec Ind Co Ltd System and method for dispatching vehicles
CN103310287B (zh) * 2013-07-02 2016-07-06 北京航空航天大学 基于svm预测乘客出行概率的轨道交通客流预测方法
CN107945507B (zh) * 2016-10-13 2020-08-11 腾讯科技（深圳）有限公司 行程时间预测方法及装置
CN106997621A (zh) * 2017-04-13 2017-08-01 合肥龙图腾信息技术有限公司 一种智能闸机系统和控制方法
CN107527501A (zh) * 2017-06-05 2017-12-29 交通运输部公路科学研究所 一种高速公路站间行程时间数据的构造方法以及预测高速公路行程时间的方法

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101470905A (zh) * 2007-12-29 2009-07-01 上海市闵行中学 一种地铁进、出口车票检验方法和系统
US20130317742A1 (en) * 2012-05-25 2013-11-28 Xerox Corporation System and method for estimating origins and destinations from identified end-point time-location stamps
CN107038562A (zh) * 2017-03-13 2017-08-11 阿里巴巴集团控股有限公司 交通分段计费的支付方法、计费系统和支付系统
CN108151756A (zh) * 2017-12-21 2018-06-12 深圳市综合交通运行指挥中心 一种城市公共交通系统的行程时间计算方法和装置
CN109191174A (zh) * 2018-07-27 2019-01-11 阿里巴巴集团控股有限公司 一种期望时长区间确定方法、行程验证方法及装置

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113393029A (zh) * 2021-06-11 2021-09-14 上海逸迅信息科技有限公司 一种轨交客流量的预测方法和设备
CN113393029B (zh) * 2021-06-11 2023-11-17 上海逸迅信息科技有限公司 一种轨交客流量的预测方法和设备

Also Published As

Publication number Publication date
TW202008314A (zh) 2020-02-16
TWI734117B (zh) 2021-07-21
CN109191174A (zh) 2019-01-11

Similar Documents

Publication Publication Date Title
TWI696135B (zh) 一種離線支付、業務處理、支付處理的方法及裝置
WO2020019976A1 (zh) 一种期望时长区间确定方法、行程验证方法及装置
EP3719766A1 (en) Payment collection device and method and apparatus
TWI762788B (zh) 支付風險控制方法及系統
TW201833832A (zh) 交通分段計費的支付方法、計費系統和支付系統
CN109756897B (zh) 一种车联网的认证授权机制及系统
CN112533209B (zh) 黑产识别方法及黑产识别装置
EP3790293A1 (en) Roaming charging method and apparatus
TWI709930B (zh) 基於綁定關係的聯合支付方法及系統
CN112396709A (zh) 基于超宽带通信的终端交互方法及装置、介质、电子设备
CN111325586A (zh) 基于区块链网络的票据代开方法、装置、服务器及介质
US20220084086A1 (en) Methods, systems, apparatuses, and devices for facilitating auditing tolling associated with routes
CN110175915B (zh) 一种基于区块链的业务执行结果获取方法及系统
HK40002641A (zh) 一种期望时长区间确定方法、行程验证方法及装置
CN113708943B (zh) 网间结算方法、装置、设备及存储介质
CN106332040A (zh) 一种账户资源共享的方法和装置
WO2021186708A1 (ja) 訪問推進装置、システム、方法及びプログラムが格納された非一時的なコンピュータ可読媒体
CN117787961B (zh) 一种支付票务一体化管理方法及系统
CN106096943B (zh) 基于nfc的支付方法、扣费装置及终端
US12131295B2 (en) Intellgient volunteer reporting system
CN112862466A (zh) 一种资源转移的方法及结账终端、服务器节点
CN109767230A (zh) 一种支付方法、装置及交通支付设备
JP2020071817A (ja) 情報処理方法、情報処理装置及びプログラム
HK40047873B (zh) 一种用户绑定方法及装置
CN118317321A (zh) 一种共享共建的处理方法、装置、设备、存储介质及程序产品

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 19841454

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 19841454

Country of ref document: EP

Kind code of ref document: A1