Analysis Technology of Tennis Sports Match Based on Data Mining and Image Feature Retrieval

Tennis game technical analysis is affected by factors such as complex background and on-site noise, which will lead to certain deviations in the results, and it is difficult to obtain scientific and effective tennis technical training strategies through a few game videos. In order to improve the performance of tennis game technical analysis, based on machine learning algorithms, this paper combines image analysis to identify athletes’ movement characteristics and image feature recognition processing with image recognition technology, realizes real-time tracking of athletes’ dynamic characteristics, and records technical characteristics. Moreover, this paper combines data mining technology to obtain effective data from massive video and image data, uses mathematical statistics and data mining technology for data processing, and scientifically analyzes tennis game technology with the support of ergonomics. In addition, this paper designs a controlled experiment to verify the technical analysis effect of the tennis match and the performance of the model itself. )e research results show that the model constructed in this paper has certain practical effects and can be applied to actual competitions.


Introduction
Compared with traditional, technical, and tactical analysis methods, data mining technology can more clearly describe and analyze the process and sequence of each hitting technique, such as the position and route of the shot, and the process and sequence of winning and losing points. Moreover, it can help coaches to better grasp the commonalities and characteristics of players' skills and tactics, and provide reference and basis for the use of skills and tactics in future training and games [1]. In recent years, with the increase of opportunities for domestic players to participate in the competition, the increasingly abundant game videos have made the accumulation of technical and tactical data in the game continue to increase. How to explore the technical and tactical characteristics of excellent players from the rich data and provide a basis for the scientific decision-making of coaches and athletes has become one of the key and urgent problems in tennis theoretical research. In addition, the use of data mining technology to analyze the technical and tactical characteristics and laws of athletes in the game can obtain and find more valuable information and laws in a timely and accurate manner to make up for the deficiencies of traditional statistical methods. erefore, it is necessary for tennis players to use data mining technology to assist them in making technical and tactical decisions [2].
Compared with the popularity of established sports such as football and basketball, tennis has relatively few followers. However, with the development of mass sports and the influence of international tennis, tennis has developed rapidly in my country in recent years. Moreover, more and more people have begun to pay attention to large-scale tennis matches, and the annual four Grand Slam matches and various masters have attracted the attention of many fans [3].
e Tennis Open has introduced "Eagle Eye" technology, which can accurately determine whether the ball is out of bounds. Players have two applications for the right to use Hawkeye in each set. After the referee accepts the application, they will broadcast the "Instant Replay" on the big screen to present the results of Hawkeye's calculation.
e system takes no more than 10 seconds from data collection to result presentation. However, the system is composed of 8 or 10 high-speed cameras, four computers and a large screen, which makes the cost very high, and the amount of calculations when processing the collected data is very large [4]. Based on this, this article uses big data technology to analyze tennis sports matches, combined with machine vision to identify sports scenes, and improve the analysis effect of tennis sports matches.

