Application data processing method for martial art event

Abstract

The invention relates to the technical field of data processing, and particularly discloses an application data processing method for martial art events, which comprises the following steps: S1, counting target information of a putting area in a monitoring time period; s2, determining coordinates of a target position; determining a symmetric point, and taking the symmetric point as a target position; clustering the target position to obtain a cluster, and determining a minimum bounding rectangle of the cluster; determining a to-be-selected position according to the initial position and the center of the minimum enclosing rectangle; s3, determining the distance between the to-be-selected positions, when the distance between the to-be-selected positions is smaller than or equal to a distance threshold value, removing the to-be-selected positions with fewer target numbers, updating the position sequence to determine new to-be-selected positions until the distance between all the to-be-selected positions is larger than the distance threshold value, taking the to-be-selected position at the moment as a first position, and taking the to-be-selected position at the moment as a second position; and determining an advertisement putting position Z based on the first position. According to the invention, the coverage rate of the target audience is improved by optimizing the advertisement putting position.

Description

Technical Field

[0001] The present invention relates to the technical field of data processing, and in particular to a registration data processing method for a martial arts competition. Background Art

[0002] A martial arts event is a competitive competition with martial arts as the main content, which showcases and evaluates the contestants' martial arts skills, physical fitness, techniques and styles. There are many types of martial arts events, including traditional martial arts, modern martial arts and mixed martial arts. Competition items are usually set according to different martial arts schools and technical characteristics.

[0003] Promotional advertisements for martial arts events are visual materials used to promote and advertise martial arts events. They usually contain information such as registration QR codes, which are convenient for spectators or participants to register to watch the event or obtain more event information by scanning the QR codes. However, the location of advertisements is often based on the organizer's intuitive judgment, which is easily affected by experience bias and may not accurately reach the target audience. Summary of the invention

[0004] The purpose of the present invention is to provide a registration data processing method for martial arts events to solve the following technical problems: The location of advertisements is often based on the organizer’s intuitive judgment, which is easily affected by experience bias and may not accurately reach the target audience.

[0005] The purpose of the present invention can be achieved through the following technical solutions: A method for processing registration data for a martial arts competition comprises the following steps: S1: In a preset delivery area, the advertisements delivered within a preset monitoring period are taken as target advertisements, and target information is counted, wherein the target information includes a target location and a target number of people, wherein the target location is the location where the target advertisement is delivered, and the target number of people is the total number of applicants corresponding to a single target advertisement; S2: Determine the maximum number of target people, establish a coordinate system with the target position corresponding to the maximum number of target people as the origin, determine the coordinates W (x, y) of the target position, where x and y represent the horizontal coordinate and vertical coordinate of the target position respectively, and use the x-axis, y-axis and straight line y=x as symmetry axes respectively, and perform symmetric transformation on the coordinates of the target position to obtain the symmetric point W x (x, -y), W y (-x, y) and W xy (-x, -y); Taking the symmetrical point as the target position, clustering the target position based on the coordinates of the target position to obtain a cluster, determining the area composed of all the target positions in the cluster, and determining the minimum circumscribed rectangle of the area; The target positions in the clusters are sorted in descending order according to the number of target people to obtain a position ranking, the top 30% of the target positions in the position ranking are taken as the initial positions, a ray is made from the center of the minimum enclosing rectangle as the starting point through the initial position, and the intersection of the ray and the minimum enclosing rectangle is taken as the candidate position; S3: Determine the distance D between any two candidate positions, set a distance threshold Dys, and when the distance D≤Dys, remove the candidate positions corresponding to the smaller number of target persons, determine the position ranking b corresponding to the removed candidate positions, remove the initial position in the position ranking b to obtain a new position ranking B, take the first target position in the position ranking B as the initial position, and determine a new candidate position; Repeat the above steps until the distances between all candidate positions are greater than the distance threshold Dys, and take the candidate positions that have not been removed at this time as the first position. With the first position as the center, determine a circular area with a radius of a preset value Y, and determine the advertising placement position in the circular area that is closest to the first position, and use it as the advertising placement position Z for the current martial arts event.

[0006] As a further solution of the present invention: the step S2 further includes the following steps: Determine the target position a that is closest to the symmetrical point and calculate the difference in the number of people ΔC=C dc -C a , where C dc represents the number of targets at the target position corresponding to the symmetrical point, C a Indicates the target number of people at the target position a; A number difference threshold ΔCys is set, and when the number difference ΔC≥ΔCys, the symmetrical point is removed.

[0007] As a further solution of the present invention: in the step S2, when the number of target positions in the cluster is less than 5, the center of the corresponding minimum circumscribed rectangle is used as the first position.

[0008] As a further solution of the present invention: when there are two or more target numbers that are the same and are the maximum target number, the target number that is closer to the center of the delivery area is used as the maximum target number.

[0009] As a further solution of the present invention: in the step S2, when the target number of people is greater than or equal to 0.7Cmax, the corresponding target position is used as the initial position, and Cmax represents the maximum target number of people.

[0010] As a further solution of the present invention: in step S1, the process of determining the target number of people specifically includes: With the target position as the center, a circular area with a radius of a preset value r is made. When a user registers within the circular area, the user is marked as a user who registers through the target position. The total number of users who register through the target position is counted and used as the target number.

[0011] As a further solution of the present invention: in the step S1, the process of determining the target number of people also includes the following steps: When two or more target positions overlap, the average of the number of targets at the overlapping target positions is calculated and used as the average number of targets at the overlapping target positions.

[0012] As a further solution of the present invention: when the difference between a certain target number of people and the mean is greater than or equal to a preset standard threshold of the number difference, the target number of people is removed and the mean is calculated again.

[0013] Beneficial effects of the present invention: In this solution, by counting (target position) and the corresponding total number of applicants (target number), a reliable data basis is provided for subsequent analysis, and by understanding the effects of historical advertisements, the delivery strategy of new advertisements is guided, and real data is used to support decision-making rather than relying on subjective judgment; by establishing a coordinate system with the maximum target number of people as the origin and generating symmetric points, a spatial comparison benchmark is provided to help analyze the distribution and coverage of the target position, and by introducing symmetric points, potential supplementary points of the target position are explored, which helps to evenly cover the area; by clustering and minimum bounding rectangles, the concentrated distribution area of ​​the target position is identified, and a rectangular frame that can be effectively covered is constructed, providing a range limitation for subsequent further screening, thereby simplifying the data processing of large-scale target positions and converting them into easily manageable clusters, and, by the minimum bounding rectangle, the advertisements are quickly determined. The possible range of delivery is to avoid missing key areas; sort by target number and select the top 30% of target positions, so as to give priority to areas with high attractiveness and maximize the publicity effect of the advertisement; the ray can pass through multiple initial positions (areas with high target number) when starting from the center, and the intersection is a further extrapolation of these points, which can dynamically generate more points with potential, so as to start from known high-quality points and explore the boundaries, which can be regarded as a heuristic optimization strategy to help dynamically screen the best candidate position; the center of the minimum circumscribed rectangle is the geometric center of the area, and the ray is extended outward based on it, and the intersection obtained can ensure that the selected candidate position covers the entire target area as much as possible; finally, through distance screening, points that are too close are eliminated to avoid waste of resources, and at the same time, the target coverage range is optimized, thereby reducing repeated coverage between target positions and improving the independence of distribution. The present invention improves the coverage rate of the target audience by optimizing the advertising delivery position. BRIEF DESCRIPTION OF THE DRAWINGS

[0014] The present invention will be further described below in conjunction with the accompanying drawings.

[0015] Figure 1 The present invention is a flowchart of a method for processing registration data for martial arts competitions. DETAILED DESCRIPTION

[0016] The following will be combined with the drawings in the embodiments of the present invention to clearly and completely describe the technical solutions in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work are within the scope of protection of the present invention.

[0017] See also Figure 1 As shown, the present invention is a registration data processing method for martial arts competitions, comprising the following steps: S1: In a preset delivery area, the advertisements delivered within a preset monitoring period are taken as target advertisements, and target information is counted, wherein the target information includes a target location and a target number of people, wherein the target location is the location where the target advertisement is delivered, and the target number of people is the total number of applicants corresponding to a single target advertisement; S2: Determine the maximum number of target people, establish a coordinate system with the target position corresponding to the maximum number of target people as the origin, determine the coordinates W (x, y) of the target position, where x and y represent the horizontal coordinate and vertical coordinate of the target position respectively, and use the x-axis, y-axis and straight line y=x as symmetry axes respectively, and perform symmetric transformation on the coordinates of the target position to obtain the symmetric point W x (x, -y), W y (-x, y) and W xy (-x, -y); Taking the symmetrical point as the target position, clustering the target position based on the coordinates of the target position to obtain a cluster, determining the area composed of all the target positions in the cluster, and determining the minimum circumscribed rectangle of the area; The target positions in the clusters are sorted in descending order according to the number of target people to obtain a position ranking, the top 30% of the target positions in the position ranking are taken as the initial positions, a ray is made from the center of the minimum enclosing rectangle as the starting point through the initial position, and the intersection of the ray and the minimum enclosing rectangle is taken as the candidate position; S3: Determine the distance D between any two candidate positions, set a distance threshold Dys, and when the distance D≤Dys, remove the candidate positions corresponding to the smaller number of target persons, determine the position ranking b corresponding to the removed candidate positions, remove the initial position in the position ranking b to obtain a new position ranking B, take the first target position in the position ranking B as the initial position, and determine a new candidate position; Repeat the above steps until the distances between all candidate positions are greater than the distance threshold Dys, and take the candidate positions that have not been removed at this time as the first position. With the first position as the center, determine a circular area with a radius of a preset value Y, and determine the advertising placement position in the circular area that is closest to the first position, and use it as the advertising placement position Z for the current martial arts event.

