CN111144904B - Merchant recall method and device, electronic equipment and readable storage medium - Google Patents
Merchant recall method and device, electronic equipment and readable storage medium Download PDFInfo
- Publication number
- CN111144904B CN111144904B CN201911319990.4A CN201911319990A CN111144904B CN 111144904 B CN111144904 B CN 111144904B CN 201911319990 A CN201911319990 A CN 201911319990A CN 111144904 B CN111144904 B CN 111144904B
- Authority
- CN
- China
- Prior art keywords
- hash
- merchant
- area
- merchants
- hash area
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- 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/01—Customer relationship services
- G06Q30/014—Providing recall services for goods or products
-
- 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]
Landscapes
- Business, Economics & Management (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Development Economics (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The disclosure provides a merchant recalling method, a merchant recalling device, electronic equipment and a readable storage medium, wherein merchants located in first hash areas can be recalled according to first hash codes aiming at each first hash area of a first hash area set to obtain a first merchant set of the first hash areas, and the first hash areas correspond to first hash codes with first digits; for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold, acquiring a second hash area set divided by the first hash area, wherein the second hash area set comprises a second hash area, the second hash area corresponds to a second hash code with a second digit, and the first digit is less than the second digit; and for each second hash area, according to the second hash code, recalling the merchants with the distribution range having the overlapping area with the second hash area from the second merchant set to obtain a third merchant set of the second hash area. The present disclosure may help reduce consumption of computer resources.
Description
Technical Field
The present disclosure relates to the field of OTO technologies, and in particular, to a merchant recall method and apparatus, an electronic device, and a readable storage medium.
Background
In the technical field of OTO (Online To Offline), a user places an order in a network sales platform To purchase goods or enjoy services. The network sales platform can push merchants to the user in the form of an activity, and the pushed merchants need to be recalled in advance.
In the prior art, a commonly used merchant recalling method determines a recalling merchant from all merchants on a network sales platform based on preset rules. For example, a merchant with "the composite score is greater than 4 points" may be used as the recalling merchant, and a merchant with "the preferential degree is greater than 1 discount" may also be used as the recalling merchant.
After the inventor researches the scheme, the scheme is easy to cause that certain positions have no or insufficient recalled merchants, and in order to ensure that the recalled merchants are sufficient, the positions with insufficient merchants need to be recalled one by one, so that more computer resources are consumed.
Disclosure of Invention
The utility model provides a merchant recalling method, device, electronic equipment and readable storage medium, can recall for the first time to first hash region to recall for the second time to the second hash region that is smaller when the merchant number of recalling for the first time is not enough, guarantee to recall the merchant and cover every position, thereby do not need to recall one by one position, help to reduce the consumption of computer resource.
According to a first aspect of the present disclosure, there is provided a merchant recalling method, the method comprising:
acquiring a first hash area set, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit;
for each first hash area, recalling merchants located in the first hash area according to the first hash code of the first hash area to obtain a first merchant set of the first hash area;
for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold of the first hash area, acquiring a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is less than the second bit number;
and for each second hash area, according to a second hash code of the second hash area, recalling merchants with overlapping areas between a distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area, where the second merchant set includes merchants other than the first hash merchant set of each first hash area.
According to a second aspect of the present disclosure, there is provided a merchant recall apparatus comprising:
the device comprises a first hash area set acquisition module, a second hash area set acquisition module and a first hash area setting module, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit;
a first merchant recalling module, configured to recall, for each first hash area, a merchant located in the first hash area according to a first hash code of the first hash area, so as to obtain a first merchant set of the first hash area;
a second hash area set obtaining module, configured to, for each first hash area, obtain, if a number of merchants included in a first merchant set of the first hash area is smaller than a first merchant number threshold of the first hash area, a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is smaller than the second bit number;
and the second merchant recalling module is used for recalling merchants with overlapping areas of the distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area according to the second hash code of the second hash area for each second hash area, wherein the second merchant set comprises merchants except the first hash merchant set of each first hash area.
According to a third aspect of the present disclosure, there is provided an electronic device comprising:
a processor, a memory, and a computer program stored on the memory and executable on the processor, the processor implementing the aforementioned merchant recall method when executing the program.
According to a fourth aspect of the present disclosure, there is provided a readable storage medium, wherein instructions, when executed by a processor of an electronic device, enable the electronic device to perform the aforementioned merchant recall method.
The disclosure provides a merchant recalling method, a merchant recalling device, electronic equipment and a readable storage medium, wherein the method comprises the following steps: acquiring a first hash area set, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit; for each first hash area, recalling merchants located in the first hash area according to the first hash code of the first hash area to obtain a first merchant set of the first hash area; for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold of the first hash area, acquiring a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is less than the second bit number; and for each second hash area, according to a second hash code of the second hash area, recalling merchants with overlapping areas between a distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area, where the second merchant set includes merchants other than the first hash merchant set of each first hash area. This is disclosed can carry out the recall for the first time to first hash region to carry out the recall for the second time to littleer second hash region when the merchant figure of recalling for the first time is not enough, guarantee to recall every position of merchant cover, thereby need not recall again position one by one, help reducing the consumption of computer resource.
Drawings
In order to more clearly illustrate the technical solutions of the present disclosure, the drawings needed to be used in the description of the present disclosure will be briefly introduced below, and it is apparent that the drawings in the following description are only some embodiments of the present disclosure, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without inventive labor.
FIG. 1 illustrates a flow chart of steps of a merchant recall method in one embodiment of the present disclosure;
FIG. 2 illustrates a relationship diagram of a reference hash region and a dispatch area of the present disclosure;
FIG. 3 illustrates a block diagram of a merchant recall device in one embodiment of the present disclosure;
FIG. 4 shows a block diagram of an electronic device in an embodiment of the disclosure.
Detailed Description
The technical solutions in the present disclosure will be described clearly and completely with reference to the accompanying drawings in the present disclosure, and it is obvious that the described embodiments are some, not all embodiments of the present disclosure. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the disclosure without making any creative effort, shall fall within the protection scope of the disclosure.
The method and the system can be applied to a background server of a network sales platform, and the background server can recall the merchants and recommend the recalled merchants to users so as to improve the sales volume, the order quantity, the conversion rate and the like of the recalled merchants. The network sales platform can be an instant distribution platform, such as a takeaway platform.
Example one
Referring to fig. 1, a flowchart illustrating steps of a merchant recall method in an embodiment of the present disclosure is shown, specifically as follows:
step 101, a first hash area set is obtained, the first hash area set includes at least one first hash area, and the first hash area corresponds to a first hash code with a first number of bits.
The first hash region set comprises a plurality of hash regions obtained by dividing the designated region according to a first-digit geohash algorithm, the hash regions are called first hash regions, the digit of the first hash code is the first digit, and the first hash code is the unique identifier of the first hash region.
The geohash algorithm is an algorithm for establishing a spatial index, and the number of hash regions obtained by dividing the algorithm is related to the number of bits adopted by the geohash algorithm. For the same designated area, if the geohash algorithm with larger digit is adopted for division, the more the number of the hash areas obtained by division is, the smaller the size of each hash area is; if the geohash algorithm with a smaller number of bits is adopted for division, the smaller the number of the hash regions obtained by division, the larger the size of each hash region. For example, for a city, the number of hash regions divided by the 8-bit geohash algorithm is the number of hash regions divided by the 7-bit geohash algorithm, and the size of each hash region divided by the 8-bit geohash algorithm is smaller than the size of each hash region divided by the 7-bit geohash algorithm.
It can be understood that, in practical applications, the first hash region set may be a hash region set obtained by pre-dividing, so that the first hash region set can be directly obtained by querying from the database, and at this time, it is not necessary to divide a region into hash region sets in real time, which is beneficial to reducing the time consumed by the merchant recall.
102, for each first hash area, recalling merchants located in the first hash area according to the first hash code of the first hash area to obtain a first merchant set of the first hash area.
The merchants need to specify the locations of the merchants on the map when registering with the network sales platform, and the merchants may be all merchants on the network sales platform, or all merchants in a specified area, or a part of merchants meeting preset conditions. The merchant is not limited by this disclosure.
The first set of merchants may include all merchants located in the first hash region. Specifically, in an embodiment of determining the first merchant set, first, a first-digit hash operation may be performed on the position of each merchant to obtain a merchant hash code of each merchant; then, since there may be a plurality of first hash regions, for each first hash region, all merchants with the same merchant hash code as the first hash code of the first hash region are determined as the first merchant set of the first hash region. In another embodiment of determining the first merchant set, first, an area range represented by the longitude and latitude of each first hash area is obtained from a database of the storage area range according to the first hash code; then, for each first hash region, all merchants whose positions are within the range of the first hash region are taken as a first merchant set of the first hash region.
In addition, the first set of merchants may also include portions of merchants located in the first hash region. Specifically, in an embodiment of determining the first merchant set, first, a first-digit hash operation may be performed on the position of each merchant to obtain a merchant hash code of each merchant; then, as a plurality of first hash regions may exist, for each first hash region, determining all merchants with the same merchant hash codes as the first hash codes of the first hash region, and arranging the merchants in a descending order according to the merchant scores, the merchant sales and other indexes to obtain a merchant list; finally, for each first hash region, the top part of merchants in the merchant list of the first hash region may be used as the first merchant set of the first hash region. In another embodiment of determining the first merchant set, first, an area range represented by the longitude and latitude of each first hash area is acquired from a database storing the area ranges according to the first hash codes; then, aiming at each first hash area, acquiring all the commercial tenants with the positions within the area range of the first hash area, and arranging the commercial tenants in a descending order according to the indexes such as commercial tenant scores and commercial tenant sales volume to obtain a commercial tenant list; finally, for each first hash region, the top part of merchants in the merchant list of the first hash region may be used as the first merchant set of the first hash region.
Step 103, for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold of the first hash area, obtaining a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is less than the second bit number.
The first merchant number threshold is the minimum number of recalled merchants in the first hash area, and the merchant number threshold may be set according to the size of the first hash area and an actual application scenario, which is not limited in the embodiments of the present disclosure. It can be understood that the smaller the first digit number is, and thus the larger the first hash region is, the larger the value of the first merchant number threshold value can be set; the larger the first number of bits and thus the smaller the first hash region, the smaller the first merchant number threshold may be set to.
Based on the first merchant number threshold, when the number of merchants included in the first merchant set in the first hash area recalled in step 102 is less than the first merchant number threshold in the first hash area, it represents that the number recalled in step 102 is insufficient, and a recall is required; when the number of merchants included in the first merchant set of the first hash region recalled in step 102 is greater than or equal to the first merchant number threshold of the first hash region, the number recalled in step 102 is sufficient, and no recall is required.
Specifically, when a recall is performed, a second hash region set into which the first hash region is further divided needs to be acquired, where a second hash region included in the second hash region set is smaller than the first hash region, that is: the first hash region includes a number of second hash regions. The second hash area set may be obtained by dividing the first hash area in advance according to the second-digit geohash algorithm, or may be obtained by obtaining the second-digit geohash algorithm hash area set obtained by dividing in advance from the database, and then selecting the second hash area belonging to the first hash area from the second hash area set.
In practical applications, in order to ensure that the first hash region is larger than the second hash region, the first hash region includes a plurality of second hash regions, and the first number of bits needs to be smaller than the second number of bits. For example, the first number of bits may be 7 bits, and the second number of bits may be 8 bits, that is, the first number of bits is 7 bits in length of the first hash code, and the second number of bits is 8 bits in length of the second hash code.
And 104, for each second hash region, according to a second hash code of the second hash region, recalling merchants with overlapping regions between a distribution range and the second hash region from a second merchant set to obtain a third merchant set of the second hash region, where the second merchant set includes merchants other than the first hash merchant set of each first hash region.
The first merchant set and the second merchant set may form a total merchant set (hereinafter referred to as a fourth merchant set), and the fourth merchant set may be all merchants on the network sales platform, or all merchants in a specified area or a part of merchants meeting a preset condition.
The third merchant set may include all merchants in the second merchant set whose distribution ranges overlap with the second hash region. Specifically, in an embodiment of determining the second merchant set, first, for each second hash area, a target location corresponding to the second hash area, that is, a target location corresponding to the same hash code, is determined; then, for each second target hash block, carrying out average operation on all target positions corresponding to the second target hash block to obtain a central point of the second target hash block; finally, whether the central point is located in the distribution range of the commercial tenant or not is determined, and if the central point is located in the distribution range of the commercial tenant, the commercial tenant is added into a third commercial tenant set; and if the central point is not located in the distribution range of the merchant, continuously determining whether the central point of the next second target hash block is located in the distribution range of the merchant, and if any second target hash block does not exist and the central point is located in the distribution range of the merchant, not adding the merchant to a third merchant set.
After two recalls of steps 102 and 104, the first merchant set of all the first hash regions and the third merchant set of all the second hash regions may be recommended to the user in an exhibition manner as a recalling merchant set, so that the user visits the merchant or purchases the order of the merchant. For example, an event with a certain theme may be displayed on a user client corresponding to the network sales platform, and if the user clicks on the event, the set of recalled merchants may be displayed on the user client according to a distance from the user location, the merchants closer to the user location in the set of recalled merchants are displayed at a front location, and the merchants farther from the user location in the set of recalled merchants are displayed at a rear location.
It can be understood that in the embodiment of the disclosure, the recalled merchants collectively include merchants that have been recalled initially according to location and merchants that have been recalled additionally according to distribution range, so that each geographic location corresponds to a certain number of recalled merchants, which is beneficial to improving the conversion rate of the event.
Optionally, in another embodiment of the present disclosure, the step 101 includes sub-steps a1 to a 2:
sub-step a1, performing a first-digit hash operation on at least one target location to obtain a target hash code.
Wherein the target location includes but is not limited to: the ordering position of the user at the historical time, the positioning position of the user when the user visits the merchant at the historical time, and the specified address position of the merchant. When the target position is the ordering position, the merchant can not be recalled and the effect of the event can not be greatly influenced for the positions which are only browsed by a large number of users but not ordered. In the embodiment of the disclosure, the more the number of the target positions is, the more the number of the obtained target hash codes is, so that the more positions on the map correspond to the recalling merchants, and the better the recalling effect is.
In the embodiment of the disclosure, a first-digit hash operation is performed on a large number of target positions to obtain a large number of target hash codes corresponding to the large number of target positions, so that for a plurality of target positions in the target positions, if the target hash codes of the target positions are the same, the target hash regions corresponding to the target positions are the same, and the identifier of the target hash region may be the target hash code.
And a substep a2, obtaining a hash region corresponding to the target hash code from a preset hash region set, to obtain a first hash region set.
The preset hash area set comprises a plurality of hash areas obtained by dividing the designated area by adopting a first-digit geohash algorithm, the first hash area set is a subset filtered from the hash area sets, the hash code of each hash area in the first hash area set is provided with a corresponding target hash code, and the target hash code is the hash code of a target position, so that the first hash area set comprises the hash area where the target position is located.
When the target position is the ordering position of the user in the historical time, each first Hash area in the first Hash area set has a historical ordering behavior, so that the merchant recalls of the area with the historical ordering behavior; when the target position is the positioning position when the user accesses the merchant at the historical time, each first hash area in the first hash area set has the historical access behavior, so that the merchant recalling in the area with the historical access behavior is realized; when the target position is the appointed address position where the merchant is required, each first hash area in the first hash area set comprises the appointed geographic position, so that the merchant recalling of the appointed geographic position is realized; meanwhile, the merchant recalls are not carried out on the areas which do not have historical ordering behaviors, historical access behaviors and designated geographic positions, the recalling cost is saved, the conversion rate of the recalled merchants is guaranteed as much as possible, and the merchant recalling at the designated positions is realized.
Optionally, in another embodiment of the present disclosure, the step 104 includes sub-steps B1 to B2:
and a substep B1, acquiring, for each merchant in the second merchant set, a reference hash code set of the merchant, where the reference hash code set of the merchant includes at least one reference hash code with a second digit, and the reference hash code is a hash code of a hash region obtained by dividing the distribution range of the merchant.
It is understood that the size of the hash region corresponding to the reference hash code is the same as the size of the second hash region. The reference hash code can be obtained by calculating the longitude and latitude of each position in the distribution range, in practical application, the size of the hash area of the second digit can be estimated, and the hash code of the second digit can be calculated by taking one position at a certain distance according to the size and used as the reference hash code. For example, if the size of the hash region of the second number of bits is estimated to be W × H, a position may be taken every W or a little smaller interval in longitude and every H or a little smaller interval in latitude to calculate the reference hash code. Therefore, the most complete reference hash code set can be obtained, and any hash area in the distribution range is avoided being missed.
Sub-step B2, for each second hash region, recalling the merchants in the reference hash code set that include the second hash codes of the second hash region, to obtain a third merchant set of the second hash region.
It can be understood that if one reference hash code in the reference hash code set of one merchant is the same as the second hash code in the second hash region, it represents that the distribution range of the merchant overlaps with the second hash region, that is, the distribution range of the merchant covers the second hash region, so that the merchant can be added to a third merchant set in the second hash region.
The distribution range of the merchant can be divided into the hash areas to obtain the reference hash code set, so that whether the distribution range of the merchant is overlapped with the second hash area or not can be accurately determined based on the reference hash code set.
Optionally, in another embodiment of the present disclosure, the sub-step B2 includes sub-steps C1 to C2:
sub-step C1, determining the number of merchants located in the second hash region from the first merchant set in the first hash region to which the second hash region belongs, to obtain the recalled number of the second hash region.
The first hash region to which the second hash region belongs may be determined according to the first hash codes and the second hash codes, and if the first hash code of one of the first hash regions is the beginning portion of the second hash code of one of the second hash regions, it is determined that the second hash region belongs to the first hash region. For example, a first hash region has a first hash code of wx4g0e and a second hash region has a second hash code of wx4g0e1, and the second hash region belongs to the first hash region since wx4g0e is the beginning of wx4g0e 1. In addition, the first hash region to which the second hash region belongs may also be determined according to the mapping relationship between the remaining first hash regions and the second hash region.
Specifically, first, performing hash operation of a second digit on the position of each merchant in the first merchant set to obtain a hash code corresponding to each merchant in the first merchant set; the hash code of the location of each merchant may also be recorded as the merchant hash code at the time of the recall at step 102; then, for each second hash area, counting the number of merchants with the same merchant hash codes of the first merchant set and the second hash codes of the second hash area to obtain merchants located in the second hash area, so that the number of merchants is the recalled number of the second hash area.
Sub-step C2, if the recalled number of the second hash region is smaller than the second threshold of the number of merchants in the second hash region, recalling a target number of merchants from the merchants in the reference hash code set that include the second hash code in the second hash region, where the target number is obtained by subtracting the recalled number of the second hash region from the threshold of the number of merchants in the second hash region.
The second merchant number threshold is the minimum number of recalled merchants in the second hash area, and the merchant number threshold may be set according to the size of the second hash area and an actual application scenario, which is not limited in the embodiments of the present disclosure. It is understood that the smaller the second number of bits, and thus the larger the second hash region, the larger the value of the second merchant number threshold may be set; the larger the second number of bits and thus the smaller the second hash region, the smaller the value of the second merchant-number threshold may be set.
The target number is the number of merchants to recall. Of course, if the number of recalled merchants is greater than or equal to the first threshold number of merchants, the number of merchants recalled in step 102 is already up to the requirement, and no additional recalls are needed.
In the embodiment of the disclosure, the target number of recalls can be performed according to the second hash regions, so that the number of the merchants recalled in each second hash region is controlled to be basically equivalent, and the distribution uniformity of the recalled merchants is improved.
Optionally, in another embodiment of the present disclosure, the merchant identifier of the merchant and the reference hash code set of the merchant are stored in a preset embedded storage system in advance according to a corresponding relationship; the sub-step B1 includes sub-steps D1 to D2:
sub-step D1, determining a merchant identification of the merchant.
The merchant identification can be automatically generated when the merchant registers on the network sales platform, and is the unique identity identification of the merchant on the network sales platform.
And a substep D2, querying the reference hash code set of the merchant from a preset embedded storage system according to the merchant identifier.
The embedded storage system is a special query system, and the query processing performance of the embedded storage system is high, so that the recall speed of merchants is improved.
In practical application, the reference hash code set of each merchant may be obtained first, and then the merchant identifier of each merchant and the reference hash code set of the merchant are stored in the embedded storage system according to the corresponding relationship. The reference hash code set of each merchant can be obtained in advance through the following processes:
firstly, determining distribution range parameters of each merchant, wherein the distribution range parameters at least comprise: maximum longitude, minimum longitude, maximum latitude, minimum latitude.
In practical applications, the distribution range of each merchant may be represented by a series of boundary points, so that the area enclosed by the boundary points is the distribution range of the merchant. Where each boundary point is represented by a longitude and latitude for its location. So that the maximum longitude and the minimum longitude can be selected from the longitudes of the boundary points, and the maximum latitude and the minimum latitude can be selected from the latitudes of the boundary points.
Secondly, for each merchant, dividing a distribution range of the merchant into a reference hash area based on a second digit according to a matrix area formed by the maximum longitude, the minimum longitude, the maximum latitude and the minimum latitude, wherein the reference hash codes of the reference hash area form a reference hash code set of the user.
In the embodiment of the present disclosure, the areas determined by the maximum longitude, the minimum longitude, the maximum latitude and the minimum latitude may be set as rectangles, as shown in fig. 2, the elliptical areas where the points P1, P2, P3 and P4 are located may be distribution ranges, the longitude of the point P1 corresponds to the minimum longitude, the longitude of the point P3 corresponds to the maximum longitude, the latitude of the point P4 corresponds to the minimum latitude, and the latitude of the point P2 corresponds to the maximum latitude, so that for each position in the rectangular area formed by the points P1, P2, P3 and P4, it is determined whether the position belongs to the distribution range, if the position belongs to the distribution range, the position is hashed by the second number to obtain one reference hash code in the reference hash code set, and the position where the reference hash codes are the same constitutes one reference hash area; if not, the position is directly discarded. Referring to fig. 2, the oval distribution range is divided into a plurality of reference hash areas, and each small square in fig. 2 is a reference hash area.
It should be noted that, in fig. 2, the hash region on the boundary of the distribution range includes at least one point within the distribution range, that is, the hash region may be used as a reference hash region; in addition, whether the hash area is used as the reference hash area may be determined according to an overlapping area of the hash area and the oval distribution range, for example, if the size of the overlapping area accounts for more than 50% of each hash area, the hash area is used as the reference hash area.
Optionally, in another embodiment of the present disclosure, the step 102 includes sub-steps E1 to E3:
and a substep E1, performing hash operation with a first digit on the location of the merchant to obtain a merchant hash code for each merchant in the fourth merchant set.
The fourth merchant set is a set of the first merchant set and the second merchant set, and the first merchant set and the second merchant set do not contain the same merchants.
It is understood that the length of the merchant hash code is the same as the length of the first hash code of the first hash region.
And a substep E2, for each first hash region, obtaining, from the fourth merchant set, merchants whose merchant hash codes are the same as the first hash codes of the first hash region, to obtain a fifth merchant set of the first hash region.
It will be appreciated that the hash code is calculated for locations represented by latitude and longitude, such that if two locations are in close proximity, the hashes of the two locations are close or even identical. Therefore, for a merchant, if the merchant hash code of the merchant is the same as the hash code of one of the hash areas, it can be determined that the merchant is located in the first hash area.
And a substep E3, for each first hash region, obtaining merchants meeting preset conditions from the fifth merchant set in the first hash region according to a preset proportion to obtain a first merchant set.
The preset ratio is a ratio of the number of merchants included in the first merchant set to the number of merchants included in the fifth merchant set in each first hash area, and may be set according to an actual application scenario, which is not limited in the embodiments of the present disclosure.
The preset condition may be different according to different themes, for example, for the theme of the full-down activity, the full-down amount exceeding the preset full-down amount may be used as the preset condition. The embodiment of the disclosure can filter out merchants which do not meet the preset condition, so that the obtained first merchant set can be ensured to be in accordance with the set theme.
In one embodiment of determining the first merchant set, first, merchants which do not meet preset conditions are filtered from a fifth merchant set, and then the filtered fifth merchant set is sorted in a descending order according to indexes such as comprehensive scores and sales volumes; and finally, selecting the merchants in the front ranking according to a preset proportion to obtain a first merchant set. For example, if one of the first hash regions includes the following merchants: SLR1, SLR2, SLR3, SLR4, SLR5, SLR6, SLR7, SLR8, SLR9, and SLR10, then the merchants that do not meet the preset conditions can be filtered out first, and the merchant list is obtained in order: SLR1, SLR2, SLR3, SLR4, and SLR5, and then the merchants included in the first merchant set of the first hash area may be obtained as SLR1 and SLR2 according to a preset ratio of 40%.
The embodiment of the disclosure can perform initial merchant recall on each first hash area according to a preset proportion, thereby not only ensuring the quality of merchants, but also controlling the number of merchants.
Optionally, in another embodiment of the present disclosure, after step 102, the method further includes steps F1 to F2:
step F1, for each first hash area, monitoring the recall quality parameter of the first hash area, where the recall quality parameter of the first hash area is determined according to the quality parameters of the merchants in the first merchant set of the first hash area.
The quality parameters of the merchant may be an order amount, a sales amount, and the like of the merchant in unit time. The embodiment of the present disclosure does not limit the specific content of the quality parameter as long as it can indicate that the history of the merchant is good or bad. The recall quality parameter for the first hash region may be an average of the quality parameters of merchants in the first merchant set of the first hash region.
In the embodiment of the present disclosure, after the first merchant set of the first hash region is determined, in step 102, the first hash code of each first hash region may be stored according to a corresponding relationship with the first merchant set, so that the first merchant set of the first hash region does not need to be repeatedly determined here, and the first merchant set corresponding to the first hash region is directly queried according to the first hash code of the first hash region, which is beneficial to reducing the amount of computation and improving the computation efficiency.
Step F2, for each first hash area, adjusting the preset ratio corresponding to the first hash area and/or the first business number threshold of the first hash area according to the recall quality parameter of the first hash area.
Specifically, for each first hash area, if the recall quality parameter of the first hash area is greater than or equal to a preset first quality parameter threshold, increasing a preset proportion and/or a first business number threshold of the first hash area; if the recall quality parameter is less than or equal to a preset second quality parameter threshold, reducing the preset proportion of the first hash area and/or the first commercial number threshold; if the recall quality parameter is greater than the second quality parameter threshold and less than the first quality parameter threshold, the preset proportion corresponding to the first hash area and the first commercial number threshold are not adjusted.
Of course, the preset proportion of the first hash area and/or the first merchant number threshold may also be adjusted in combination with the other rules, so as to increase the preset proportion of the first hash area with better historical performance and/or the first merchant number threshold, and decrease the preset proportion of the first hash area with worse historical performance and/or the first merchant number threshold.
According to the embodiment of the disclosure, the preset proportion and/or the first business number threshold value can be adjusted according to the historical performance of the first hash area, so that more reasonable dynamic recall is realized, and the conversion rate of the activity is further improved.
Optionally, in another embodiment of the present disclosure, after step 104, the method further includes steps G1 to G2:
step G1, for each second hash area, monitoring the recall quality parameter of the second hash area, where the recall quality parameter of the second hash area is determined according to the quality parameters of merchants in the third merchant set of the second hash area.
The quality parameters of the merchant may be an order amount, a sales amount, and the like of the merchant in unit time. The embodiment of the present disclosure does not limit the specific content of the quality parameter as long as it can indicate that the history of the merchant is good or bad. The recall quality parameter for the second hash region may be an average of quality parameters of merchants in a third set of merchants of the second hash region.
In the embodiment of the present disclosure, after the third merchant set of each second hash area is determined in step 104, the second hash code of each second hash area and the third merchant set may be stored according to a corresponding relationship, so that the third merchant set of the second hash area does not need to be repeatedly determined here, and the third merchant set corresponding to the second hash area is directly queried according to the second hash code of the second hash area, which is beneficial to reducing the computation amount and improving the computation efficiency.
Step G2, for each second hash area, adjusting a second merchant number threshold of the second hash area according to the recall quality parameter of the second hash area.
Specifically, for each second hash area, if the recall quality parameter of the second hash area is greater than or equal to a preset third quality parameter threshold, increasing a second merchant number threshold of the second hash area; if the recall quality parameter is less than or equal to a preset fourth quality parameter threshold, reducing a second commercial number threshold of the second hash area; and if the recall quality parameter is greater than a preset fourth quality parameter threshold and less than a third quality parameter threshold, not adjusting a second commercial number threshold corresponding to the second hash area.
Of course, the second merchant number threshold may also be adjusted in combination with the remaining rules and the recall quality parameter, so as to increase the second merchant number threshold of the second hash area with better historical performance and decrease the second merchant number threshold of the second hash area with worse historical performance.
According to the embodiment of the disclosure, the threshold of the second number of businesses can be adjusted according to the historical performance of the second hash area, so that more reasonable dynamic recall is realized, and the improvement of the conversion rate of the activity is facilitated.
In summary, an embodiment of the present disclosure provides a merchant recalling method, including: acquiring a first hash area set, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit; for each first hash area, recalling merchants located in the first hash area according to the first hash code of the first hash area to obtain a first merchant set of the first hash area; for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold of the first hash area, acquiring a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is less than the second bit number; and for each second hash area, according to a second hash code of the second hash area, recalling merchants with overlapping areas between a distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area, where the second merchant set includes merchants other than the first hash merchant set of each first hash area. The embodiment of the disclosure can recall the first hash area for the first time, and recall the second hash area for the second time when the number of the first recalled merchants is insufficient, so that the recalled merchants are ensured to cover each position, thereby being unnecessary to recall one by one, and being beneficial to reducing the consumption of computer resources.
Example two
Referring to fig. 3, a block diagram of a merchant recall device in one embodiment of the present disclosure is shown, as follows:
the first hash region set obtaining module 201 is configured to obtain a first hash region set, where the first hash region set includes at least one first hash region, and the first hash region corresponds to a first hash code with a first bit number.
A first merchant recalling module 202, configured to recall, for each first hash area, a merchant located in the first hash area according to a first hash code of the first hash area, so as to obtain a first merchant set of the first hash area.
A second hash area set obtaining module 203, configured to, for each first hash area, obtain, if the number of merchants included in a first merchant set of the first hash area is smaller than a first merchant number threshold of the first hash area, a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is smaller than the second bit number.
A second merchant recalling module 204, configured to, for each second hash area, recall, according to a second hash code of the second hash area, merchants with an overlapping area between a distribution range and the second hash area from a second merchant set, to obtain a third merchant set of the second hash area, where the second merchant set includes merchants outside the first hash merchant set of each first hash area.
Optionally, in another embodiment of the present disclosure, the first hash region set obtaining module 201 includes a target hash code determining sub-module and a first hash region set obtaining sub-module:
and the target hash code determining submodule is used for carrying out hash operation of a first digit on at least one target position to obtain a target hash code.
And the first hash area set acquisition submodule is used for acquiring the hash area corresponding to the target hash code from a preset hash area set to obtain a first hash area set.
Optionally, in another embodiment of the present disclosure, the second merchant recalling module 204 includes a reference hash code set obtaining sub-module and a second merchant recalling sub-module:
and the reference hash code set acquisition submodule is used for acquiring a reference hash code set of the merchant for each merchant in the second merchant set, wherein the reference hash code set of the merchant comprises at least one reference hash code with a second digit, and the reference hash code is a hash code of a hash area obtained by dividing the distribution range of the merchant.
And the second merchant recalling submodule is used for recalling merchants containing the second hash codes of the second hash area in the reference hash code set aiming at each second hash area to obtain a third merchant set of the second hash area.
Optionally, in another embodiment of the present disclosure, the second merchant recalling sub-module includes a recalled number determining sub-module and a second merchant recalling unit:
and the recalled number determining unit is used for determining the number of the merchants in the second hash area from the first merchant set of the first hash area to which the second hash area belongs, so as to obtain the recalled number of the second hash area.
A second merchant recalling unit, configured to recall a target number of merchants from the merchants including the second hash code of the second hash region in the reference hash code set if the recalled number of the second hash region is smaller than a second merchant number threshold of the second hash region, where the target number is obtained by subtracting the recalled number of the second hash region from the second merchant number threshold of the second hash region.
Optionally, in another embodiment of the present disclosure, the merchant identifier of the merchant and the reference hash code set of the merchant are stored in a preset embedded storage system in advance according to a corresponding relationship; the reference hash code set acquisition sub-module comprises a merchant identification determination unit and a reference hash code set query unit:
and the merchant identification determining unit is used for determining the merchant identification of the merchant.
And the reference hash code set query unit is used for querying the reference hash code set of the merchant from a preset embedded storage system according to the merchant identifier.
Optionally, in another embodiment of the present disclosure, the first merchant recalling module 202 includes a merchant hash code determining sub-module, a fifth merchant set obtaining sub-module, and a first merchant set obtaining sub-module:
and the merchant hash code determining submodule is used for performing hash operation of a first digit on the position of each merchant in the fourth merchant set to obtain the merchant hash code.
And a fifth merchant set obtaining sub-module, configured to obtain, from the fourth merchant set, merchants with the merchant hash codes that are the same as the first hash codes of the first hash areas for each first hash area, to obtain a fifth merchant set of the first hash areas.
And the first merchant set acquisition sub-module is used for acquiring merchants meeting preset conditions from the fifth merchant set of the first hash area according to a preset proportion to obtain a first merchant set aiming at each first hash area.
Optionally, in another embodiment of the present disclosure, the apparatus further includes a first recall quality determination module and a first recall parameter adjustment module:
a first recall quality determination module, configured to monitor, for each first hash area, a recall quality parameter of the first hash area, where the recall quality parameter of the first hash area is determined according to quality parameters of merchants in a first merchant set of the first hash area.
And the first recall parameter adjusting module is used for adjusting the preset proportion corresponding to each first hash area and/or the first commercial number threshold of the first hash area according to the recall quality parameter of the first hash area.
Optionally, in another embodiment of the present disclosure, after step 104, the method further includes a second recall quality determination module and a second recall parameter adjustment module:
a second recall quality determination module, configured to monitor, for each second hash area, a recall quality parameter of the second hash area, where the recall quality parameter of the second hash area is determined according to a quality parameter of a merchant in a third merchant set of the second hash area.
And the second recall parameter adjusting module is used for adjusting a second commercial number threshold of each second hash area according to the recall quality parameter of the second hash area.
In summary, embodiments of the present disclosure provide a merchant recalling apparatus, the apparatus includes: the device comprises a first hash area set acquisition module, a second hash area set acquisition module and a first hash area setting module, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit; a first merchant recalling module, configured to recall, for each first hash area, a merchant located in the first hash area according to a first hash code of the first hash area, so as to obtain a first merchant set of the first hash area; a second hash area set obtaining module, configured to, for each first hash area, obtain, if a number of merchants included in a first merchant set of the first hash area is smaller than a first merchant number threshold of the first hash area, a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is smaller than the second bit number; and the second merchant recalling module is used for recalling merchants with overlapping areas of the distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area according to the second hash code of the second hash area for each second hash area, wherein the second merchant set comprises merchants except the first hash merchant set of each first hash area. The embodiment of the disclosure can recall the first hash area for the first time, and recall the second hash area for the second time when the number of the first recalled merchants is insufficient, so that the recalled merchants are ensured to cover each position, thereby being unnecessary to recall one by one, and being beneficial to reducing the consumption of computer resources.
The second embodiment is an embodiment of the apparatus corresponding to the first embodiment, and the detailed description may refer to the first embodiment, which is not repeated herein.
An embodiment of the present disclosure also provides an electronic device, referring to fig. 4, including: a processor 301, a memory 302, and a computer program 3021 stored on the memory 302 and executable on the processor, the processor 301 implementing the merchant recall method of the foregoing embodiments when executing the program.
Embodiments of the present disclosure also provide a readable storage medium, whose instructions, when executed by a processor of an electronic device, enable the electronic device to perform the merchant recall method of the foregoing embodiments.
For the device embodiment, since it is basically similar to the method embodiment, the description is simple, and for the relevant points, refer to the partial description of the method embodiment.
The algorithms and displays presented herein are not inherently related to any particular computer, virtual machine, or other apparatus. Various general purpose systems may also be used with the teachings herein. The required structure for constructing such a system will be apparent from the description above. Moreover, this disclosure is not directed to any particular programming language. It is appreciated that a variety of programming languages may be used to implement the present disclosure as described herein, and any descriptions above of specific languages are provided for disclosure of enablement and best mode of the present disclosure.
In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the disclosure may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure an understanding of this description.
Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the disclosure, various features of the disclosure are sometimes grouped together in a single embodiment, figure, or description thereof for the purpose of streamlining the disclosure and aiding in the understanding of one or more of the various inventive aspects. However, the disclosed method should not be interpreted as reflecting an intention that: that is, the claimed disclosure requires more features than are expressly recited in this disclosure. Rather, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the detailed description are hereby expressly incorporated into this detailed description, with each claim standing on its own as a separate embodiment of this disclosure.
Those skilled in the art will appreciate that the modules in the device in an embodiment may be adaptively changed and disposed in one or more devices different from the embodiment. The modules or units or components of the embodiments may be combined into one module or unit or component, and furthermore they may be divided into a plurality of sub-modules or sub-units or sub-components. All of the features disclosed in this disclosure, as well as all of the processes or elements of any method or apparatus so disclosed, may be combined in any combination, except that at least some of such features and/or processes or elements are mutually exclusive. Each feature disclosed in this disclosure may be replaced by an alternative feature serving the same, equivalent or similar purpose, unless expressly stated otherwise.
Various component embodiments of the disclosure may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art will appreciate that a microprocessor or Digital Signal Processor (DSP) may be used in practice to implement some or all of the functions of some or all of the components in a merchant recall apparatus according to the present disclosure. The present disclosure may also be embodied as an apparatus or device program for performing a portion or all of the methods described herein. Such programs implementing the present disclosure may be stored on a computer-readable medium or may be in the form of one or more signals. Such a signal may be downloaded from an internet website or provided on a carrier signal or in any other form.
It should be noted that the above-mentioned embodiments illustrate rather than limit the disclosure, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the disclosure. Any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in this disclosure. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The disclosure may be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. For the purpose of illustrating the several means, several of these means may be embodied by one and the same item of hardware. The usage of the words first, second and third, etcetera do not indicate any ordering. These words may be interpreted as names.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
The above description is only exemplary of the present disclosure and should not be taken as limiting the disclosure, as any modification, equivalent replacement, or improvement made within the spirit and principle of the present disclosure should be included in the scope of the present disclosure.
The above description is only for the specific embodiments of the present disclosure, but the scope of the present disclosure is not limited thereto, and any person skilled in the art can easily conceive of the changes or substitutions within the technical scope of the present disclosure, and all the changes or substitutions should be covered within the scope of the present disclosure. Therefore, the protection scope of the present disclosure should be subject to the protection scope actually covered by the disclosed technical solutions.
Claims (11)
1. A merchant recall method, the method comprising:
acquiring a first hash area set, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit;
for each first hash area, recalling merchants located in the first hash area according to the first hash code of the first hash area to obtain a first merchant set of the first hash area;
for each first hash area, if the number of merchants included in a first merchant set of the first hash area is less than a first merchant number threshold of the first hash area, acquiring a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is less than the second bit number;
and for each second hash area, according to a second hash code of the second hash area, recalling merchants with overlapping areas between a distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area, where the second merchant set includes merchants other than the first merchant set of each first hash area.
2. The method of claim 1, wherein the step of obtaining the first hash region set comprises:
performing hash operation of a first digit on at least one target position to obtain a target hash code;
and obtaining a hash area corresponding to the target hash code from a preset hash area set to obtain a first hash area set.
3. The method according to claim 1, wherein the step of recalling, for each second hash region, merchants whose delivery ranges overlap with the second hash region from a second merchant set according to the second hash codes of the second hash regions to obtain a third merchant set of the second hash regions comprises:
for each merchant in a second merchant set, acquiring a reference hash code set of the merchant, wherein the reference hash code set of the merchant comprises at least one reference hash code with a second digit, and the reference hash code is a hash code of a hash area obtained by dividing a distribution range of the merchant;
and recalling the merchants containing the second hash codes of the second hash areas in the reference hash code set aiming at each second hash area to obtain a third merchant set of the second hash areas.
4. The method of claim 3, wherein the step of recalling the merchant having the second hash code of the second hash region in the reference hash code set comprises:
determining the number of merchants in the second hash area from a first merchant set of a first hash area to which the second hash area belongs, and obtaining the recalled number of the second hash area;
if the recalled number of the second hash area is smaller than a second merchant number threshold of the second hash area, recalling a target number of merchants from the merchants containing the second hash code of the second hash area in the reference hash code set, wherein the target number is obtained by subtracting the recalled number of the second hash area from the second merchant number threshold of the second hash area.
5. The method according to claim 3, wherein the merchant identifier of the merchant and the reference hash code set of the merchant are pre-stored in a preset embedded storage system according to a corresponding relationship; the step of obtaining the reference hash code set of the merchant includes:
determining a merchant identification of the merchant;
and inquiring the reference hash code set of the merchant from a preset embedded storage system according to the merchant identification.
6. The method according to any one of claims 1 to 5, wherein the step of recalling, for each of the first hash regions, merchants located in the first hash region according to the first hash code of the first hash region to obtain the first merchant set of the first hash region comprises:
performing hash operation of a first digit on the position of each merchant in a fourth merchant set to obtain a merchant hash code;
for each first hash area, acquiring merchants with the same merchant hash codes as the first hash codes of the first hash area from the fourth merchant set to obtain a fifth merchant set of the first hash area;
the fourth merchant set is a merchant aggregate formed by the first merchant set and the second merchant set;
and for each first hash area, acquiring merchants meeting preset conditions from a fifth merchant set of the first hash area according to a preset proportion to obtain a first merchant set.
7. The method according to claim 6, wherein after the step of recalling, for each of the first hash regions, merchants located in the first hash region according to the first hash code of the first hash region, and obtaining the first set of merchants of the first hash region, the method further comprises:
for each first hash area, monitoring a recall quality parameter of the first hash area, wherein the recall quality parameter of the first hash area is determined according to quality parameters of merchants in a first merchant set of the first hash area;
and for each first hash area, adjusting the preset proportion corresponding to the first hash area and/or a first commercial number threshold of the first hash area according to the recall quality parameter of the first hash area.
8. The method according to claim 4, wherein after the step of recalling merchants with distribution ranges having an overlapping area with the second hash region from the second set of merchants, obtaining a third set of merchants of the second hash region, the method further comprises:
for each second hash area, monitoring a recall quality parameter of the second hash area, wherein the recall quality parameter of the second hash area is determined according to quality parameters of merchants in a third merchant set of the second hash area;
and for each second hash area, adjusting a second commercial tenant number threshold of the second hash area according to the recall quality parameter of the second hash area.
9. A merchant recall apparatus, the apparatus comprising:
the device comprises a first hash area set acquisition module, a second hash area set acquisition module and a first hash area setting module, wherein the first hash area set comprises at least one first hash area, and the first hash area corresponds to a first hash code with a first digit;
a first merchant recalling module, configured to recall, for each first hash area, a merchant located in the first hash area according to a first hash code of the first hash area, so as to obtain a first merchant set of the first hash area;
a second hash area set obtaining module, configured to, for each first hash area, obtain, if a number of merchants included in a first merchant set of the first hash area is smaller than a first merchant number threshold of the first hash area, a second hash area set obtained by dividing the first hash area, where the second hash area set includes at least one second hash area, the second hash area corresponds to a second hash code with a second bit number, and the first bit number is smaller than the second bit number;
and the second merchant recalling module is used for recalling merchants with overlapping areas of the distribution range and the second hash area from a second merchant set to obtain a third merchant set of the second hash area according to the second hash code of the second hash area for each second hash area, wherein the second merchant set comprises merchants except the first merchant set of each first hash area.
10. An electronic device, comprising:
a processor, a memory, and a computer program stored on the memory and executable on the processor, wherein the processor, when executing the program, implements the merchant recall method of any of claims 1-8.
11. A readable storage medium, wherein instructions in the storage medium, when executed by a processor of an electronic device, enable the electronic device to perform a merchant recall method according to any of method claims 1-8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911319990.4A CN111144904B (en) | 2019-12-19 | 2019-12-19 | Merchant recall method and device, electronic equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911319990.4A CN111144904B (en) | 2019-12-19 | 2019-12-19 | Merchant recall method and device, electronic equipment and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111144904A CN111144904A (en) | 2020-05-12 |
| CN111144904B true CN111144904B (en) | 2022-01-21 |
Family
ID=70518940
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911319990.4A Active CN111144904B (en) | 2019-12-19 | 2019-12-19 | Merchant recall method and device, electronic equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111144904B (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104851006A (en) * | 2015-05-21 | 2015-08-19 | 北京京东尚科信息技术有限公司 | Dispersing scope determination method and apparatus |
| CN106251164A (en) * | 2016-03-21 | 2016-12-21 | 上海驴徒电子商务有限公司 | Method and system are recommended at a kind of scenic spot |
| KR101707753B1 (en) * | 2015-12-21 | 2017-02-16 | 비씨카드(주) | Method for personalized recommending affiliated store and affiliated store recommendation server |
| CN107368483A (en) * | 2016-05-11 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Information recommendation method, device and server |
| CN108717407A (en) * | 2018-05-11 | 2018-10-30 | 北京三快在线科技有限公司 | Entity vector determines method and device, information retrieval method and device |
| CN109634962A (en) * | 2018-12-08 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Trade company's lookup method, device, electronic equipment and storage medium |
| US10311088B1 (en) * | 2017-02-03 | 2019-06-04 | Marklogic Corporation | Apparatus and method for resolving geospatial queries |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR101692501B1 (en) * | 2015-10-15 | 2017-01-03 | 네이버 주식회사 | Method and apparatus for searching the real estate for sale |
-
2019
- 2019-12-19 CN CN201911319990.4A patent/CN111144904B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104851006A (en) * | 2015-05-21 | 2015-08-19 | 北京京东尚科信息技术有限公司 | Dispersing scope determination method and apparatus |
| KR101707753B1 (en) * | 2015-12-21 | 2017-02-16 | 비씨카드(주) | Method for personalized recommending affiliated store and affiliated store recommendation server |
| CN106251164A (en) * | 2016-03-21 | 2016-12-21 | 上海驴徒电子商务有限公司 | Method and system are recommended at a kind of scenic spot |
| CN107368483A (en) * | 2016-05-11 | 2017-11-21 | 阿里巴巴集团控股有限公司 | Information recommendation method, device and server |
| US10311088B1 (en) * | 2017-02-03 | 2019-06-04 | Marklogic Corporation | Apparatus and method for resolving geospatial queries |
| CN108717407A (en) * | 2018-05-11 | 2018-10-30 | 北京三快在线科技有限公司 | Entity vector determines method and device, information retrieval method and device |
| CN109634962A (en) * | 2018-12-08 | 2019-04-16 | 拉扎斯网络科技（上海）有限公司 | Trade company's lookup method, device, electronic equipment and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| A Method of Purchase Prediction Based on User Behavior Log;Dancheng Li等;《2015 IEEE International Conference on Data Mining Workshop (ICDMW)》;20160204;第1031-1039页 * |
| 智慧商圈中个性化推荐系统的设计与实现;张子卿;《中国优秀硕士学位论文全文数据库信息科技辑》;20150615(第6期);第I138-754页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111144904A (en) | 2020-05-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| WO2018227859A1 (en) | Method and apparatus for dividing delivery regions, electronic device, and computer-readable storage medium | |
| CN108763453B (en) | Page data processing method and device based on behavior prediction | |
| EP2640098B1 (en) | System for Providing Extensible Location-Based Services | |
| CN111966912B (en) | Recommendation method and device based on knowledge graph, computer equipment and storage medium | |
| CN111742308A (en) | System and method for data storage and query | |
| CN111241388A (en) | Multi-policy recall method and device, electronic equipment and readable storage medium | |
| CN110414877B (en) | Distribution mode determination method and device | |
| CN107909485B (en) | Method and device for generating discount data based on no claim and computer readable medium | |
| CN108667877B (en) | Method and device for determining recommendation information, computer equipment and storage medium | |
| CN112749863A (en) | Keyword price adjusting method and device and electronic equipment | |
| CN111080407A (en) | House information recommendation method and device, electronic equipment and readable storage medium | |
| US20220027427A1 (en) | Business searching methods and apparatuses, electronic devices and storage media | |
| CN109544207A (en) | A kind of information processing method, storage medium and server | |
| CN113222720B (en) | Privacy protection incentive mechanism method and device based on reputation and storage medium | |
| CN111144904B (en) | Merchant recall method and device, electronic equipment and readable storage medium | |
| CN107220881B (en) | Method and device for ranking e-commerce popularity based on time and space | |
| CN110930101B (en) | Method, device, electronic equipment and readable medium for determining delivery time of order | |
| CN110515929B (en) | Book display method, computing device and storage medium | |
| CN110609855B (en) | Query processing and query rate threshold determination method and distributed query system | |
| CN111865558A (en) | Service data processing method and device, electronic equipment and storage medium | |
| CN115018593A (en) | Independent site commodity recommendation method and device, equipment, medium and product thereof | |
| CN111881148A (en) | Object combination attribute determination method and device and electronic equipment | |
| CN108537654B (en) | Rendering method and device of customer relationship network graph, terminal equipment and medium | |
| Kanagasabai et al. | Ec2bargainhunter: It's easy to hunt for cost savings on amazon ec2! | |
| CN114253951B (en) | Data processing method, system and second server |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |