Data preprocessing method and device of service district, electronic equipment and storage medium

Abstract

The invention relates to the technical field of data processing, and discloses a data preprocessing method and device for a service area, electronic equipment and a storage medium. The method comprises the following steps: determining the number of target block units; calculating a target service attribute value of each block unit based on the service attribute value of the target area and the number of the target block units; performing hierarchical operation on the target area based on the spatial index, and dividing the target area into N candidate block units of different hierarchies; low-level operation and merging processing are carried out on cavities and overlapped areas among the N candidate block units of different levels, N target block units without cavities and overlapping are obtained, and the low level is the minimum level in the levels of the N candidate block units; and inputting the processed N target block units into a dynamic planner to divide the service districts. According to the invention, efficient, uniform and accurate business area division can be realized.

Description

Technical Field

[0001] The present disclosure relates to the field of data processing technology, and in particular to a data preprocessing method, device, electronic device, and storage medium for a business area. Background Art

[0002] In the management of business areas in the fast-moving consumer goods industry, rational division of business areas is crucial for improving operational efficiency and achieving refined management. Currently, a common approach is to manually divide areas on a map. For example, when planning areas, staff members rely on experience and subjective judgment to divide a region into several zones and assign specific sales personnel to each zone. This approach has numerous drawbacks. First, manual operations are extremely inefficient, requiring staff to expend considerable time and effort simply drawing zone boundaries and determining personnel assignments, resulting in a significant workload. Second, this approach lacks refined management, making it difficult to scientifically assign zones based on various indicators. For example, it is difficult to accurately assign zones to the most appropriate sales personnel based on specific indicators such as the number of stores within the area, the number of employees within the area, and regional sales. This prevents each salesperson from fully leveraging their strengths and hinders the efficient operation of the overall business. Summary of the Invention

[0003] In response to the above situation, the embodiments of the present application provide a data preprocessing method, device, electronic device and storage medium for a business area, which aim to solve the above problems or at least partially solve the above problems.

[0004] In a first aspect, an embodiment of the present application provides a data preprocessing method for a service area, the method comprising: Determine the number of target block units; Calculate the target business attribute value of each block unit based on the business attribute value of the target area and the number of target block units; Performing a hierarchical operation on the target area based on the spatial index, dividing the target area into N candidate block units of different levels; wherein different spatial indexes correspond to different resolution levels, different resolution levels correspond to different block units with different areas, and the service attribute value in each candidate block unit is less than or equal to the target service attribute value; Performing low-level operations and merging processing on the areas with holes and overlaps between N candidate block units of different levels to obtain N target block units without holes and overlaps, where the low level is the minimum level among the levels of the N candidate block units; The processed N target block units are input into the dynamic planner to divide the business area.

[0005] In a second aspect, an embodiment of the present application further provides a data preprocessing device for a service area, the device comprising: A processing module is configured to determine the target number N of block units; and calculate a target service attribute value of each block unit based on the service attribute value of the target area and the target number of block units; a partitioning module, configured to perform a hierarchical operation on the target area based on the spatial index, and divide the target area into N candidate block units of different levels; wherein different spatial indexes correspond to different resolution levels, different resolution levels correspond to different block units with different areas, and the service attribute value in each candidate block unit is less than or equal to the target service attribute value; A merging module is used to perform low-level operations and merge processing on the areas with holes and overlaps between N candidate block units of different levels to obtain N target block units without holes and overlaps. The low level is the minimum level among the levels of the N candidate block units. The input module is used to input the processed N target block units into the dynamic planner to divide the business area.

[0006] In a third aspect, an embodiment of the present application further provides an electronic device comprising: a processor; and a memory arranged to store computer-executable instructions, wherein the executable instructions, when executed, cause the processor to perform the steps of the first aspect described above.

[0007] In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, which stores one or more programs. When the one or more programs are executed by an electronic device including multiple applications, the electronic device performs the steps of the first aspect above.