[0018] It should be noted that by counting (target position) and the corresponding total number of applicants (target number), a reliable data basis is provided for subsequent analysis. By understanding the effects of historical advertisements, the delivery strategy of new advertisements can be guided, and real data can be used to support decision-making rather than relying on subjective judgment. By establishing a coordinate system with the maximum target number of people as the origin and generating symmetric points, a spatial comparison benchmark is provided to help analyze the distribution and coverage of the target position. By introducing symmetric points, potential supplementary points of the target position are explored, which helps to evenly cover the area. Through clustering and minimum enclosing rectangles, concentrated distribution areas of target positions are identified, and rectangular frames that can be effectively covered are constructed to provide range limitations for subsequent further screening, thereby simplifying the data processing of large-scale target positions and converting them into easily manageable clustering clusters. In addition, through the minimum enclosing rectangle, the feasible advertising locations can be quickly determined. energy range to avoid missing key areas; sort by target population and select the top 30% of target locations, so as to give priority to areas with high appeal and maximize the publicity effect of the advertisement; the ray can pass through multiple initial positions (areas with high target population) when starting from the center, and the intersection is a further extrapolation of these points, which can dynamically generate more points with potential, so as to explore the boundaries from known high-quality points, which can be regarded as a heuristic optimization strategy to help dynamically screen the best candidate positions; the center of the minimum circumscribed rectangle is the geometric center of the area, and the rays are extended outward based on it, and the intersection points obtained can ensure that the selected candidate positions cover the entire target area as much as possible; finally, through distance screening, points that are too close are eliminated to avoid waste of resources, and at the same time optimize the target coverage range, thereby reducing repeated coverage between target positions and improving the independence of distribution.

[0019] In another preferred embodiment of the present invention, the step S2 further includes the following steps: Determine the target position a that is closest to the symmetrical point and calculate the difference in the number of people ΔC=C dc -C a , where Cdc represents the number of targets at the target position corresponding to the symmetrical point, C a Indicates the target number of people at the target position a; A number difference threshold ΔCys is set, and when the number difference ΔC≥ΔCys, the symmetrical point is removed.

[0020] It is worth noting that after the symmetrical points are generated, by comparing the difference in the number of targets between the symmetrical points and the actual target positions, the symmetrical points that deviate too much from the actual effect are eliminated to ensure that the finally selected symmetrical points are in line with the actual distribution of the target population; by setting the threshold ΔCys, those symmetrical points that do not match the actual data are filtered out to avoid decision-making bias due to symmetrical transformation; after eliminating invalid symmetrical points, the remaining symmetrical points can more realistically reflect the potential attractiveness of the target area; avoid further processing of positions that do not conform to the actual situation, save computing resources, and improve the efficiency of the solution.

[0021] In another preferred embodiment of the present invention, when the number of target positions in the cluster is less than 5, the center of the corresponding minimum circumscribed rectangle is used as the first position.

[0022] It is understandable that when a cluster has fewer target positions (less than 5), it means that the target population in the area is sparsely distributed, or the potential target coverage in the area is limited. In this case, further refining the distribution of resources may lead to resource waste. Therefore, using the center of the minimum circumscribed rectangle of the cluster as the first sticky position can cover the entire cluster.

[0023] In another preferred embodiment of the present invention, when there are two or more target numbers that are the same and are the maximum target number, the target number that is closer to the center of the delivery area is used as the maximum target number.

[0024] It should be noted that the center of the delivery area is usually regarded as the core location of the entire area. The closer the location is to the center, the greater the radiation potential and the more target people can be reached. Therefore, choosing a location closer to the center can better cover key areas. Points closer to the center usually have a larger radiation range and can cover more potential target areas, thereby improving overall coverage efficiency.

[0025] In another preferred embodiment of the present invention, in step S2, when the target number of people is greater than or equal to 0.7Cmax, the corresponding target position is used as the initial position, and Cmax represents the maximum target number of people.

[0026] It should be noted that the number of target people at the target locations reaches or exceeds 0.7Cmax, indicating that these locations already have high attractiveness or target coverage potential, and therefore, these locations are selected as initial locations.

