CN113301138B - Position determining method and device of target service node and electronic equipment - Google Patents

Position determining method and device of target service node and electronic equipment Download PDF

Info

Publication number
CN113301138B
CN113301138B CN202110551885.4A CN202110551885A CN113301138B CN 113301138 B CN113301138 B CN 113301138B CN 202110551885 A CN202110551885 A CN 202110551885A CN 113301138 B CN113301138 B CN 113301138B
Authority
CN
China
Prior art keywords
service node
determining
target
weight
users
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
Application number
CN202110551885.4A
Other languages
Chinese (zh)
Other versions
CN113301138A (en
Inventor
田俊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Suzhou Dajiaying Information Technology Co Ltd
Original Assignee
Suzhou Dajiaying Information Technology Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Suzhou Dajiaying Information Technology Co Ltd filed Critical Suzhou Dajiaying Information Technology Co Ltd
Priority to CN202110551885.4A priority Critical patent/CN113301138B/en
Publication of CN113301138A publication Critical patent/CN113301138A/en
Application granted granted Critical
Publication of CN113301138B publication Critical patent/CN113301138B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/50Network services
    • H04L67/52Network services specially adapted for the location of the user terminal
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q30/00Commerce
    • G06Q30/02Marketing; Price estimation or determination; Fundraising
    • G06Q30/0201Market modelling; Market analysis; Collecting market data
    • G06Q30/0204Market segmentation
    • G06Q30/0205Location or geographical consideration

Landscapes

  • Business, Economics & Management (AREA)
  • Engineering & Computer Science (AREA)
  • Finance (AREA)
  • Development Economics (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Accounting & Taxation (AREA)
  • Strategic Management (AREA)
  • Data Mining & Analysis (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Game Theory and Decision Science (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Telephonic Communication Services (AREA)

Abstract

The embodiment of the application discloses a method and a device for determining the position of a target service node and electronic equipment. The method includes determining a reference service node of a target service node; acquiring flow data generated by the reference service node in a preset time interval, wherein the flow data represents a flow path of a user in the reference service node; acquiring potential user distribution of the reference service node in a preset time interval, wherein the distance between the potential user and the position of the reference service node is smaller than a preset threshold value; and determining the position of the target service node according to the flow data and the potential user distribution. The embodiment of the application ensures that the target service node is more attractive to the user and the potential user on the ground edge relative to the reference service node, is convenient for the target service node to attract the user and the potential user of the reference service node, optimizes the splitting effect of the service node and improves the splitting success rate of the service node.

Description

Position determining method and device of target service node and electronic equipment
Technical Field
The embodiment of the application relates to the technical field of computers, in particular to a method and a device for determining the position of a target service node and electronic equipment.
Background
The service node splitting is an operation of ensuring reasonable allocation of service node resources and providing reasonable service capability for users, and by splitting the service node, a new service node can be obtained by splitting on the basis of keeping the original service node, and the new service node can be understood as a target service node taking the original service node as a reference service node. In order to ensure the splitting effect of the service node, the position of the target service node needs to be determined, if the position of the target service node is not reasonably selected, the target service node is difficult to play a role in splitting the original service node, so that the splitting effect is reduced, and even splitting failure is possibly caused.
Disclosure of Invention
In order to accurately determine the position of a target service node and improve the splitting success rate of the service node, the embodiment of the application provides a method and a device for determining the position of the target service node and electronic equipment.
In one aspect, an embodiment of the present application provides a method for determining a location of a target service node, where the method includes:
determining a reference service node of the target service node;
acquiring flow data generated by the reference service node in a preset time interval, wherein the flow data represents a flow path of a user in the reference service node;
acquiring potential user distribution of the reference service node in a preset time interval, wherein the distance between the potential user and the position of the reference service node is smaller than a preset threshold value;
and determining the position of the target service node according to the flow data and the potential user distribution.
In another aspect, an embodiment of the present application provides a location determining apparatus of a target service node, where the apparatus includes:
The reference service node determining module is used for determining a reference service node of the target service node;
the flow data acquisition module is used for acquiring flow data generated by the reference service node in a preset time interval, wherein the flow data represents a flow path of a user in the reference service node;
The potential user distribution acquisition module is used for acquiring potential user distribution of the reference service node in a preset time interval, and the distance between the potential user and the position of the reference service node is smaller than a preset threshold value;
and the position determining module is used for determining the position of the target service node according to the flow data and the potential user distribution.
In another aspect, an embodiment of the present application provides a computer readable storage medium, where at least one instruction or at least one program is stored, where the at least one instruction or at least one program is loaded and executed by a processor to implement the method for determining a location of a target service node of the service node.
In another aspect, an embodiment of the present application provides an electronic device including at least one processor, and a memory communicatively coupled to the at least one processor; the memory stores instructions executable by the at least one processor, and the at least one processor implements the method for determining the location of the target service node by executing the instructions stored in the memory.
The embodiment of the application provides a method and a device for determining the position of a target service node and electronic equipment. According to the embodiment of the application, the position of the target service node is determined from two aspects of flow data and the potential user distribution, and the position of the target service node can be beneficial to reducing the flow cost of the user by analyzing the flow data; by analyzing the potential user distribution, the target service node can be ensured to split potential users of the reference service node, so that the target service node has attractive force on the ground for the users and the potential users relative to the reference service node, the target service node is convenient to attract the users and the potential users of the reference service node, the splitting effect of the service node is optimized, and the splitting success rate of the service node is improved.
Drawings
In order to more clearly illustrate the technical solutions and advantages of embodiments of the present application or related technologies, the following description will briefly explain the drawings required for the embodiments or related technologies, and it is apparent that the drawings in the following description are only some embodiments of the present application, and other drawings may be obtained according to the drawings without inventive effort for those skilled in the art.
FIG. 1 is a flow chart of a method for determining the location of a target service node according to an embodiment of the present application;
FIG. 2 is a flow chart for determining the location of a target service node based on traffic data and potential user profiles provided by an embodiment of the present application;
FIG. 3 is a flowchart of a first target location determination method according to an embodiment of the present application;
FIG. 4 is a flowchart of a second target position determining method according to an embodiment of the present application;
FIG. 5 is a flowchart of a method for determining a location of a target service node according to an embodiment of the present application;
FIG. 6 is a block diagram of a location determining apparatus of a target service node according to an embodiment of the present application;
Fig. 7 is a schematic hardware structure of an apparatus for implementing the method provided by the embodiment of the present application.
Detailed Description
The following description of the embodiments of the present application will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present application, but not all embodiments. All other embodiments, which can be made by one of ordinary skill in the art without undue burden from the present disclosure, are within the scope of the embodiments of the present application.
It should be noted that the terms "first," "second," and the like in the description and the claims of the embodiments of the present application and the above-described drawings are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that embodiments of the application described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or server that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed or inherent to such process, method, article, or apparatus, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.
In order to make the objects, technical solutions and advantages of the embodiments of the present application more apparent, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings and examples. It should be understood that the detailed description and specific examples, while indicating the embodiment of the application, are intended for purposes of illustration only and are not intended to limit the scope of the application.
The terms "first" and "second" are used below for descriptive purposes only and are not to be construed as indicating or implying relative importance or implicitly indicating the number of technical features indicated. Thus, a feature defining "a first" or "a second" may explicitly or implicitly include one or more such feature. In the description of the present embodiment, unless otherwise specified, the meaning of "plurality" is two or more.
In the following description, a method for determining a location of a target service node according to an embodiment of the present application is described, and fig. 1 shows a flowchart of a method for determining a location of a target service node according to an embodiment of the present application, where the method according to the embodiment or the flowchart includes the steps of operation, but may include more or less steps of operation based on conventional or non-creative labor. The order of steps recited in the embodiments is merely one way of performing the order of steps and does not represent a unique order of execution. When implemented by a system or server product in practice, the method may be performed sequentially or in parallel (e.g., in a parallel processor or multi-threaded processing environment) as shown in the embodiments or figures, where the method may include:
S101, determining a reference service node of the target service node.
In the embodiment of the application, the service node needing splitting is called a reference service node. That is, the reference service node may be split to obtain a split reference service node and a target service node. For example, if the service node a is split, a' after the split and the target service node B can be obtained. The embodiment of the application is not limited to the service content of any service node, and the method for determining the position of the target service node in the embodiment of the application can be implemented based on computer equipment. In one embodiment, the service node may be a virtual logical node, or may point to a real physical device or a modeling result, and the implementation of the present application does not specifically limit the service node. For example, a store may be abstracted as a service node, and a new store based on the store's resources may be considered a target service node that references the store.
S102, acquiring flow data generated by the reference service node in a preset time interval, wherein the flow data represents a flow path of a user in the reference service node.
In the embodiment of the application, the flow data comprises single-day flow distribution data of each single day in the preset time interval, and the single-day flow distribution data represents the number of users flowing from the reference service node to a designated position in the single day. Taking a preset time interval as a week, taking a reference service node as a store a as an example, the single day traffic distribution data generated on monday may be: the number of users in store a to designated position P1 is 1000, and the number of users in store a to designated position P2 is 4000. The single day flow distribution data generated on Tuesday may be: the user of store a to designated position P1 is 2000 and the user of store a to designated position P2 is 3000.
S103, acquiring potential user distribution of the reference service node in a preset time interval, wherein the distance between the potential user and the position of the reference service node is smaller than a preset threshold value.
In the embodiment of the present application, the person who is located within the preset range with the reference service node may become the potential user of the reference service node, the preset threshold is not limited, and may be 5 Kilometers (KM), and the person in the location area formed by the square circle 5KM with the location of the reference service node as the center may be considered as the potential user.
In the embodiment of the present application, the potential user distribution of the reference service node in the preset time interval includes a single-day potential user distribution of each single day in the preset time interval, and for each single day in the preset time interval, a corresponding single-day potential user distribution is determined, where the single-day potential user distribution characterizes the position of the potential user in the single day. In one embodiment, the single day potential user profile may be determined by a user within the location interval turning on a positioning function. For example, on the single day, the user a uses a store location service, and selects a store corresponding to the reference service node in the store location service, and reports the location of the user a through the store location service, so that the computer device can ascertain the location of the user a, and if the distance between the location and the reference service node is smaller than the preset threshold, it can be determined that the user a is a potential user, and the location of the user a participates in forming the single-day potential user distribution.
S104, determining the position of the target service node according to the flow data and the potential user distribution.
In one embodiment, please refer to fig. 2, which is a flowchart for determining the location of the target service node according to the traffic data and the potential user distribution, wherein determining the location of the target service node according to the traffic data and the potential user distribution includes:
s1041, determining a first target position according to the single-day flow distribution data for each single day in the preset time interval, so that the length of a flow path of the user flowing to a designated position corresponding to the user at the first target position is smaller than a preset threshold value.
The embodiment of the application does not limit the preset threshold value, and only ensures that the length of the flow path of the user flowing to the specified position corresponding to the user at the first target position is smaller than the length of the flow path of the user flowing to the specified position corresponding to the user at the position of the reference service node.
Referring to fig. 3, a flowchart of determining a first target position according to the single day traffic distribution data for each single day in the preset time interval is shown, where determining the first target position according to the single day traffic distribution data for each single day in the preset time interval includes:
S10411, for each designated position, calculating the number of users flowing to the designated position, and determining the product of the number of users and the designated position as a first parameter.
Taking a preset time interval as one week, taking a reference service node as a store a as an example, there are two designated positions, the number of users of store a to designated position P1 is 1000, and the number of users of store a to designated position P2 is 4000. For example, the position of P1 is represented by coordinates (1, 1), the position of P2 is represented by coordinates (3, 6), and the first parameter may be represented as [1000 x (1, 1) ] and [4000 x (3, 6) ].
S10412, counting the total number of users in the single-day flow distribution data to obtain a second parameter.
Along the above example, the second parameter may be expressed as [1000+4000].
S10413, determining the ratio of the sum value of each first parameter to the second parameter as the first target position.
Along the above example, the first target position may be expressed as [1000 (1, 1) +4000 (3, 6) ]/[1000+4000].
According to the embodiment of the application, the user flow path can be reduced to the maximum extent by accurately determining the first target position and predicting from the angle of the user flow direction, the first target position of the user flow cost is saved, and the position of the target service node determined based on the first target position can correspondingly reduce the user flow cost, so that the position of the target service node is convenient for providing service for the user, the service node splitting success rate is improved, and the node splitting failure probability is reduced.
S1042, determining a first weight, wherein the first weight is the sum value of the number of users in each single-day flow distribution data.
Along with the above example, the single day traffic distribution data generated on monday may be: the number of users in store a to designated position P1 is 1000, and the number of users in store a to designated position P2 is 4000. The single day flow distribution data generated on Tuesday may be: the user of store a to designated position P1 is 2000 and the user of store a to designated position P2 is 3000. The number of users in the monday single day traffic distribution data is 5000 and the number of users in the monday single day traffic distribution data is 5000. And recording the accumulated value of the number of users in the single-day flow distribution data from Monday to Sunday as the first weight.
S1043, clustering potential users according to the potential user distribution for each single day in the preset time interval to obtain a second target position.
Referring to fig. 4, a second target location determination method is shown. And clustering the potential users based on the position according to the potential user distribution for each single day in the preset time interval to obtain a second target position, wherein the clustering comprises the following steps:
S10431, clustering the potential users based on positions according to each single day in the preset time interval to obtain clustering positions.
S10432. determining a first number, which is the total number of potential users on the single day, and a second number, which is the total number of users of the single day using the services of the reference service node.
S10433, determining the ratio of the first quantity to the second quantity as a first clustering weight.
S10434, determining the sum value of the first clustering weights corresponding to each single day in the preset time interval as a second clustering weight.
S10435, multiplying the clustering position by the first clustering weight, and determining the ratio of the multiplication result to the second clustering weight as a second target position corresponding to the single day.
For example, if 100 potential users exist near the monday reference service node, 100 location points are formed, and the 100 location points are clustered, so that a clustered location P3 can be obtained, and 100 is the total number of potential users on a single day of monday, that is, the first number corresponding to monday. In the embodiment of the application, the user checked in at the reference service node can be considered as the user using the reference service node for service. If the number of members checked in by the reference service node on monday is 1000, the 1000 is the total number of users checked in by the reference service node on a single day on monday, that is, the second number corresponding to monday. 100/1000 is the first clustering weight of Monday. And adding the first clustering weights from Monday to Sunday to obtain a second clustering weight.
And the ratio of the product of the corresponding cluster position P3 of the Monday and the corresponding first cluster weight to the second cluster weight is the second target position. For example, if the cluster position P3 corresponding to monday is (1, 1), the first cluster weight is 0.1, and the second cluster weight is 0.6, [0.1 (1, 1)/0.6 ] is the second target position.
According to the embodiment of the application, the second target position can be predicted from the distribution angle of the potential users, the potential users are potential users of the reference service node by accurately determining the second target position, the second target position is determined based on the distribution of the potential users, the target service node determined based on the second target position can be located in the possible visiting regional range of the potential users, in other words, the target service node determined based on the second target position can shunt the potential users of the reference service node. Therefore, the position of the target service node is convenient for providing service for potential users, the service node splitting success rate is improved, and the node splitting failure probability is reduced.
S1044, determining a second weight, wherein the second weight is a sum value of the number of users using the service provided by the reference service node in each single day.
Along with the above example, the number of members checked in on monday is 1000 and the number of members checked in on monday is 4000. And recording the accumulated value of the membership number checked in on each single day from Monday to Sunday as the second weight.
S1045, determining the position of the target service node according to the first target position, the first weight, the second target position and the second weight.
Referring to fig. 5, a flow chart of a method for determining the location of a target serving node is shown. The determining the location of the target service node according to the first target location, the first weight, the second target location, and the second weight includes:
S10451, directly adding coordinates of a second target position corresponding to each single day to obtain a first reference position.
S10452, performing first weighted average on coordinates of a first target position corresponding to each single day to obtain a second reference position, wherein in the execution process of the first weighted average, the weight of the coordinates of the first target position corresponding to each single day is the number of users in the flow distribution data of each single day.
S10453, performing second weighted average on the first reference position and the second reference position to obtain the position of the target service node, wherein in the execution process of the second weighted average, the weight corresponding to the first reference position is the first weight, and the weight corresponding to the second reference position is the second weight.
In the embodiment of the application, the position of the target service node is determined from two aspects of flow data and the potential user distribution, and the position of the target service node can be beneficial to reducing the flow cost of the user by analyzing the flow data; by analyzing the potential user distribution, the target service node can be ensured to split potential users of the reference service node, so that the target service node has attractive force on the ground for the users and the potential users relative to the reference service node, the target service node is convenient to attract the users and the potential users of the reference service node, the splitting effect of the service node is optimized, and the splitting success rate of the service node is improved.
The embodiment of the application also discloses a device for determining the position of the target service node, as shown in fig. 6, the device comprises:
A reference service node determining module 101, configured to determine a reference service node of the target service node;
The flow data acquisition module 102 is configured to acquire flow data generated by the reference service node in a preset time interval, where the flow data represents a flow path of a user in the reference service node;
A potential user distribution obtaining module 103, configured to obtain a potential user distribution of the reference service node in a preset time interval, where a distance between the potential user and a location where the reference service node is located is smaller than a preset threshold;
a location determining module 104, configured to determine a location of the target service node according to the traffic data and the potential user distribution.
Specifically, the embodiment of the application discloses a position determining device of a target service node and the corresponding method embodiment based on the same inventive concept. Please refer to the method embodiment for details, which will not be described herein.
Embodiments of the present application also provide a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions, so that the computer device performs the method for determining the location of the target service node.
The embodiment of the application also provides a computer readable storage medium, which can store a plurality of instructions. The above instructions may be adapted to be loaded and executed by a processor to perform the method for determining the location of a target serving node according to the embodiment of the present application.
Further, fig. 7 shows a schematic diagram of a hardware structure of an apparatus for implementing the method provided by the embodiment of the present application, where the apparatus may participate in forming or including the device or the system provided by the embodiment of the present application. As shown in fig. 7, the apparatus 10 may include one or more processors 102 (shown as 102a, 102b, … …,102n in the figures) which may include, but are not limited to, processing means such as a microprocessor MCU or a programmable logic device FPGA, a memory 104 for storing data, and a transmission means 106 for communication functions. In addition, the method may further include: a display, an input/output interface (I/O interface), a Universal Serial Bus (USB) port (which may be included as one of the ports of the I/O interface), a network interface, a power supply, and/or a camera. It will be appreciated by those of ordinary skill in the art that the configuration shown in fig. 7 is merely illustrative and is not intended to limit the configuration of the electronic device described above. For example, the device 10 may also include more or fewer components than shown in fig. 7, or have a different configuration than shown in fig. 7.
It should be noted that the one or more processors 102 and/or other data processing circuits described above may be referred to generally herein as "data processing circuits. The data processing circuit may be embodied in whole or in part in software, hardware, firmware, or any other combination. Further, the data processing circuitry may be a single stand-alone processing module, or incorporated in whole or in part into any of the other elements in the device 10 (or mobile device). As referred to in embodiments of the application, the data processing circuit acts as a processor control (e.g., selection of the path of the variable resistor termination connected to the interface).
The memory 104 may be used to store software programs and modules of application software, such as program instructions/data storage devices corresponding to the above-mentioned methods in the embodiments of the present application, and the processor 102 executes the software programs and modules stored in the memory 104, thereby performing various functional applications and data processing, that is, implementing the above-mentioned location determining method of the target service node. Memory 104 may include high-speed random access memory, and may also include non-volatile memory, such as one or more magnetic storage devices, flash memory, or other non-volatile solid-state memory. In some examples, memory 104 may further include memory located remotely from processor 102, which may be connected to device 10 via a network. Examples of such networks include, but are not limited to, the internet, intranets, local area networks, mobile communication networks, and combinations thereof.
The transmission means 106 is arranged to receive or transmit data via a network. Specific examples of the network described above may include a wireless network provided by a communications provider of device 10. In one example, the transmission device 106 includes a network adapter (NetworkInterfaceController, NIC) that can connect to other network devices through a base station to communicate with the internet. In one example, the transmission device 106 may be a radio frequency (RadioFrequency, RF) module for communicating wirelessly with the internet.
The display may be, for example, a touch screen type Liquid Crystal Display (LCD) that may enable a user to interact with a user interface of the device 10 (or mobile device).
It should be noted that: the sequence of the embodiments of the present application is only for description, and does not represent the advantages and disadvantages of the embodiments. And the foregoing description has been directed to specific embodiments of this application. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
All the embodiments of the present application are described in a progressive manner, and identical and similar parts of all the embodiments are mutually referred to, and each embodiment mainly describes differences from other embodiments. In particular, for the device and server embodiments, since they are substantially similar to the method embodiments, the description is relatively simple, and references to the parts of the description of the method embodiments are only required.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program for instructing relevant hardware, where the program may be stored in a computer readable storage medium, and the storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
The foregoing description of the preferred embodiments of the present application is not intended to limit the embodiments of the present application, but is intended to cover all modifications, equivalents, improvements and alternatives falling within the spirit and principles of the embodiments of the present application.

Claims (6)

1. A method for determining a location of a target serving node, the method comprising:
determining a reference service node of the target service node;
For each single day in a preset time interval, determining corresponding single day flow distribution data, wherein the single day flow distribution data represents the number of users flowing from the reference service node to a designated position in the single day;
for each single day within the preset time interval, determining a corresponding single-day potential user distribution, wherein the single-day potential user distribution characterizes the positions of potential users in the single day, and the distance between the potential users and the positions of the reference service nodes is smaller than a preset threshold value;
For each single day in the preset time interval, for each designated position, calculating the number of users flowing to the designated position, and determining the product of the number of users and the designated position as a first parameter; counting the total number of users in the single-day flow distribution data to obtain a second parameter; determining the ratio of the sum value of each first parameter to the second parameter as a first target position;
determining a first weight, wherein the first weight is a sum value of the number of users in each single-day flow distribution data;
clustering potential users based on positions according to the potential user distribution for each single day in the preset time interval to obtain a second target position;
determining a second weight, wherein the second weight is a sum value of the number of users using the service provided by the reference service node in each single day;
And determining the position of the target service node according to the first target position, the first weight, the second target position and the second weight.
2. The method according to claim 1, wherein said clustering potential users based on the potential user distribution for each single day within the preset time interval to obtain a second target location comprises:
Clustering the potential users based on the positions for each single day in the preset time interval to obtain clustering positions;
determining a first number and a second number, the first number being a total number of potential users for the single day, the second number being a total number of users for the single day using the services of the reference service node;
determining a ratio of the first number to the second number as a first cluster weight;
Determining the sum value of the first clustering weights corresponding to each single day in the preset time interval as a second clustering weight;
Multiplying the clustering position by the first clustering weight, and determining the ratio of the multiplication result to the second clustering weight as a second target position corresponding to the single day.
3. The method of claim 2, wherein said determining the location of the target service node based on the first target location, the first weight, the second target location, and the second weight comprises:
directly adding coordinates of a second target position corresponding to each single day to obtain a first reference position;
carrying out first weighted average on the coordinates of the first target position corresponding to each single day to obtain a second reference position, wherein in the execution process of the first weighted average, the weight of the coordinates of the first target position corresponding to each single day is the number of users in the flow distribution data of each single day;
And performing second weighted average on the first reference position and the second reference position to obtain the position of the target service node, wherein in the execution process of the second weighted average, the weight corresponding to the first reference position is the first weight, and the weight corresponding to the second reference position is the second weight.
4. A location determining apparatus of a target service node, the apparatus comprising:
The reference service node determining module is used for determining a reference service node of the target service node;
The flow data acquisition module is used for determining corresponding single-day flow distribution data for each single day in a preset time interval, wherein the single-day flow distribution data represents the number of users flowing from the reference service node to a designated position in the single day;
the potential user distribution acquisition module is used for determining corresponding single-day potential user distribution for each single day in the preset time interval, wherein the single-day potential user distribution characterizes the positions of potential users in the single day, and the distance between the potential users and the positions of the reference service nodes is smaller than a preset threshold value;
the position determining module is used for executing the following operations:
For each single day in the preset time interval, for each designated position, calculating the number of users flowing to the designated position, and determining the product of the number of users and the designated position as a first parameter; counting the total number of users in the single-day flow distribution data to obtain a second parameter; determining the ratio of the sum value of each first parameter to the second parameter as a first target position;
determining a first weight, wherein the first weight is a sum value of the number of users in each single-day flow distribution data;
clustering potential users based on positions according to the potential user distribution for each single day in the preset time interval to obtain a second target position;
determining a second weight, wherein the second weight is a sum value of the number of users using the service provided by the reference service node in each single day;
And determining the position of the target service node according to the first target position, the first weight, the second target position and the second weight.
5. An electronic device comprising a processor and a memory, wherein at least one instruction or at least one program is stored in the memory, the at least one instruction or the at least one program being loaded and executed by the processor to implement a method of determining a location of a target service node according to any one of claims 1 to 3.
6. A computer readable storage medium having stored therein at least one instruction or at least one program loaded and executed by a processor to implement a method of location determination of a target serving node according to any of claims 1 to 3.
CN202110551885.4A 2021-05-20 2021-05-20 Position determining method and device of target service node and electronic equipment Active CN113301138B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202110551885.4A CN113301138B (en) 2021-05-20 2021-05-20 Position determining method and device of target service node and electronic equipment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110551885.4A CN113301138B (en) 2021-05-20 2021-05-20 Position determining method and device of target service node and electronic equipment

Publications (2)

Publication Number Publication Date
CN113301138A CN113301138A (en) 2021-08-24
CN113301138B true CN113301138B (en) 2024-05-07

Family

ID=77323072

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110551885.4A Active CN113301138B (en) 2021-05-20 2021-05-20 Position determining method and device of target service node and electronic equipment

Country Status (1)

Country Link
CN (1) CN113301138B (en)

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103440589A (en) * 2013-09-17 2013-12-11 上海商学院 Store site selection system and method
WO2018194659A1 (en) * 2017-04-21 2018-10-25 Hewlett-Packard Development Company, L.P. Printer service station
WO2020044097A1 (en) * 2018-08-27 2020-03-05 优视科技新加坡有限公司 Method and apparatus for implementing location-based service
EP3644242A1 (en) * 2018-10-23 2020-04-29 Honda Research Institute Europe GmbH System and method for optimizing a service station layout
CN111242666A (en) * 2018-11-29 2020-06-05 Tcl集团股份有限公司 Store site selection method based on big data analysis, storage medium and server
CN111985576A (en) * 2020-09-02 2020-11-24 南宁师范大学 Shop address selection method based on decision tree
CN112308603A (en) * 2020-10-13 2021-02-02 深圳坤湛科技有限公司 Similarity expansion-based rapid store site selection method and device and storage medium

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7774227B2 (en) * 2007-02-23 2010-08-10 Saama Technologies, Inc. Method and system utilizing online analytical processing (OLAP) for making predictions about business locations
CN111865781B (en) * 2019-04-25 2022-10-11 伊姆西Ip控股有限责任公司 Method, apparatus and computer program product for path optimization

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103440589A (en) * 2013-09-17 2013-12-11 上海商学院 Store site selection system and method
WO2018194659A1 (en) * 2017-04-21 2018-10-25 Hewlett-Packard Development Company, L.P. Printer service station
WO2020044097A1 (en) * 2018-08-27 2020-03-05 优视科技新加坡有限公司 Method and apparatus for implementing location-based service
EP3644242A1 (en) * 2018-10-23 2020-04-29 Honda Research Institute Europe GmbH System and method for optimizing a service station layout
CN111242666A (en) * 2018-11-29 2020-06-05 Tcl集团股份有限公司 Store site selection method based on big data analysis, storage medium and server
CN111985576A (en) * 2020-09-02 2020-11-24 南宁师范大学 Shop address selection method based on decision tree
CN112308603A (en) * 2020-10-13 2021-02-02 深圳坤湛科技有限公司 Similarity expansion-based rapid store site selection method and device and storage medium

Also Published As

Publication number Publication date
CN113301138A (en) 2021-08-24

Similar Documents

Publication Publication Date Title
CN109377329B (en) House resource recommendation method and device, storage medium and electronic equipment
EP2996366B1 (en) Application recommendation method, system and server
CN108762880B (en) Method and device for determining display position of recommended content
CN111739283B (en) Road condition calculation method, device, equipment and medium based on clustering
CN105956422A (en) Method and system for controlling usage of software programs on mobile computing devices
CN113301138B (en) Position determining method and device of target service node and electronic equipment
CN109240899A (en) Information acquisition method and device
CN113743777B (en) Service resource allocation method and device, storage medium and electronic equipment
CN109325095B (en) Method, device and storage medium for counting issued sharing information
CN110941887A (en) Base station layout method, device, medium and equipment
CN113792058B (en) Index data processing method and device, electronic equipment and storage medium
CN105792235A (en) Data flow statistical method and device
CN112274929A (en) Game control method and device, electronic equipment and storage medium
CN114817409A (en) Label generation method, device, equipment and medium
CN111678519B (en) Intelligent navigation method, device and storage medium
CN115086194A (en) Data transmission method for cloud application, computing equipment and computer storage medium
CN113157460B (en) Service node splitting method and device, storage medium and electronic equipment
CN111061878A (en) Page clustering method, device, medium and equipment
CN112619149A (en) Full-automatic path finding control method and device, electronic equipment and storage medium
CN113159648B (en) Service consumption capability determining method and device of service node and electronic equipment
CN110647543A (en) Data aggregation method, device and storage medium
CN112884497A (en) Method and device for determining user type, electronic equipment and storage medium
CN110633115A (en) Task distribution method and device, electronic equipment and storage medium
CN111291291B (en) Page loading time processing method, device and system
CN111080372B (en) Accurate advertising device and equipment

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