[0008] At least one of the above technical solutions adopted in the embodiments of the present application can achieve the following beneficial effects: by calculating the target business attribute value of each block unit through the business attribute value of the target area and the number of target block units, and by clarifying the attribute value to be allocated in each block unit, a uniform division of the business is achieved; further, due to the uneven business of each area, it is impossible to directly divide the block units based on a fixed area, so the present application performs a hierarchical operation on the target area based on the spatial index, and divides the target area into N candidate block units of different levels. Since different spatial indexes correspond to different resolution levels, and different resolution levels correspond to different areas of block units, the final The business attribute values of the N candidate block units at different levels are all less than or equal to the target business attribute values, ensuring the uniformity of business division among different geographical areas. Finally, since there may be holes and overlaps between candidate block units at different levels, low-level operations and merging are performed on the candidate block units with holes and overlaps to obtain N target block units without holes and overlaps, forming a continuous and complete business area and avoiding management confusion and resource waste caused by regional ambiguity. Finally, the processed N target block units are input into the dynamic planner for business area division, achieving efficient, uniform and accurate business area division. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] The drawings described herein are used to provide a further understanding of the present application and constitute a part of the present application. The illustrative embodiments of the present application and their descriptions are used to explain the present application and do not constitute an improper limitation on the present application. In the drawings: Figure 1 A schematic diagram showing a flow chart of a data preprocessing method for a service area provided in an embodiment of the present application is shown; Figure 2 A schematic diagram of merging block units provided in an embodiment of the present application is shown; Figure 3 A structural diagram of a data preprocessing device for a service area provided in an embodiment of the present application is shown; Figure 4 A schematic structural diagram of an electronic device provided in an embodiment of the present application is shown. DETAILED DESCRIPTION

[0010] To make the purpose, technical solutions, and advantages of this application more clear, the technical solutions of this application will be clearly and completely described below in conjunction with the specific embodiments of this application and the corresponding drawings. Obviously, the embodiments described are only part of the embodiments of this application, not all of them. Based on the embodiments in this application, all other embodiments obtained by ordinary technicians in this field without making creative efforts are within the scope of protection of this application.

[0011] It should be noted that the terms "first," "second," and the like in the specification and claims of this application and the accompanying drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or precedence. It should be understood that such usage is interchangeable where appropriate, so that the embodiments of the present application described herein can be implemented in an order other than that illustrated or described herein. In addition, the term "including" and its variations are to be interpreted as open-ended terms meaning "including but not limited to."

[0012] As mentioned in the background technology, manual division of business areas is inefficient and lacks refined management. This application uses a dynamic planner to divide business areas. By inputting the block units to be divided into the dynamic planner, the planner allocates the block units to different business personnel based on various indicators such as the number of stores in the area, the number of people in the area, and the regional sales, which can achieve relatively efficient and refined division.

[0013] However, when using a dynamic planner to divide business areas, determining the appropriate block units is a critical issue. Providing the planner with an excessive number of block units, such as 1,000, results in excessive computational complexity, requiring more exhaustive searches, and significantly reducing the planner's efficiency. Conversely, if the number of block units is too small, such as only 20, the planner's freedom of division is limited, making it difficult to meet complex and changing business needs. This results in suboptimal division results and prevents the dynamic planner from fully realizing its strengths.

[0014] Based on this, this application proposes a data preprocessing method for business areas, focusing on solving the problem of determining the block units to be divided in the dynamic planning of business area division, and realizing efficient, uniform and accurate business area division block units by determining the allocated values within the units, spatial index hierarchical operations, and hole and overlap processing.

[0015] The present application is described in detail below through specific embodiments.

[0016] Figure 1 The flow chart of the data preprocessing method for the service area provided by the embodiment of the present application is shown. Figure 1 It can be seen that this application at least includes steps S101 to S105: Step S101: Determine the target number of block units.

[0017] In some embodiments, the optimal number of target block units X is determined through simulation tests based on the operating efficiency and division freedom of the dynamic planner. The operating efficiency of the dynamic planner refers to the time it takes for the dynamic planner to divide X target block units into service areas; the division freedom refers to the options available to the dynamic planner when dividing X target block units into service areas. For example, in actual tests, the dynamic planner only takes about 20 seconds to complete operations on 400 area units. This speed is significantly better than the long operation time caused by excessive computational complexity when inputting 1,000 units, and also avoids the situation where the parameters need to be repeatedly adjusted and recalculated due to insufficient degrees of freedom when inputting 20 units.