Related Work
e literature [5] pointed out that when analyzing players and correcting their movements, a correct understanding of biomechanics will help coaches avoid focusing on peculiar, seemingly uncomfortable shots and help them focus on the timing of shots. e literature [6] proposed that the sequence of tennis coordination chain body segments is from the foot, hip, upper body, arm or shoulder, and elbow to wrist, and biomechanics is from knee flexion, hip rotation, body rotation, arm around shoulder, elbow extension, and forearm internal rotation to wrist rotation. e literature [7] analyzed the throw technique of tennis players in the Atlanta Olympic Games and showed that the throwing position is in front of the front foot or left front. High-speed camera technology is used for player analysis.
e results show that many excellent players start to hit the ball after the ball has started to fall (25-20 cm). e literature [8] mentioned technology alone cannot win the game; even if the technology is improved in daily training, if it cannot be played in the actual game, it is meaningless. At the same time, it is also mentioned that tennis is essentially control and anticontrol, and if the athlete controls the opponent throughout the game, he will definitely be able to win the game. Moreover, it is not only superlevel performance that can succeed. If the opponent can barely deal with it, the game will inevitably develop towards the side that is beneficial to oneself, and then victory can be expected. e literature [9] mentioned that in today's women's games, offense after serving is a very common tactic. e sooner the athletes play, the better. Moreover, the best measure is to start within the bottom line, which can put more pressure on the opponent. After serving, the backhand attacking athletes use the backhand to grab high points from the baseline, which sometimes poses a greater threat to the opponent than hitting hard. at is, it is commonly referred to as turning back. e literature [10] analyzed the impression of female tennis players from physical, technical, and psychological factors, and elaborated on the characteristics and trend distribution of the playing styles in modern female tennis. Moreover, it proposed that today's female tennis players have great offensive skills, and there will be more female players adopting more active offensive styles. For this reason, coaches should focus on developing young tennis players in the most ideal way and be fully prepared for future offensive play. e literature [11] believes that in tennis, players tend to adopt a certain style of play based on their own unique technical, physical, tactical, and psychological characteristics, and imitating a style of play at a young age also has an impact on the type of play used by an athlete. Moreover, it believes that players who want to develop the best type should be players with comprehensive skills. For this reason, coaches and athletes should ensure that training sessions and personal training include five actual combat training items: serving, receiving, bottom counter attack, cross-ball, and online volley. e literature [12] believed that most players play more defensively than offensively during the game. Even so, the result is that the mistakes in the game are greater than the active scoring, and in the game, the risk of offense is greater than that of defense. e literature [13] studied the differences in the tactics used by all-round players in the face of different play types. In the face of serving and Internet players, all-round players often have to improve their first serve success rate; that is, it does not hurt to spin more and slow down when serving. Moreover, by changing the serve point, all-round players can serve the opponent's body more often, thus avoiding the opponent's direct attack when receiving the serve. e literature [14] mentioned that the two-handed backhand stroke technique is the backhand stroke technique used by most athletes. Some athletes who are born with height and strength conditions are not particularly dominant, but have good flexibility and fast speed, and can use the two-handed backhand technique to better develop their tennis potential. At the same time, it recommends that players strengthen their physical fitness while learning to use the two-handed backhand technique, and continuously improve their tennis IQ, so that they can master the technique more quickly and promote the popularization of tennis. e literature [15] divided the technique of receiving and serving into two sections in the research of receiving and serving tennis. Among them, one is the front section of the shot, and the other is the shot section. e front part of the shot is composed of three parts: grip, position, and body posture. e position is generally near the bottom line and close to the sideline of singles, but the position should be selected according to the serving power and spin of the server and one serve and two serve. e literature [16] used the knowledge of system theory to conduct in-depth research on tennis serve when exploring the tennis serve system, and believed that tennis serve is not just a technical action, but a complete system. e literature [17] pointed out that the speed of serving is an effective way to affect the opponent's offensiveness and direct scoring. Under the condition of a certain speed, the player's choice of the ball's landing point can avoid the opponent's special skills and attack the opponent's weakness, which can more effectively restrain the opponent's performance and win the victory of the serve. e literature [18] used the American Peak three-dimensional high-speed video system and the video analysis system of the Aijie Human Information Institute to measure and analyze the kinematics data of the strong serve technique of domestic outstanding female tennis players. In the end, it is concluded that the vigorous serve of tennis is a whipping action. Moreover, the basic principles of the technique of serving are proposed and demonstrated. In addition, it is proposes that the hitting action is not a natural transition and extension of the swing action, but a relatively independent action technique with its own technical characteristics. e literature [19] took high-quality tennis matches 2 Complexity as the research object.
e success rate, scoring rate, straightness rate, and the outcome of a high-quality tennis match are related as follows. ose with a high success rate often cannot win the game, while those with a high scoring rate have a very high probability of winning. e literature [20] concluded that the first serve success rate and the first serve win rate in a tennis match are not positively correlated, and the statistical value of the first serve success rate has no substantial significance, and its level has little effect on the outcome of the game. However, the first serve win rate and the second serve win rate have a greater impact on the outcome of the game, and they are the two key indicators that determine the outcome of the game. From the above analysis, it can be seen that the relevant technology for tennis match analysis is currently relatively vacant. erefore, this article combines the actual needs of the tennis match to construct a corresponding visual analysis model, and performs action feature recognition and strategy improvement with the support of big data technology.

