CN110717114A - Intelligent matching method and system - Google Patents
Intelligent matching method and system Download PDFInfo
- Publication number
- CN110717114A CN110717114A CN201910839800.5A CN201910839800A CN110717114A CN 110717114 A CN110717114 A CN 110717114A CN 201910839800 A CN201910839800 A CN 201910839800A CN 110717114 A CN110717114 A CN 110717114A
- Authority
- CN
- China
- Prior art keywords
- route
- category
- historical driving
- merchant information
- historical
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 28
- 238000013459 approach Methods 0.000 claims description 8
- 238000007405 data analysis Methods 0.000 abstract description 2
- 235000017166 Bambusa arundinacea Nutrition 0.000 description 1
- 235000017491 Bambusa tulda Nutrition 0.000 description 1
- 241001330002 Bambuseae Species 0.000 description 1
- 235000015334 Phyllostachys viridis Nutrition 0.000 description 1
- 239000011425 bamboo Substances 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000006185 dispersion Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000002452 interceptive effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/95—Retrieval from the web
- G06F16/953—Querying, e.g. by the use of web search engines
- G06F16/9537—Spatial or temporal dependent retrieval, e.g. spatiotemporal queries
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0631—Item recommendations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR 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/06—Buying, selling or leasing transactions
- G06Q30/0601—Electronic shopping [e-shopping]
- G06Q30/0639—Item locations
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Theoretical Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- Economics (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Navigation (AREA)
Abstract
The invention discloses an intelligent matching method and an intelligent matching system, wherein the method comprises the following steps: classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories; acquiring the current position of the automobile bound by the owner account; determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point; and determining the arrangement order of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a larger number is higher than the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a smaller number. According to the method and the device, the arrangement sequence of the merchant information passed by each route category can be determined according to the possibility of the route selection of the vehicle owner, so that the push information can meet the requirements of the user. The invention can be widely applied to the technical field of data analysis.
Description
Technical Field
The invention relates to the technical field of data analysis, in particular to an intelligent matching method and system.
Background
With the development of internet technology, a plurality of car owners use some software related to the car owners. The software is mainly used by a service owner, and has a main function of pushing service information for the owner, for example, pushing shop information to the owner so as to help the owner to find a merchant who has dinner, shops or maintains more quickly.
In most owner software, the content is pushed only according to the score of the business, or only the business information located nearby is pushed according to the current position or the end position of the owner. In practice, however, many owners will want to plan the next trip before departing. Then push is performed according to the scores, and the intention of the owner of the vehicle to want to follow the road is obviously violated. In most cases, pushing nearby businesses based on the starting location is meaningless for owners who wish to plan a trip, because the owner may be familiar with nearby businesses, and there is not necessarily a business nearby that the owner needs; most car owners do not necessarily input the terminal points which the car owners want to go to in the car owner software, so that most car owner software is difficult to intelligently push proper merchant information to the car owners.
Disclosure of Invention
To solve the above technical problems, the present invention aims to: an intelligent matching method and system are provided, so that a route which is probably traveled by a vehicle owner is presumed according to the position of the vehicle owner, and therefore merchant information on the possible travel route is sorted according to the possibility, and the merchant information along the route can be received by the vehicle owner.
A first aspect of an embodiment of the present invention provides:
an intelligent matching method, comprising the steps of:
acquiring a historical driving route of an automobile bound by an owner account;
acquiring merchant information; the merchant information comprises position coordinates;
classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories;
acquiring the current position of the automobile bound by the owner account;
determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point;
and determining the arrangement order of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a larger number is higher than the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a smaller number.
Further, the approach means a passing area where the shortest route between the starting point and the end point corresponding to the route category passes, and the passing area means an area formed by all positions where the minimum distance from the shortest route is smaller than a first set threshold.
Further, the step of classifying the historical driving route according to the starting point and the ending point of the historical driving route to obtain a plurality of route categories specifically includes:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
Further, the method also comprises the following steps:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
Further, the merchant information also includes service content.
A second aspect of an embodiment of the present invention provides:
an intelligent matching system comprising the steps of:
the acquiring unit is used for acquiring the historical driving route of the automobile bound by the owner account; acquiring merchant information; the merchant information comprises position coordinates; acquiring the current position of the automobile bound by the owner account;
the classification unit is used for classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories;
the determining unit is used for determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point;
the arranging unit is used for determining the arranging sequence of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number larger than that of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number smaller than that of the route categories.
Further, the approach means a passing area where the shortest route between the starting point and the end point corresponding to the route category passes, and the passing area means an area formed by all positions where the minimum distance from the shortest route is smaller than a first set threshold.
Further, the step of classifying the historical driving route according to the starting point and the ending point of the historical driving route to obtain a plurality of route categories specifically includes:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
Further, the method also comprises the following steps:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
Further, the merchant information also includes service content.
The embodiment of the invention has the beneficial effects that: the embodiment of the invention classifies the historical tracks, then determines the route categories to which the starting points belong according to the current starting point positions of the car owners, and then arranges the sequence of the merchant information according to the number of the route categories to which the starting points belong, so that the merchant information near the route categories with higher possibility of being selected by the car owners is ranked before the merchant information near the route categories with lower possibility of being selected by the car owners, and the pushed information can better meet the requirements of users.
Drawings
FIG. 1 is a flow chart of an intelligent matching method according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a relationship between a driving route and a route area according to an embodiment of the present invention.
Detailed Description
The invention is further described with reference to the drawings and the specific examples.
Referring to fig. 1, the present embodiment discloses an intelligent matching method, which is applied to a server side of vehicle owner service software, and a system for operating the vehicle owner service software includes a mobile side and the server side. The mobile terminal is used for collecting data, collecting vehicle owner input and providing an interactive interface for a vehicle owner. The server is communicated with the mobile terminal and is used for processing the request of the mobile terminal. Wherein, the mobile terminal can gather GPS positioning data and upload these data to the server.
For the owner of the vehicle, they may bind their vehicle to their registered account, for example, by means of a license plate and a driver's license.
As shown in fig. 1, the present embodiment includes steps S101 to S106:
s101, obtaining a historical driving route of the automobile bound by the owner account.
In this step, the historical travel route may be obtained from a database of the server. As for the data stored in the database, it can be acquired through the following various routes. The first is to obtain the information through third-party map service software, for example, a service provider accessing the OBD or a service provider accessing the vehicle-mounted map. The second is that the vehicle can be analyzed and recorded according to the GPS positioning data uploaded by the mobile terminal, so as to obtain the historical driving route of the vehicle owner, that is, the historical driving route is obtained by the mobile phone of the user.
S102, acquiring merchant information; the merchant information includes location coordinates.
The merchant information may be read in a database of the server as with the historical travel route. Of course, the source of the data can also come from the service software of a third party, and the data can also be sorted and uploaded by the operator.
S103, classifying the historical driving routes according to the starting points and the end points of the historical driving routes to obtain a plurality of route categories.
In this step, the historical travel routes may be categorized in a variety of ways. First, the principle of this step is to classify the same travel routes at the start and end points as similar, and as far as the specific routes they are going through, this is not considered, because in most cases the start and end points are the same and the deviation of the specific routes is not significant.
Then in this step, there are several embodiments provided to solve the problem of how to determine that the starting point and the ending point are consistent.
First, the ground is drawn into blocks of the same size according to the longitude and latitude, and the start point or the end point falling into the same block is regarded as the same start point or end point.
Second, a distance calculation is performed from a point to be determined as belonging to the same start point or end point based on the average coordinates of the start point or end point in the set, and if the distance is less than a certain value, the point is considered to be the same as the start point or end point in the set.
In short, whether the first starting point is the same as the starting point in a certain route set is judged, and the average coordinates of all the starting points in the route set are calculated firstly. Then, the distance between the coordinates of the first starting point and the average coordinates is calculated, and if the distance is less than a certain value, for example less than 30 meters, the same starting point is considered.
Thirdly, the nearest landmark or building is classified according to the position of the starting point or the ending point, and certainly, in order to avoid the excessive dispersion of the ending point and the starting point, the number of the landmarks and the buildings can be reduced.
And S104, acquiring the current position of the automobile bound by the owner account.
The data acquisition of the step is finished by a mobile terminal held by a user, and the mobile terminal enables a server to obtain the current position of the automobile in a data uploading mode. For example, the terminal may be a mobile phone or a vehicle-mounted large screen mounted on a vehicle.
And S105, determining all route categories to which the starting points belong by taking the current position of the automobile as the starting point.
According to the current position of the vehicle, namely the position of the starting point, the step can determine the route category to which the starting point belongs, and the route category is equivalent to the predicted terminal point which the user may go. For example, it is predicted that the user may take a route from company to home.
Of course, the number of historical travel routes in the route category can statistically represent the likelihood of a user selecting a certain destination. If the historical driving route of the owner only has three route categories, wherein the first category has thousands of historical data; the second category has 500 pieces of historical data; the third category has 10 pieces of historical data, which indicates that the user has an approximate probability of 2/3 going through the route of the first category, and only a small probability of going through the route of the third category.
S106, according to the number of the historical driving routes in each route category to which the starting point belongs, determining the arrangement sequence of the merchant information, and enabling the ranking of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number larger than that of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number smaller than that of the merchant information.
The situation discussed in the step is that the starting point belongs to more than two route categories at the same time. The case in question here is taken as the case where the starting point belongs to two route categories.
First, the concept of approaching a route category is explained, and in the present embodiment, a location approaching a route category means that the location approaches at least one historical travel route in the route category. The approach means that the minimum distance between the position and the historical travel route is less than a certain value. Then the present embodiment may now determine whether a merchant is close to the route category of the vehicle owner based on the location information of the merchant.
When a starting point belongs to two route categories at the same time, the owner of the vehicle has a great possibility of driving to the end points of the two route categories. However, the possibilities of the vehicle owner selecting the two route categories are different, and as for the parameter for judging the possibilities, the parameter is how many historical driving routes are in each route category. If the number of historical travel routes in a route category is high, the greater the likelihood that the owner will go to the end of the route, and the greater the likelihood that the owner will select a route, the greater the likelihood that he will consume along the route. Merchants who are likely to be selected by the owner and who are routed on the route can be preferentially recommended.
The manner in which merchant information is arranged is discussed below.
In the present embodiment, it is assumed that the start point of the vehicle owner belongs to both the first route category in which 1000 historical travel routes exist and the second route category in which 500 historical travel routes exist.
Then, in the sorting, the information of the merchants passing by the first route category may be all placed in front of the information of the merchants passing by the second route category. However, this is clearly not an optimal choice.
In some embodiments, the merchants passing through the two route categories may be ranked first, according to the size of the score. And then arranging the merchant information in the form of the plum blossom bamboo. Specifically, the merchant information routed by the first route category may be sequentially ranked at the 1 st, 3 rd, and 5 … … th bits according to the score, and the merchant information routed by the second route category may be sequentially ranked at the 2 nd, 4 th, and 6 … … th bits.
Of course, in some embodiments, the number of choreographies may also be adjusted according to the likelihood of the route category selected by the vehicle owner. For example, the probability ratio of the user selecting the first route category and the second route category is 2: 1. then, when the arrangement of the merchant information is performed, the number of arranged merchants passing through the respective route categories can be adjusted according to the proportion. For example, the 1 st, 2 nd, 4 th and 5 th positions arrange the information of the merchants through which the first route category passes, and the 3 rd and 6 th positions arrange the information of the merchants through which the second route category passes.
For the arrangement mode, the arrangement mode can be combined with parameters such as merchant types and the like, and the arrangement mode is not exhaustive.
In the embodiment, the historical tracks are classified, the route categories to which the starting points belong are determined according to the current starting point positions of the car owners, and the order of the merchant information is arranged according to the number of the route categories to which the starting points belong, so that the merchant information near the route categories with high possibility of being selected by the car owners is ranked before the merchant information near the route categories with low possibility of being selected by the car owners, and the pushed information can better meet the requirements of users.
As a preferred embodiment, the approach is an area where a shortest route between a start point and an end point corresponding to a route category passes, and the passing area is an area formed by all positions where a minimum distance from the shortest route is smaller than a first set threshold.
As shown in fig. 2, the passing area of the route a is an area B, where the minimum distance from any point in the area B to the route a is smaller than or equal to r. Therefore, the passing area of the route a can also be understood as an intersection area of circles of radius r made with all points on the route a.
The present embodiment explains the classification of the historical travel routes as a preferred embodiment.
The method comprises the following steps of classifying historical driving routes according to starting points and end points of the historical driving routes to obtain a plurality of route categories, wherein the route categories specifically comprise:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
According to the method and the device, the historical driving routes are classified through the starting points and the end points, the specific routes of the historical driving routes do not need to be analyzed, the operation is simple, and many unnecessary detailed contents can be shielded.
As a preferred embodiment, the method further comprises the following steps:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
The embodiment can push according to the refreshing instruction of the user, and can also push to the user actively.
In this embodiment, the cart may be pushed on a large screen or to a mobile phone of the user.
As a preferred embodiment, the merchant information further includes service content.
The embodiment discloses an intelligent matching system, which comprises the following steps:
the acquiring unit is used for acquiring the historical driving route of the automobile bound by the owner account; acquiring merchant information; the merchant information comprises position coordinates; acquiring the current position of the automobile bound by the owner account;
the classification unit is used for classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories;
the determining unit is used for determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point;
the arranging unit is used for determining the arranging sequence of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number larger than that of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number smaller than that of the route categories.
As a preferred embodiment, the approach is an area where a shortest route between a start point and an end point corresponding to a route category passes, and the passing area is an area formed by all positions where a minimum distance from the shortest route is smaller than a first set threshold.
As a preferred embodiment, the classifying the historical driving route according to the starting point and the ending point of the historical driving route to obtain a plurality of route categories specifically includes:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
As a preferred embodiment, the method further comprises the following steps:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
As a preferred embodiment, the merchant information further includes service content.
The system embodiment corresponds to the method embodiment, and the technical effects which can be achieved by the corresponding method embodiment can be achieved.
The step numbers in the above method embodiments are set for convenience of illustration only, the order between the steps is not limited at all, and the execution order of each step in the embodiments can be adapted according to the understanding of those skilled in the art.
While the preferred embodiments of the present invention have been illustrated and described, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (10)
1. An intelligent matching method is characterized in that: the method comprises the following steps:
acquiring a historical driving route of an automobile bound by an owner account;
acquiring merchant information; the merchant information comprises position coordinates;
classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories;
acquiring the current position of the automobile bound by the owner account;
determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point;
and determining the arrangement order of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a larger number is higher than the ranking of the merchant information of the route category with the position coordinate close to the historical driving route with a smaller number.
2. The intelligent matching method according to claim 1, wherein: the approach is an area where the shortest route passes between a starting point and an end point corresponding to the route category, and the passing area is an area formed by all positions where the minimum distance from the shortest route is smaller than a first set threshold.
3. The intelligent matching method according to claim 1, wherein: the method for classifying the historical driving routes according to the starting points and the end points of the historical driving routes to obtain a plurality of route categories specifically comprises the following steps:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
4. The intelligent matching method according to claim 1, wherein: further comprising the steps of:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
5. The intelligent matching method according to any one of claims 1-4, wherein: the merchant information also includes service content.
6. An intelligent matching system, characterized by: the method comprises the following steps:
the acquiring unit is used for acquiring the historical driving route of the automobile bound by the owner account; acquiring merchant information; the merchant information comprises position coordinates; acquiring the current position of the automobile bound by the owner account;
the classification unit is used for classifying the historical driving route according to the starting point and the end point of the historical driving route to obtain a plurality of route categories;
the determining unit is used for determining all route categories to which the starting point belongs by taking the current position of the automobile as the starting point;
the arranging unit is used for determining the arranging sequence of the merchant information according to the number of the historical driving routes in each route category to which the starting point belongs, so that the ranking of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number larger than that of the merchant information of the route category with the position coordinates close to the historical driving routes and with the number smaller than that of the route categories.
7. The intelligent matching system of claim 6, wherein: the approach is an area where the shortest route passes between a starting point and an end point corresponding to the route category, and the passing area is an area formed by all positions where the minimum distance from the shortest route is smaller than a first set threshold.
8. The intelligent matching system of claim 6, wherein: the method for classifying the historical driving routes according to the starting points and the end points of the historical driving routes to obtain a plurality of route categories specifically comprises the following steps:
judging whether the historical driving route belongs to the existing route category, if so, classifying the historical driving route into the existing route category, otherwise, creating a new route category, and classifying the historical driving route into the new route category;
wherein the step of judging whether the historical travel route belongs to the existing route category comprises:
calculating a distance between coordinates of a starting point of the historical travel route and an average coordinate of starting points of all historical travel routes in the existing route category as a first distance;
calculating a distance between the coordinates of the end point of the historical travel route and the average coordinates of the end points of all the historical travel routes in the existing route category as a second distance;
and when the existing route category exists, and the first distance and the second distance are both smaller than a second set threshold value, determining that the historical driving route belongs to the route category.
9. The intelligent matching system of claim 6, wherein: further comprising the steps of:
and pushing merchant information to the vehicle owner account according to the arrangement sequence of the merchant information.
10. An intelligent matching system according to any of claims 6-9, wherein: the merchant information also includes service content.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910839800.5A CN110717114A (en) | 2019-09-03 | 2019-09-03 | Intelligent matching method and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910839800.5A CN110717114A (en) | 2019-09-03 | 2019-09-03 | Intelligent matching method and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110717114A true CN110717114A (en) | 2020-01-21 |
Family
ID=69210294
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910839800.5A Pending CN110717114A (en) | 2019-09-03 | 2019-09-03 | Intelligent matching method and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110717114A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338054A (en) * | 2015-09-21 | 2016-02-17 | 百度在线网络技术（北京）有限公司 | Method and device for pushing voice information |
| CN106643771A (en) * | 2016-12-30 | 2017-05-10 | 上海博泰悦臻网络技术服务有限公司 | Navigation route selection method and system |
| CN108228811A (en) * | 2017-12-29 | 2018-06-29 | 上海爱优威软件开发有限公司 | Information recommendation method and system |
| CN108286980A (en) * | 2017-12-29 | 2018-07-17 | 广州通易科技有限公司 | A method of prediction destination and recommendation drive route |
| CN108489503A (en) * | 2018-03-30 | 2018-09-04 | 斑马网络技术有限公司 | Point of interest commending system and its recommendation method |
| US20190145779A1 (en) * | 2017-11-10 | 2019-05-16 | Bayerische Motoren Werke Aktiengesellschaft | Methods and Apparatuses for Predicting a Destination of a User's Current Travel Path |
-
2019
- 2019-09-03 CN CN201910839800.5A patent/CN110717114A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105338054A (en) * | 2015-09-21 | 2016-02-17 | 百度在线网络技术（北京）有限公司 | Method and device for pushing voice information |
| CN106643771A (en) * | 2016-12-30 | 2017-05-10 | 上海博泰悦臻网络技术服务有限公司 | Navigation route selection method and system |
| US20190145779A1 (en) * | 2017-11-10 | 2019-05-16 | Bayerische Motoren Werke Aktiengesellschaft | Methods and Apparatuses for Predicting a Destination of a User's Current Travel Path |
| CN108228811A (en) * | 2017-12-29 | 2018-06-29 | 上海爱优威软件开发有限公司 | Information recommendation method and system |
| CN108286980A (en) * | 2017-12-29 | 2018-07-17 | 广州通易科技有限公司 | A method of prediction destination and recommendation drive route |
| CN108489503A (en) * | 2018-03-30 | 2018-09-04 | 斑马网络技术有限公司 | Point of interest commending system and its recommendation method |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11620592B2 (en) | Systems and methods for planning transportation routes | |
| US9020760B2 (en) | System for classifying streets for vehicle navigation | |
| EP3620336A1 (en) | Method and apparatus for using a passenger-based driving profile | |
| EP3690403B1 (en) | Method and apparatus for providing mobility insight data for points of interest | |
| EP3620972A1 (en) | Method and apparatus for providing a user reaction user interface for generating a passenger-based driving profile | |
| EP3620971A1 (en) | Method and apparatus for generating a passenger-based driving profile | |
| US10894547B2 (en) | Method, apparatus, and system for assessing safety and comfort systems of a vehicle | |
| CN107063285A (en) | With city trip service implementing method, device and system | |
| EP3621007A1 (en) | Method and apparatus for selecting a vehicle using a passenger-based driving profile | |
| CN105210119A (en) | Determining an amount for a toll based on location data points provided by a computing device | |
| US20200210905A1 (en) | Systems and Methods for Managing Networked Vehicle Resources | |
| CN107421555B (en) | Method and device for determining navigation path | |
| Hora et al. | Estimation of Origin-Destination matrices under Automatic Fare Collection: the case study of Porto transportation system | |
| CN105528903A (en) | Suggestive mapping using relevance based drive information | |
| CN104697541A (en) | Method for providing trip-associated information | |
| CN112805762B (en) | System and method for improving traffic condition visualization | |
| CN115083161B (en) | Vehicle stay point evaluation method and device, electronic equipment and readable storage medium | |
| CN115655301A (en) | Vehicle navigation route selection method and device, electronic equipment and medium | |
| CN113869652A (en) | Shared bicycle returning planning method, device, equipment and storage medium | |
| CN107622467A (en) | A kind of commuter schema extraction method and device | |
| CN110717114A (en) | Intelligent matching method and system | |
| US20230028461A1 (en) | Identification of connection patterns on the basis of trajectory data | |
| EP3965043A1 (en) | Automated autonomous vehicle recommendations based on personalized transition tolerance | |
| KR20230036309A (en) | Car recommendation system for car sharing service and methoe thereof | |
| CN112304326A (en) | Travel route planning method, equipment and storage medium |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20200121 |