[0018] By determining the optimal target number of block units, X, the planner can complete the calculation within a reasonable timeframe while maintaining sufficient flexibility to achieve a more refined division, rather than providing too many or too few block units. This balances both efficiency and flexibility. This rapid computational efficiency enables business area division to respond promptly to actual business changes, providing efficient support for operational decision-making. Enterprises can more quickly adjust their business areas based on market dynamics, business development, and other factors, seizing market opportunities.

[0019] Step S102: Calculate the target service attribute value of each block unit based on the service attribute value of the target area and the number of target block units.

[0020] The business attribute values for the target area can include attributes such as the number of stores, number of employees, and sales. For example, if the number of stores in the area is used as the partitioning metric, assuming there are N stores in the target area and the number of block units is X, then the target number of stores allocated to each block unit is M = N / X. If the business metric is the number of people in the area, and the total number of people in the target area is P, then the target number of people allocated to each block unit is M = P / X. This step ensures that subsequent partitioning operations have clear quantitative goals, ensuring that the partitioning results closely align with actual business needs.

[0021] Step S103: performing a hierarchical operation on the target area based on the spatial index, and dividing the target area into N candidate block units of different levels.

[0022] Among them, different spatial indexes correspond to different resolution levels, different resolution levels correspond to different areas of block units, and the business attribute value in each candidate block unit is less than or equal to the target business attribute value.

[0023] For example, the H3 hexagonal hierarchical spatial index system is used to illustrate this. Each basic unit at each resolution level is assigned a unique index value to facilitate spatial location and computation. This system divides the Earth's surface into resolution levels 0-16, with the area of the basic units at different resolution levels decreasing exponentially. For example, the area of the block unit corresponding to resolution level 0 is 4357449416078.392 square meters, the area of the block unit corresponding to resolution level 1 is 609788441794.134 square meters, the area of the block unit corresponding to resolution level 2 is 86801780398.997 square meters, and so on. The service attribute value of each basic unit at different resolution levels is determined until the service attribute value of each candidate block unit is less than or equal to the target service attribute value. For example, if the target service attribute value is 5, the resulting N candidate block units correspond to levels 10, 11, and 12, respectively, and the service attribute value of each candidate block unit is less than or equal to 5.

[0024] Step S104: performing low-level operations and merging processing on the areas with holes and overlaps between N candidate block units at different levels to obtain N target block units without holes and overlaps.

[0025] The low level is the minimum level among the levels of the N candidate block units. Figure 2 As shown, the levels corresponding to the N candidate block units include: 11, 12, where 12 represents the minimum level. The candidate block units corresponding to the 11th level are subjected to the 12th level operation, so that the candidate block units corresponding to the 11th level are transformed into multiple candidate block sub-units of the 12th level, and the multiple candidate block sub-units of the 12th level are further merged to obtain a target block unit composed of multiple candidate block sub-units of the 12th level, so that the target block units between the same levels have no holes and no overlap.

[0026] Step S105: input the processed N target block units into a dynamic planner to divide the service areas.

[0027] In some embodiments, the processed N target block units are input into a dynamic planner, which then allocates them based on pre-defined business metrics to produce business zones. Specifically, the N processed target block units, which are of varying sizes but contain no gaps or overlaps, are organized into a format recognizable by the dynamic planner. This target block unit data is then transferred to the dynamic planner via a data interface or file transfer. Upon receiving this data, the dynamic planner allocates the zone units based on pre-defined business metrics (e.g., number of stores, number of employees, sales volume, etc.) to complete the division of the business zones.

[0028] from Figure 1 It can be seen from the method shown that the present application calculates the target business attribute value of each block unit by the business attribute value of the target area and the number of target block units, and realizes the uniform division of business by clarifying the attribute value to be allocated in each block unit; further, due to the uneven business of each area, it is impossible to directly divide the block units based on a fixed area, so the present application performs a hierarchical operation on the target area based on the spatial index, and divides the target area into N different levels of candidate block units. Since different spatial indexes correspond to different resolution levels, and different resolution levels correspond to different areas of block units, the final division of N different levels The business attribute values in the candidate block units at all levels are less than or equal to the target business attribute values, ensuring the uniformity of business division among different geographical areas. Finally, since there may be holes and overlaps between candidate block units at different levels, low-level operations and merging are performed on the candidate block units with holes and overlaps to obtain N target block units without holes and overlaps, forming a continuous and complete business area, avoiding management confusion and resource waste caused by regional ambiguity. Finally, the processed N target block units are input into the dynamic planner for business area division, realizing efficient, uniform and accurate business area division.