Machine Learning Model
is paper proposes three methods of action knowledge extraction based on the random forest model, so the first step is to establish a random forest model. In the process of establishing the random forest model, a data set (X, Y) is given. Among them, X � x 1 , . . . , x N is the attribute vector set and Y � y 1 , . . . , y N is the classification label set. Each attribute vector x →i � x i 1 , . . . , x l M has M attribute values; among them, each attribute value x j ∈ D j has a finite value range D j . x j can be categorical or numerical. e classification label Y has a finite value range D Y . If there is no ambiguity, x →i � x i 1 , . . . , x i M will also be represented by x → � x 1 , . . . , x M below. In order to simplify the description, this paper first only considers the case where the prediction classification is binary; that is, y ∈ 0, 1 { }. Only small changes are needed to extend the binary classification situation to a multiclass model [21]. A random forest model generally consists of K decision trees. Each decision tree k has an output function o k ( x → ), which means that a classification mark y ∈ D y is output when the input attribute vector is given. erefore, the output of the entire random forest is Among them, w k ∈ R is the weight of each decision tree. In addition, H( x → ) also has another probability representation. A classification mark c ∈ D Y is given: Among them, is an indicator function; when o k ( x → ) � c, its value is l, otherwise it is 0. An input vector x → is given, and the output prediction classification mark y H of the random forest model H( x → ) is [22] y H � arg max e random forest model modeling algorithm generally uses the following steps: for k � 1, . . . , k, (1) n k (0 < n k < N) data are sampled from the data set with replacement. (2) According to the n k data, a decision tree without pruning is trained. When building a decision tree model, the attribute set used to create a branch node is to randomly select a part of all attributes instead of using the entire attribute set to create a branch node. e output of most random forest models adopts a special form of formula (1) that is, we set w k � 1/k. erefore, formula (1) is simplified to [23] H Definition 1. Attribute segmentation: a random forest algorithm model H( x → ) will be given, and each attribute x i , i � 1, . . . , M will be divided into a certain number of intervals [24]: (1) If x i is categorized, and it contains n categories, then x i is logically divided into n intervals. x → vector correspond to each other, it is convenient for the following description. In the absence of ambiguity, x → will still be used to represent the segmentation vector p → below [25].
Definition 2. Attribute change: a random forest algorithm model H( x → ) is given, and τ represents attribute change, which is defined as a triplet τ � (x l , p, q). Among them, x i , i � 1, . . . , M, is a certain attribute, and the values of p and q represent two of x l attributes. If and only if there is an attribute value x i of the i-th attribute in the vector in the interval P, the attribute change τ is executable in the given vector x → . e function of the attribute change τ is to Complexity complete the transfer of the attribute value x i of the vector from the interval p to the interval q.
Definition 3. Action: a change set of attributes is defined as action a, a � τ 1 , . . . , τ |a| , and there is τ |a| ≥ 1, which means that at least one attribute change is in one action. e condition that an action executable on the x → vector needs to meet is that all attribute changes in the action can be executed on the vector x → . e execution of action a will generate a cost value; that is, π(a) > 0.
For the given attribute vector x → and the action a that can be performed on each attribute of x → , the final result vector of executing action a is x → ⊗ a.
In the absence of ambiguity, the problem, c ∈ D Y represents the final desired classification label, and A is the action set. Finding an action sequence A s is the ultimate goal of the AKE problem; among them, there is A s � a 1 , . . . , a n , a l ∈ A. e constraints to be satisfied by the action sequence A s are erefore, we obtain Among them, z represents a constant, 0 < z ≤ 1, and the target vector x →g is at is, the action sequence A s � a 1 , . . . , a n is sequentially applied to the input vector x →I , and the result vector is finally obtained. State is an ordered set of a minimum of variables q 0 , q 1 , . . . , q n introduced to describe the difference between a certain type of different things, and its vector form is as follows: Each element q l � (i � 0, 1, . . . , n) in the formula is a component of the set, which is called a state variable. Given a set of values for each component, a specific state is obtained: e means of changing a problem from one state to another is called an action, which is generally represented by a.
e state space of a problem (state space) is a graph that represents all possible states and their relationships to solve the problem. e state space is generally a directed graph, denoted by G � (V, A, G). Among them, V represents a node set, which is a set of all possible states. A represents the set (a 1 , a 2 , . . . , a n ) of actions related to solving the problem, which can be used to transform one state into another state. G represents the set of all possible goal states related to solving the problem. e model of Markov decision process is shown in Figure 1, which is generally represented by the five-tuple 〈S, A, T, R, c〉, where S represents a finite set of all possible states of an agent or environment. Each state in the set represents a possible state, and each state must contain all relevant signs for making correct decisions; A represents a limited set of all possible actions of an agent; T represents the state transition function T(s, a, s ′ ), which is used to express the probability of performing the action a in the state S to reach the state s ′ . e Markov property is reflected in the state transition function. e future state of the decision is only related to the current state of the decision and the currently selected action. e above content can be formally expressed as R represents the reward function, and R(s, a) represents the immediate reward value that the agent can obtain by performing action a in state S. e reward function can be related to the subsequent state, that is, R(s, a, s ′ ). Under this definition, all s ′ of R(s, a, s ′ ) can be expected to be converted into R(s, a). c is the discount factor, and its value range can be expressed as c ∈ [0, 1]. e reason for setting the discount factor is to make the long-term return of the infinite number of steps converge, which makes the Markov decision process model have strong practical significance. When human beings make decisions, most of them pay more attention to the value of returns in a short period of time, thus downplaying the final long-term returns. When the c value is close to 1, it means that the agent values long-term returns. When c is close to 0, it means that the agent pays more attention to the immediate report. e Markov decision process model can control the impact of current decisions on the future by setting the size of c.
e classic planning problem can be described as a triple form D � < I, A, G > . Among them, I represents the initial state set, A represents the action set, and G represents the target state set. In this type of problem, the initial state, characteristic action, and target state are all required to be clearly stated. e action that can change the current state of the system is an action, and the action sequence represents the process evolution of the system state, as shown in