[0027] In another preferred embodiment of the present invention, in step S1, the process of determining the target number of people specifically includes: With the target position as the center, a circular area with a radius of a preset value r is made. When a user registers within the circular area, the user is marked as a user who registers through the target position. The total number of users who register through the target position is counted and used as the target number.

[0028] In another preferred embodiment of the present invention, in step S1, the process of determining the target number of people further includes the following steps: When two or more target positions overlap, the average of the number of targets at the overlapping target positions is calculated and used as the average number of targets at the overlapping target positions.

[0029] In another preferred embodiment of the present invention, when the difference between a certain target number of people and the mean is greater than or equal to a preset standard threshold of the number of people difference, the target number of people is removed and the mean is calculated again.

[0030] The above is a detailed description of an embodiment of the present invention, but the content is only a preferred embodiment of the present invention and cannot be considered to limit the scope of implementation of the present invention. All equivalent changes and improvements made within the scope of the present invention should still fall within the scope of the patent coverage of the present invention.

Claims

1. A method for processing registration data for martial arts events, characterized in that: The following steps are involved: S1: In a preset delivery area, the advertisements delivered within a preset monitoring period are taken as target advertisements, and target information is counted, wherein the target information includes a target location and a target number of people, wherein the target location is the location where the target advertisement is delivered, and the target number of people is the total number of applicants corresponding to a single target advertisement; S2: Determine the maximum number of target people, establish a coordinate system with the target position corresponding to the maximum number of target people as the origin, determine the coordinates W (x, y) of the target position, where x and y represent the horizontal coordinate and vertical coordinate of the target position respectively, and use the x-axis, y-axis and straight line y=x as symmetry axes respectively, and perform symmetric transformation on the coordinates of the target position to obtain the symmetric point W x (x, -y), W y (-x, y) and W xy (-x, -y); Taking the symmetrical point as the target position, clustering the target position based on the coordinates of the target position to obtain a cluster, determining the area composed of all the target positions in the cluster, and determining the minimum circumscribed rectangle of the area; The target positions in the clusters are sorted in descending order according to the number of target people to obtain a position ranking, the top 30% of the target positions in the position ranking are taken as the initial positions, a ray is made from the center of the minimum enclosing rectangle as the starting point through the initial position, and the intersection of the ray and the minimum enclosing rectangle is taken as the candidate position; S3: Determine the distance D between any two candidate positions, set a distance threshold Dys, and when the distance D≤Dys, remove the candidate positions corresponding to the smaller number of target persons, determine the position ranking b corresponding to the removed candidate positions, remove the initial position in the position ranking b to obtain a new position ranking B, take the first target position in the position ranking B as the initial position, and determine a new candidate position; Repeat the above steps until the distances between all candidate positions are greater than the distance threshold Dys, and take the candidate positions that have not been removed at this time as the first position. With the first position as the center, determine a circular area with a radius of a preset value Y, and determine the advertising placement position in the circular area that is closest to the first position, and use it as the advertising placement position Z for the current martial arts event.

2. A method for processing registration data for martial arts events according to claim 1, characterized in that: The step S2 further includes the following steps: Determine the target position a that is closest to the symmetrical point and calculate the difference in the number of people ΔC=C dc -C a , where C dc represents the number of targets at the target position corresponding to the symmetrical point, C a Indicates the target number of people at the target position a; A number difference threshold ΔCys is set, and when the number difference ΔC≥ΔCys, the symmetrical point is removed.

3. A method for processing registration data for martial arts events according to claim 1, characterized in that: In the step S2, when the number of target positions in the cluster is less than 5, the center of the corresponding minimum circumscribed rectangle is used as the first position.

4. A method for processing registration data for martial arts events according to claim 1, characterized in that: When there are two or more target numbers that are the same and are the maximum target number, the target number that is closer to the center of the delivery area will be taken as the maximum target number.

5. A method for processing registration data for martial arts events according to claim 1, characterized in that: In the step S2, when the target number of people is greater than or equal to 0.7Cmax, the corresponding target position is used as the initial position, and Cmax represents the maximum target number of people.

6. A method for processing registration data for martial arts events according to claim 1, characterized in that: In step S1, the process of determining the target number of people specifically includes: With the target position as the center, a circular area with a radius of a preset value r is made. When a user registers within the circular area, the user is marked as a user who registers through the target position. The total number of users who register through the target position is counted and used as the target number.

7. A method for processing registration data for martial arts events according to claim 1, characterized in that: In step S1, the process of determining the target number of people also includes the following steps: When two or more target positions overlap, the average of the number of targets at the overlapping target positions is calculated and used as the average number of targets at the overlapping target positions.

8. A method for processing registration data for martial arts events according to claim 7, characterized in that: When the difference between a target number of people and the mean is greater than or equal to the preset standard threshold of the number difference, the target number of people is removed and the mean is calculated again.

Images