[0029] In some embodiments of the present application, in the above method, how to divide the target area into N candidate block units of different levels in step S103 is specifically described.

[0030] Specifically, the algorithm starts from the target resolution level and calculates layer by layer based on the spatial index. If the service attribute value of the block unit at the current level is less than or equal to the target service attribute value, it is marked as a candidate block unit. If the service quantity of the block unit at the current level is greater than the target service allocation quantity, the algorithm moves to the next resolution level. The target resolution level is the highest resolution level, a custom level, or a recommended level.

[0031] In some embodiments, the user can customize the levels based on actual conditions. For example, if the business in the current target area is relatively evenly distributed, the high-resolution level can be skipped directly and the intermediate resolution level can be customized. If the user does not customize it, the calculation can be performed directly from the highest resolution level downwards.

[0032] In other embodiments, a recommended level can be pre-set. Specifically, multiple target services that meet the target service attribute values are selected from the target area, the regional area of the region where the multiple target services are located is determined, the regional area is compared with the area of the block units corresponding to different resolution levels, the resolution level corresponding to the regional area is determined, and the resolution level corresponding to the regional area is used as the recommended level, or the resolution level corresponding to the regional area is increased by a preset resolution level to reduce errors.

[0033] For example, let's take the highest-resolution level as an example. Suppose the area to be segmented is Minhang District. It's known that there are 2,000 stores in Minhang District, X = 400, and the target number of stores per block unit, M, has been determined to be 2,000 / 400 = 5. Starting at the highest resolution level (e.g., layer 0), the number of stores within that layer is counted. If the number of stores within a block unit at layer 0 exceeds the target number M per block unit (i.e., the constraint is not met), the count and analysis continues at the next resolution level (layer 1). For example, if a block unit at layer 0 contains 2,000 stores, the constraint is not met, so the process moves to layer 1. At layer 1, each block unit within that layer is analyzed, and the number of stores within each basic unit is counted. If the number of stores within a basic unit is less than or equal to M, the basic unit is marked as a preliminary block unit. If the number of stores within a basic unit is greater than M, the basic unit is further segmented and analyzed at the next level. In this way, allocation calculations are performed layer by layer, from high to low, until a target number of stores per block unit is found, satisfying the requirement that the number of stores allocated does not exceed M. Assume that at the 10th layer, some basic units meet the requirements, while others do not. Basic units that meet the requirements are used as preliminary block units. For basic units that do not meet the requirements, the calculations are continued to the next layer (the 11th layer) until the business attribute value of each candidate block unit is less than or equal to the target business attribute value.

[0034] In the embodiment of the present application, by clarifying the values that need to be allocated within each block unit and performing hierarchical operations based on spatial indexes, the actual conditions of different regions are fully taken into account, such as the differences between suburbs and city centers in terms of store distribution, population density, etc. During the calculation process, the scope of each block unit is reasonably determined based on the business indicator data (such as the number of stores) within the basic units of each level, so that the business indicators carried by each block unit are relatively balanced. For example, whether in the suburbs where stores are sparse or in the city center where stores are dense, the number of stores ultimately allocated to each block unit can be close to the target value, thereby ensuring the uniformity of the business area division among different geographical regions. This uniform division helps companies to distribute business resources more fairly, avoid the situation where some business personnel have too heavy or too light tasks due to uneven regional division, improve the work efficiency and enthusiasm of the overall business team, and promote balanced business development.

[0035] In some embodiments of the present application, in the above method, how to perform low-level operations and merge processing on the areas with holes and overlaps between N candidate block units at different levels in step S104 is described.

[0036] In some embodiments, lower-level operations are performed on high-level candidate block units with holes or overlaps to obtain low-level sub-block units; the low-level sub-block units are merged into a composite block unit that has no holes and no overlaps with adjacent candidate block units.

[0037] Specifically, an m-th-level operation is performed on the candidate block unit of the n-th level to obtain multiple sub-block units of the m-th level, where the m-th level is the minimum level among the N different levels of the candidate block unit, and n is greater than m; the multiple sub-block units of the m-th level are merged to obtain a synthetic block unit of the m-th level, and there is no hole and no overlapping splicing between the synthetic block unit of the m-th level and the candidate block unit of the m-th level.

[0038] Because basic units at different resolution levels may experience holes and overlap when stitching together, after determining preliminary candidate block units, these units are further processed. For example, if a block unit on the 10th layer is adjacent to multiple block units on the 11th layer and exhibits holes or overlap, the block unit on the 10th layer is further processed downwards to obtain an 11th layer region unit with the same area as the 10th layer region unit. This is achieved by using a spatial index system algorithm to perform downward processing on the 10th layer region unit to obtain the corresponding 11th layer region unit. These 11th layer region units are then merged to form a single region unit with no holes or overlaps with the surrounding regions. For example, the final result may be five region units (small) on the 11th layer and one region unit (large) formed by stitching together multiple region units from the 11th layer. This process ensures that all X block units meet the requirements of no holes and no overlap.

[0039] Furthermore, since the merged block unit includes the business of the original empty area, the business attribute value of the merged block unit may be greater than the target business attribute value. Therefore, the present application determines the business attribute value of the m-th level synthetic block unit. If the business attribute value of the m-th level synthetic block unit is greater than the target business attribute value, the m-th level synthetic block unit is divided into two or more m-th level synthetic block sub-units, so that the business attribute value of each m-th level synthetic block sub-unit is less than or equal to the target business attribute value.

[0040] In the embodiments of this application, the resulting target block units are guaranteed to be free of gaps and overlaps, resulting in a continuous and complete business area division. This gap-free and overlap-free division not only makes the business area definition clearer and more accurate, avoiding management confusion and resource waste caused by fuzzy areas, but also provides an accurate geographic spatial foundation for subsequent business data statistics, analysis, and business operations. In some embodiments of the present application, a data preprocessing device for a business area is provided, and the data preprocessing device for the business area corresponds one-to-one to the data preprocessing method for the business area in the above embodiment. Figure 3 As shown, the data pre-processing device of the service area includes a processing module 101, a division module 102, a merging module 103 and an input module 104.

[0041] The processing module 101 is configured to determine the target number N of block units; and calculate the target service attribute value of each block unit based on the service attribute value of the target area and the target number of block units. A partitioning module 102 is configured to perform a hierarchical operation on the target area based on the spatial index, dividing the target area into N candidate block units of different levels; wherein different spatial indexes correspond to different resolution levels, and different resolution levels correspond to different block units with different areas, and the service attribute value in each candidate block unit is less than or equal to the target service attribute value; Merging module 103, configured to perform low-level operations and merge processing on the areas with holes and overlaps between N candidate block units of different levels to obtain N target block units without holes and overlaps, where the low-level is the minimum level among the levels of the N candidate block units; The input module 104 is used to input the processed N target block units into the dynamic planner to divide the service area.

[0042] In some embodiments of the present application, in the above-mentioned device, the division module 102 is specifically used to perform layer-by-layer calculations starting from the target resolution level based on the spatial index; if the business attribute value of the block unit at the current level is less than or equal to the target business attribute value, it is marked as a candidate block unit; if the business quantity of the block unit at the current level is greater than the target business allocation quantity, it is calculated to the next resolution level.

[0043] In some embodiments of the present application, in the above-mentioned device, the target resolution level is the highest resolution level or a custom level or a recommended level; wherein, the recommended level is determined based on the following method: selecting multiple target businesses that meet the target business attribute values from the target area; determining the area of the area where the multiple target businesses are located; comparing the area with the area of the block units corresponding to the different resolution levels to determine the resolution level corresponding to the area; and using the resolution level corresponding to the area or the resolution level after increasing the resolution level corresponding to the area by a preset resolution level as the recommended level.

[0044] In some embodiments of the present application, in the above-mentioned device, the merging module 103 is specifically used to perform lower-level operations on high-level candidate block units that have holes or overlaps to obtain low-level sub-units; and merge the low-level sub-units into composite units that have no holes and no overlaps with adjacent candidate block units.

[0045] In some embodiments of the present application, in the above-mentioned device, the merging module 103 is specifically used to perform an m-th level operation on the candidate block unit of the n-th level to obtain multiple sub-block units of the m-th level, where the m-th level is the minimum level among the N different levels of the candidate block unit, and n is greater than m; the multiple sub-block units of the m-th level are merged to obtain a synthesized block unit of the m-th level, and there is no hole and no overlapping splicing between the synthesized block unit of the m-th level and the candidate block unit of the m-th level.

[0046] In some embodiments of the present application, in the above-mentioned device, the division module 102 is also used to determine the business attribute value of the m-th level synthetic block unit; if the business attribute value of the m-th level synthetic block unit is greater than the target business attribute value, the m-th level synthetic block unit is divided into two or more m-th level synthetic block sub-units, and the business attribute value of each m-th level synthetic block sub-unit is less than or equal to the target business attribute value.

[0047] In some embodiments of the present application, in the above-mentioned apparatus, the processing module 101 is specifically configured to determine the optimal number of target block units through simulation testing based on the operating efficiency and partitioning freedom of the dynamic planner.

[0048] In some embodiments of the present application, in the above-mentioned device, the input module 104 is specifically used to input the processed N target block units into the dynamic planner, and the dynamic planner allocates the N target block units based on pre-set business indicators to obtain business areas.

[0049] In some embodiments of the present application, in the above-mentioned device, the spatial index system is an H3 hexagonal spatial index system, and the resolution levels include 0-16 resolution levels; among which, the block unit area corresponding to the 0th resolution level is the largest.

[0050] It should be noted that any of the above-mentioned data preprocessing devices for the business areas can implement the above-mentioned data preprocessing methods for the business areas in a one-to-one correspondence, which will not be described in detail here.

[0051] Figure 4 FIG. 1 shows a schematic diagram of the structure of an electronic device provided in an embodiment of the present application. Figure 4As shown, at the hardware level, the electronic device includes a processor and, optionally, an internal bus, a network interface, and memory. The memory may include internal memory, such as high-speed random-access memory (RAM), and may also include non-volatile memory, such as at least one disk drive. Of course, the electronic device may also include other hardware required for its services.

[0052] The processor, network interface, and memory can be interconnected via an internal bus, which can be an ISA (Industry Standard Architecture) bus, a PCI (Peripheral Component Interconnect) bus, or an EISA (Extended Industry Standard Architecture) bus. Buses can be divided into address buses, data buses, control buses, etc. For ease of representation, Figure 4 Only one bidirectional arrow is used in the diagram, but this does not mean that there is only one bus or one type of bus.

[0053] The memory is used to store programs. Specifically, the program may include program code, which includes computer operating instructions. The memory may include internal memory and non-volatile memory, and provides instructions and data to the processor.

[0054] The processor reads the corresponding computer program from the non-volatile memory into the internal memory and then runs it, forming a data preprocessing device for the business area at the logical level. The processor executes the program stored in the memory and is specifically used to perform the aforementioned method.

[0055] The processor may be an integrated circuit chip with signal processing capabilities. During implementation, the steps of the above-mentioned method may be performed by hardware integrated logic circuits within the processor or by software instructions. The above-mentioned processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it may also be a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field-programmable gate array (FPGA), or other programmable logic devices, discrete gate or transistor logic devices, or discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of this application may be implemented or executed. The general-purpose processor may be a microprocessor or any conventional processor. The steps of the methods disclosed in the embodiments of this application may be directly implemented and executed by a hardware decoding processor, or by a combination of hardware and software modules within the decoding processor. The software modules may be located in storage media well-known in the art, such as random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or the like. The storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.

[0056] The electronic device can execute the data preprocessing method of the business area provided by multiple embodiments of the present application, and realize the data preprocessing device of the business area. Figure 3 The functions of the illustrated embodiment will not be described in detail in the embodiments of the present application.