Markov Decision Process to Solve the Optimization Problem of Action Knowledge Extraction
Reinforcement learning learns decision-making strategies through autonomous interaction with the environment, so that the long-term cumulative reward value received by the 4 Complexity strategy is the largest. e difference between reinforcement learning and other machine learning methods is that it needs to learn strategies through interaction with the environment. Secondly, after an action is performed in the environment, if there is no mark on the quality of the action, and only after a period of interaction, the accumulated reward can be known, so as to infer the quality of the previous action. is is a forward-looking process. e idea of Markov decisionmaking process is used, and the expected target state can be obtained by determining the change of state attributes through the reward function. Finally, the action knowledge is extracted, and the action knowledge can be transformed into intuitive recommendations for users. e most basic model of Markov decision process is a five-tuple M DP � S, A, T, R, c ; among them, S represents a finite set of states, that is, the state space, and the state is represented by s; A represents the action space of a limited action set, and the action is represented by a; T: S × A × S ⟶ [0, 1], as the state transition probability matrix, represents the probability distribution of transitioning to another state after performing an action in a certain state; R represents the reward function: e above formula represents the immediate reward made by the environment when the state transition occurs; c represents the discount factor, and c ∈ [0, 1]. e size of c indicates the degree of inclination to the present and future rewards.
e introduction of c is the uncertainty of the future, which can avoid the infinite return of the Markov process. When c is close to 0, it is more inclined to the immediate reward value of the current time step. When c is close to 1, it is more inclined to the long-term reward value in the future. e reward function R is the reward signal obtained during the interaction with the environment. e reward function reflects the nature of the current task and also serves as the basis for strategy modification. e reward function R is to evaluate the quality of the generated action: We assume that G t represents the return value of all discount rewards from time step t: Here, the discount factor is used to control the return value G t to be limited, and c k R is the reward value R obtained through the influence of the k + 1 time step discount.
For each state S in the state set S, the strategy π needs to complete an action a in the action set A; that is, it specifies the set of actions to be taken in each possible state. Strategy π is the mapping from state to action, that is, π: S ⟶ A.
In the Markov decision process, our goal is to find an optimal strategy π * with the largest cumulative reward R π : Among them, π * is the optimal strategy, r t is the immediate reward for actions performed at time step t, and R π is the cumulative reward for actions performed at time step t under strategy π. At the same time, c t is the discount factor c ∈ [0, 1] to the power of t, and E π [·] is the expectation under strategy π.
For any strategy, the expected return of long-term accumulated rewards obtained by executing the strategy is used to evaluate the pros and cons of the strategy. e reward function R is an instant evaluation of a certain state (or action), but the value function considers the quality of a certain state (or state-action pair) from a long-term perspective, so the value function is usually called evaluation function. Complexity 5 e expectation of accumulative rewards obtained by executing action a t and subsequent strategy π in state s t is denoted as V(s t ); that is, Among them, r t is the immediate reward of the action performed at time t, and the discount factor c(c ∈ [0, 1]) balances the current immediate reward value with the future reward value and ensures the convergence of V(s).
For any strategy π, the value function is defined to accumulate the expected value of the discount reward value; that is, Among them, s t represents the state of time step t, and t � 0 represents that s 0 corresponds to the initial state. e purpose of the reinforcement learning algorithm is to find a strategy π, which is the ultimate goal of reinforcement learning, so that the value V π (s) of each state S reaches the maximum at the same time, namely, Among them, r t is the immediate reward at time step t, and c(c ∈ [0, 1]) is the discount factor. V * (s) is called the optimal value function, and the corresponding optimal strategy is π * � arg max π V π (s).
According to Bellman's optimal equation, there are Among them, V * (s ′ ) is the optimal state value function in the next state s ′ .
Algorithm performs strategy iteration: the algorithm first randomly initializes a strategy π t and calculates the state value function v t under this strategy. According to these state value functions, a new strategy π t+1 is obtained, and the value function v t+1 of each state under the new strategy is calculated until convergence. Calculating the value of each state under a strategy is called strategy evaluation. A new strategy based on the state value is called strategy improvement.
Algorithm performs strategy evaluation: according to Bellman's equation, the value function of a state is related to the value function of its subsequent states. erefore, we use the subsequent state value function v(s ′ ) to update the current state value function v(s). Strategy evaluation traverses all states and updates its state value function according to the following formula: Algorithm performs strategy improvement: the new strategy is obtained according to the state value function, and the new strategy is better than the old strategy. For a state S, the strategy chooses an action a that maximizes the current state value function R(s, a) + c s′ T (s,a,s′) V π (s ′ ). at is, e termination conditions of the strategy iteration are  π(s, a), state s t , action a t , reward r t immediately, and transition probability T (s,a,s′) is initialized.

Repeat
In the current state s t , action a t is selected according to the greedy strategy.
Action a t is executed, and the next round of state s t+1 and immediate reward r t are obtained. 6 Complexity e algorithm first performs a strategy evaluation: en, the algorithm performs strategy selection: Until the termination condition is met, the algorithm exits: If state S is the target state,

Tennis Video Image Processing Based on Image Processing
e research objects and data analysis in this article are all from professional tennis players' matches and training, which are stored in the form of video images. Due to the complicated background of tennis competition and training, it is difficult to identify the characteristics of tennis. is article combines image processing technology to design an automatic processing system for tennis video images. e core of the system is the TS201 processor. is processor has good image signal processing capabilities and is a widely used image processor. e composition of the whole system includes image processor TS201, detector, storage device, RS422 serial port device, and so on. Figure 3 shows the architecture of the image automatic processing system. e workflow of the tennis video image automatic processing system is as follows: the high-resolution camera collects the image signal; after the image is filtered, it is sent to the image processor TS201 through the RS422 serial port and the signal transmission link; the feature recognition of the signal is completed in the image processor, the feature type is determined, and the image processing result is sent to the memory.
Image processing technology is the core of the tennis video image automatic processing system. e efficiency of image processing determines the efficiency of automatic monitoring. is article focuses on the key aspects of image processing, such as image segmentation, noise filtering, and edge detection.
(1) In the process of image automation processing in this article, the first thing to do is image segmentation. Image segmentation refers to segmenting the more obvious parts of the image according to certain pixel values and image grayscale and other reference factors, and at the same time removing blurry images. e threshold method is usually used to segment the image, and the specific operation steps are divided into the following three steps. e first step is to traverse the pixel values in the image and find the point M 0 (x 0 , y 0 ) with the largest pixel value. e second step is to combine the actual quality of the image, artificially set the size of the image with 4 * 3 pixels, and compare the maximum pixel point M 0 (x 0 , y 0 ) up, down, left, and right. Pixel compares the size of the found pixel value with the current maximum pixel value and finds the point M 1 (x 1 , y 1 ) with the smallest pixel value. e third step is to obtain the difference between the maximum pixel value and the minimum pixel value in the image. e formula is as follows: (2) Noise Filtering. e interference signals in the image cannot be completely avoided, so these noise signals must be filtered in a targeted manner. e image signal is f(x, y) � g(x, y) + α(x, y). (28) In the formula, g(x, y) is the characteristic image; α(x, y) is the noise signal in the image. Commonly used noise filtering methods include Kalman filtering, median filtering, and so on. e gray value of the noise signal in the image is Complexity 7 obviously different from the gray value of the image. erefore, this paper adopts the median filtering method to filter the signals with abnormal gray value in the image to obtain higher quality images.
(3) Edge Detection. In the process of image processing, edge detection plays a very important role in the recognition of image feature types. Edge detection is also a key step to achieve target recognition. Because the edge image of the target object is obviously different from the background, the feature recognition of the target can be effectively performed by using edge detection technology. e edge detection operators used in this article are Sobel operator and Robert operator during image processing. e function of the image operator is to perform accurate filtering of the edge image, which helps to improve the recognition efficiency of feature types.

Competition Technical Analysis
is paper first obtains the special objects of tennis match technical analysis through data mining technology and obtains the most representative research objects. After that, this paper specifically analyzes the tennis technology of the research object and names the five research objects A, B, C, D, and E obtained by data mining in this paper. e basic conditions are shown in Table 1.
In this paper, two professional digital cameras are used to shoot the subject with fixed-point and fixed-focus shooting. Moreover, this paper takes five outstanding professional graduate students with six years or more of tennis experience as the research objects, arranges them to do overhand serve techniques and shoot them on the spot. e shooting frequency is 240 Hz, the shutter speed is 1/2000 s, the range of the three-dimensional calibration frame is 2.5 m in diameter, and the angle between the two cameras and the test object is 90°, as shown in Figure 4.
In terms of handle, the five subjects usually play continental style. However, each tester's handle style changed during the serve. A and B use the anti-Eastern style, while C, D, and E use a handle between the continental style and the anti-Eastern style (see Figure 5 for the specific handle). It can be seen that the five subjects all changed their handling styles when switching from playing to serve, and the "V" in the mouth of the clapping hand changed from the front type to the back type, but each subject had a different degree of conversion.
Because the five test subjects in this study are all righthanded rackets, in order to facilitate the description of the left and right sides of the batter's body in the paper, the "right side" in the text refers to the bat's "holding side" and the "left side" is the bat's "nonholding side." rowing the ball vertically helps the hitter avoid too much wrong prediction of the spatial position of the ball, thus greatly improving the accuracy of the shot. When throwing the ball, the athlete should ensure that all joints of the upper arm are fully extended, and the relative positions of the upper arm, shoulder, elbow, and body are directly determined. Moreover, the athlete should throw the ball to the upper right front of the body to provide protection for the accurate hitting of the ball when preparing to hit the ball with the right arm swing. In addition, the forward deviation of the position of the ball relative to the body is to conform to the inertia of the person swinging forward. erefore, the slight forward shift when throwing the ball is to effectively ensure that the ball can be hit directly above the body when swinging. Table 2 and Figures 6 and 7 show the results of the research the position of throwing shots for the flat strike and the top spin.
From the overall comparison, each subject's throws are different. However, a comparative analysis of each subject's two throwing actions when serving the ball showed that the deviation of the throwing in the two horizontal axes (X-axis and Y-axis) in the positive direction of the top spin is larger than that of the throwing of the flat strike. In other words, it is more appropriate to throw the ball toward the back left of the batter when a top spin is used.
In the throwing and racket phases, the flexion of the ankle joints, knee and hip joints, and the decrease of the body's center of gravity are sufficient preparations for the explosive force and rapid rebound required for the next vigorous swing. When knees and hips are bent downward, the leg muscles are stretched to a certain extent, which induces stretch and launch, which is conducive to the formation of explosive force. However, the initial length of the musculature varies from person to person, so the optimal angles of the knees and hips that are most conducive to explosive exertion when bending and squatting to lower the center of gravity are also different for different people. Moreover, the results obtained differ among different test subjects. e biggest difference is the smallest joint angle (Table 3 and Figures 8 and 9).
In the racket stage, the movement characteristics of the left and right shoulder joints are mainly reflected in the changes in their spatial positions. In the course of the two kinds of serve techniques, the vertical height difference between the left and right shoulders behaves differently. Among them, the change in the height of the shoulder joint on the nonholding side is that the height of the top spin is higher than that of the flat strike, and the average difference 8 Complexity is three centimeters. However, the change in the vertical height of the shoulder joint on the holding side shows that the height of the top spin is lower than that of the flat strike, and the difference is five centimeters on average. Due to the characteristics of the above two serving techniques, the difference in height between the shoulders is more prominent, and the average difference is about eight centimeters. Similarly, in terms of the level of space between the left and right shoulders, when using top spin, it is also greater than when using flat strike. e difference in the vertical height of the left and right shoulders between the two types of serve is caused by the increase in the degree of squatting of the knee and hip joints on the right side (on the racket side) of the top spin. In this process, the knee and hip joints also have similar characteristics to the shoulder joints. e difference between the knee and hip joints in the two technical actions is reflected in the increase in the top spin. Table 4 and Figure 10 show the comparison of spatial characteristics at the lowest point of the shoulder joint in the racket stage.
From the motion characteristics of the knee, shoulder, and hip joints, we can conclude that the right knee, hip, and shoulder joints have lower flexion compared to the left knee, hip, and shoulder joints when top spin is used. Moreover, the angles of the right knee and hip joints of the top spin are smaller than the angles of the knee and shoulder joints on the side holding the racket of the flat strike. From this, it can be concluded that in racket action, when the top spin is used, the main joints on the right side are more fully prepared for the explosive power of swing than when the flat strike is used.
From Table 5 and Figure 11, it is found that although the vertical height of the wrist is not very different, the racket and the ground are almost vertical at the moment of hitting when the flat strike is adopted, and the racket is basically tilted flat at the moment of hitting when the top spin is adopted. erefore, the height of the hitting point is different between the former and the latter. e height comparison (unit: m) of the hitting point of the flat strike and the top spin is shown in Table 6 and Figure 12. Anti-eastern way Figure 5: Tennis racket handle.

Complexity 9
As shown in Table 6 and Figure 12, in tennis, the hitting point refers to the specific spatial position of the ball when it is swung and hitting the ball. In fact, it refers to the relative position of the hitter's body. When the player hits the ball, the spatial position of each part of the hitter also changes, but only the position of the head is relatively fixed. erefore, it is more practical to regard the position of the head as a relative reference marking point describing the spatial position of the hitting point. e three-dimensional distance (unit: m) between the hitting point and the head space position of flat strike is shown in Table 7 and Figure 13. e three-dimensional distance (unit: m) between the hitting point and the head space position of the top spin is shown in Table 8 and Figure 14.
Comparing the two types of serve actions, it can be found that in the top spin, a certain degree of deviation of the ball's spatial position is beneficial to the topspin effect of the ball. However, if the degree of deviation is insufficient, the topspin effect is not obvious. Due to the limitations of various related equipment and other conditions, there is no way to measure the rotation rate of the ball after being hit in the video. However, we can analyze and judge the specific rotation of the ball by using the subspeed of the racket head in other directions at the moment of batting. rough the research and analysis of the video data of the five experimental testers, it can be concluded that the five experimental testers' hitting points when using top spin are all deviated to a certain degree to the left and rear than when using flat strike. Compared with the head space position, the more the hitting point deviates to the left, the higher the speed of the top of the racket at the moment of hitting, and the greater the top spin rate of the ball. Conversely, if the hitting point is shifted to the left insufficiently, the top spin rate of the racket will be relatively reduced at the moment of impact, the top spin rate of the ball will decrease, the lateral spin rate will increase, and the lateral spin rate of the ball will increase. In addition, at the moment before hitting the ball, reasonable elbow bending and wrist swing techniques can have a certain effect on the final speed of the racket head. Moreover, the shaking of the wrist makes a significant difference in the speed of the grip point and the speed of the wrist joint. Because the grip point is close to the wrist joint point, the obvious speed difference must come from the final shaking of the wrist joint. However, the flexion of the elbow and the shaking of the wrist should not be too large. Excessive flexion of the elbow and wrist joints will cause changes in the flight path of the ball and ultimately reduce the quality of the serve. Moreover, it is especially important that a large swipe of the wrist can easily cause the ball to fall into the net.   In tennis, there are differences in the postures of flat strike and top spin. e specific difference is the angle formed between the flat strike and the top spin. e flat strike is almost perpendicular to the ground at the moment of hitting, while the angle between the top spin and the ground at the moment of hitting is relatively small. By comparing the angles formed between the two serving methods and the ground in Table 9 and Figure 15, it can be         concluded that there is no significant difference in the vertical height of the wrist joints when the two serving methods hit the ball. erefore, the angle formed between the moment of hitting and the ground plays a decisive role in determining the vertical height of the hitting point.
Using machine learning to analyze the characteristics of the tennis movement process can effectively improve the effect of feature extraction and discover the problems of athletes in competition and training. Data feature extraction is an effective way to reflect the actual situation through experiments, and it is also an inevitable development of sports direction.

Conclusion
One of the main focuses of machine learning research is to improve the generalization accuracy and efficiency of model prediction, but in many applications, it lacks the ability to transform prediction results into action knowledge. is paper first introduces the research background and the current research status at home and abroad and gives a concise overview of data mining and knowledge extraction and explains the importance of the study of action knowledge extraction methods from data mining. is paper proposes an action knowledge extraction method that extracts high prediction accuracy and high efficiency decisionmaking action from data and applies this method to the technical analysis of tennis.
With the tremendous advances in data science, the ultimate goal of extracting patterns from data is to facilitate       decision-making. It is foreseeable that machine learning models will become part of making rational decisions in large-scale AI systems. ese modes will be crucial to the support of the action.
is research uses SIMI Motion human motion video processing software to display the changing form of each action during the serve in a digital way. Moreover, this research processes the acquired data, analyzes and summarizes the reasonable data obtained by logic and reasoning, and analyzes the data in combination with the model constructed in this paper. e research results show that the performance of the model constructed in this paper is good.
is article uses experimental research methods to extract and analyze the action characteristics of tennis. e model built in this article is only limited to the experimental stage, and the follow-up needs to be studied from the perspective of actual competition and training, and the amount of data in this article is relatively small. In future research, it is needed to use a lot of data for analysis.

Data Availability
e raw/processed data required to reproduce these findings cannot be shared at this time as the data also form part of an ongoing study.

Conflicts of Interest
e authors declare that they have no conflicts of interest.