[0057] An embodiment of the present application also proposes a computer-readable storage medium, which stores one or more programs, and the one or more programs include instructions. When the instructions are executed by an electronic device including multiple applications, the electronic device can execute the data preprocessing method for the business area provided by multiple embodiments of the present application.

[0058] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present application may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0059] The present application is described with reference to the flowcharts and / or block diagrams of the methods, devices (systems), and computer program products according to the embodiments of the present application. It should be understood that each process and / or block in the flowchart and / or block diagram, as well as the combination of processes and / or blocks in the flowchart and / or block diagram, can be implemented by computer program instructions. These computer program instructions can be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or other programmable data processing device to produce a machine, so that the instructions executed by the processor of the computer or other programmable data processing device generate instructions for implementing the processes in the flowchart and / or block diagram. Figure 1 a process or multiple processes and / or boxes Figure 1 A device that provides the functions specified in a block or multiple blocks.

[0060] These computer program instructions may also be stored in a computer readable memory that can direct a computer or other programmable data processing device to work in a specific manner, so that the instructions stored in the computer readable memory produce an article of manufacture comprising an instruction device, which implements the process Figure 1 a process or multiple processes and / or boxes Figure 1 The function specified in one or more boxes.

[0061] These computer program instructions can also be loaded onto a computer or other programmable data processing device so that a series of operational steps are executed on the computer or other programmable device to produce a computer-implemented process, thereby providing the instructions executed on the computer or other programmable device for implementing the process. Figure 1 a process or multiple processes and / or boxes Figure 1 A step that specifies a function in one or more boxes.

[0062] In a typical configuration, a computing device includes one or more processors (CPUs), input / output interfaces, network interfaces, and memory.

[0063] Memory may include non-permanent storage in a computer-readable medium, in the form of random access memory (RAM) and / or non-volatile memory, such as read-only memory (ROM) or flash RAM. Memory is an example of a computer-readable medium.

[0064] Computer-readable media includes both permanent and non-permanent, removable and non-removable media that can be implemented using any method or technology to store information. Information can be computer-readable instructions, data structures, program modules, or other data. Examples of computer storage media include, but are not limited to, phase-change RAM (PRAM), static random access memory (SRAM), dynamic random access memory (DRAM), other types of random access memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD-ROM), digital versatile disc (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other non-transmission media that can be used to store information that can be accessed by a computing device. As defined herein, computer-readable media does not include transitory computer-readable media such as modulated data signals and carrier waves.

[0065] It should also be noted that the terms "comprises," "includes," or any other variations thereof are intended to encompass non-exclusive inclusion, such that a process, method, commodity, or apparatus that includes a series of elements includes not only those elements but also other elements not explicitly listed, or includes elements inherent to such process, method, commodity, or apparatus. In the absence of further limitations, an element defined by the phrase "comprises a ..." does not exclude the presence of other identical elements in the process, method, commodity, or apparatus that includes the element.

[0066] Those skilled in the art will appreciate that the embodiments of the present application may be provided as methods, systems, or computer program products. Therefore, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware. Furthermore, the present application may take the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to magnetic disk storage, CD-ROM, optical storage, etc.) containing computer-usable program code.

[0067] The above are merely embodiments of the present application and are not intended to limit the present application. For those skilled in the art, the present application may have various changes and variations. Any modifications, equivalent replacements, improvements, etc. made within the spirit and principles of the present application should all be included within the scope of the claims of the present application.

Claims

1. A data preprocessing method for a business area, characterized in that: The method comprises: Determine the number of target block units; Calculate the target business attribute value of each block unit based on the business attribute value of the target area and the number of target block units; Performing a hierarchical operation on the target area based on the spatial index, dividing the target area into N candidate block units of different levels; wherein different spatial indexes correspond to different resolution levels, different resolution levels correspond to different block units with different areas, and the service attribute value in each candidate block unit is less than or equal to the target service attribute value; Performing low-level operations and merging processing on the areas with holes and overlaps between N candidate block units of different levels to obtain N target block units without holes and overlaps, where the low level is the minimum level among the levels of the N candidate block units; The processed N target block units are input into the dynamic planner to divide the business area.

2. The method according to claim 1, characterized in that The target area is hierarchically calculated based on the spatial index to divide the target area into N candidate block units of different levels, including: Based on the spatial index, we start from the target resolution level and perform layer-by-layer operations; If the business attribute value of the block unit at the current level is less than or equal to the target business attribute value, it is marked as a candidate block unit; If the number of services in the block unit of the current level is greater than the target service allocation number, the operation is performed on the next resolution level.

3. The method according to claim 2, characterized in that The target resolution level is the highest resolution level, a custom level, or a recommended level; The recommendation level is determined based on the following method: Selecting a plurality of target services that meet target service attribute values from the target area; Determining the area of the region where the multiple target businesses are located; Comparing the area of the region with the areas of the block units corresponding to the different resolution levels to determine the resolution level corresponding to the area of the region; The resolution level corresponding to the area of the region or the resolution level obtained by increasing the resolution level corresponding to the area of the region by a preset resolution level is used as the recommended level.

4. The method according to claim 1, wherein Perform low-level operations and merge processing on the areas with holes and overlaps between N candidate block units at different levels, including: Perform lower-level operations on high-level candidate block units that have holes or overlaps to obtain low-level sub-block units; The low-level sub-block units are merged into a synthetic block unit that has no holes and no overlaps with adjacent candidate block units.

5. The method according to claim 4, characterized in that Perform lower-level operations on high-level candidate block units that have holes or overlaps to obtain low-level sub-block units, including: Performing an m-th-level operation on the candidate block unit of the n-th level to obtain multiple sub-block units of the m-th level, where the m-th level is the minimum level among N different levels of the candidate block unit, and n is greater than m; The step of merging the lower-level sub-block units into a composite block unit having no holes and no overlaps with adjacent candidate block units includes: Multiple sub-block units of the mth level are merged to obtain a synthesized block unit of the mth level, where there is no hole and no overlap between the synthesized block unit of the mth level and the candidate block unit of the mth level.

6. The method according to claim 5, characterized in that After merging the multiple sub-block units of the m-th level to obtain the synthesized block unit of the m-th level, the method further includes: Determining a service attribute value of the composite block unit at the mth level; If the business attribute value of the m-th level composite block unit is greater than the target business attribute value, the m-th level composite block unit is divided into two or more m-th level composite block sub-units, and the business attribute value of each m-th level composite block sub-unit is less than or equal to the target business attribute value.

7. The method according to claim 1, characterized in that Determining the target block unit quantity includes: Based on the operating efficiency and partitioning freedom of the dynamic planner, the optimal number of target block units is determined through simulation tests; The step of inputting the processed N target block units into a dynamic planner to divide the service areas includes: The processed N target block units are input into the dynamic planner, and the dynamic planner allocates the N target block units based on the pre-set business indicators to obtain the business areas; The spatial index system is an H3 hexagonal spatial index system, and the resolution levels include 0-16 resolution levels; among them, the block unit area corresponding to the 0 resolution level is the largest.

8. A data preprocessing device for a business area, characterized in that: The device comprises: A processing module is configured to determine the target number N of block units; and calculate a target service attribute value of each block unit based on the service attribute value of the target area and the target number of block units; a partitioning module, configured to perform a hierarchical operation on the target area based on the spatial index, and divide the target area into N candidate block units of different levels; wherein different spatial indexes correspond to different resolution levels, different resolution levels correspond to different block units with different areas, and the service attribute value in each candidate block unit is less than or equal to the target service attribute value; A merging module is used to perform low-level operations and merge processing on the areas with holes and overlaps between N candidate block units of different levels to obtain N target block units without holes and overlaps. The low level is the minimum level among the levels of the N candidate block units. The input module is used to input the processed N target block units into the dynamic planner to divide the business area.

9. An electronic device comprising: processor; as well as A memory arranged to store computer-executable instructions, wherein when the instructions are executed, the processor executes the steps of the data pre-processing method for a service area according to any one of claims 1 to 7.

10. A computer-readable storage medium storing one or more programs, which, when executed by an electronic device comprising a plurality of application programs, enables the electronic device to perform the steps of the data preprocessing method for a business area as described in any one of claims 1 to 7.

Images