Skip to main content

Application of data mining technology and wireless network sensing technology in sports training index analysis


The conventional analysis method can provide a general analysis of sports training index, but its ability is relatively low when analyzing niche data. To solve this problem, this paper proposes data mining technology. First, the indicator parameter classification is determined, then the data mining technology is imported, the sports training analysis mechanism is established through this technology, and the construction of the index analysis model is completed. The model is used to analyze the process of niche data mining, and effective data of training indicators are obtained. Deep learning is a method of machine learning based on the representation of data. Through the coverage test, accuracy test, and immunity test, the variable parameters of the comprehensive analysis capability are determined. Further calculation of this parameter shows that the comprehensive ability of the data mining application analysis method is improved by 37.14% compared with the conventional method, which is suitable for the analysis of niche sports training indicators of different data types.

1 Introduction

The conventional index analysis method adopts a statistical method to make a general analysis of sports training indicators. When analyzing niche data, due to the small amount of statistical data, conventional methods have the disadvantage of low comprehensive analysis capabilities [1, 2]. Therefore, the application of data mining technology in the analysis of sports training index is proposed in this paper. According to the characteristics of the data set, the classification of index parameters was determined, then the sports training analysis mechanism was established by importing data mining technology, and the analysis model was constructed. By analyzing the three processes of data preparation, data mining, and result interpretation, the data mining results of training indicators are obtained and data analysis is completed. Finally, the data mining technology is applied in the analysis of sports training indicators. In the simulation test environment, two different methods were used for coverage test, accuracy test, and immunity test to obtain variable parameters for comprehensive analysis. Through the calculation and comparison of this parameter, it can be seen that the analysis method proposed in this paper has a very high effectiveness.

The specific contributions of this paper include the following: (1) this paper reviews the existing algorithms and analyzes their advantages and disadvantages; (2) this paper proposes a data mining technology combined with a deep learning algorithm and constructs a model for it; (3) a case study of applying data mining technology to sports training index is presented; and (4) the performance of the proposed algorithm is analyzed and compared with other existing algorithms.

The rest of this paper is organized as follows. Section 2 discusses the related work. Secondly, the Section 3 discusses the construction process of the data mining model. Section 4 discusses the application of data mining technology to sports training indexes. Section 5 presents the simulation results and summarizes the future research directions.

2 Construction of the analysis model for sports training indicators

2.1 Import of data mining technology

Determining the index parameters is based on the characteristics of the data set to find the concept description of the category which represents the overall information of such data, that is, the intension description of the category. The purpose of the classification is to analyze the input data. Through the characteristics represented by the data, the accurate description is found for each type of data; such description is often expressed as a predicate, and it is used to classify the subsequent data. Although the class labels for these data are unknown, their categories can still be predicted [3].

The classification can be described as follows: Given a set T of training data, where the element record is described by several attributes, there is only one attribute as a class attribute in all the attributes. This set is represented by a vector X = (X1, X2,…, Xn), where Xi (1 ≤ in) represents a non-category attribute and may have different ranges. When the value range of the attribute is continuous, the attribute is called a continuous attribute; otherwise, it is called the discrete attribute. C = {Cl,C2,…,Ck} represents the data set with k different categories of attributes. Then, the T determines a mapping function from vector X to C, that is, . The purpose of the classification is to use data mining techniques to express the implicit function H. The expression of the function H is as follows [4]:

$$ H={pH}_0+\log \left({a}^n+ ef\right) $$

In which H represents the implicit function, H0 represents the initial state of the function, p represents the defining attribute of the function, a represents the range of the element record, n represents the range of the condition, e represents the range of the sports index, and f represents the discrete index of the sports index. Index parameter classification is generally divided into two steps: The first step is to import data mining technology through known data sets. The second step is to use the obtained model for the classification operation.

First, the accuracy of model classification is estimated. If the accuracy of the model is acceptable, the model can be used for classification. The first step, as shown in Fig. 1, is to use the traiH : f(X) → Cning data set for learning. Training sets are analyzed by classification algorithms to generate classification rules.

Fig. 1
figure 1

Learn using training set

Second, the test data is used to evaluate the model as shown in Fig. 2. If the accuracy rate is acceptable, the classification rules will be used to classify the new data.

Fig. 2
figure 2

Evaluate the model with test data

Data mining methods are developed from artificial intelligence and machine learning methods, which combine statistical analysis methods, fuzzy mathematical methods, and scientific computing visualization techniques. Data mining technology can be divided into the following six categories.

Inductive learning is currently the focus of research, and it is mainly divided into two categories: information theory and set theory. The information theory approach uses information theory to establish a decision tree. In the field of sports training analysis, the decision tree is a simple index representation method. It gradually classifies cases into different categories. This kind of method has good practical effect and great influence. Since the method finally obtains a decision tree, it is generally called a decision tree method. The more distinctive methods in information theory methods are ID3 and IBLE methods [5]. In recent years, due to the development of the rough set theory, the set theory method has been rapidly developed. This includes the coverage of positive exclusion exceptions (AQ method), the concept tree method, and the rough set method. Their three relationships are shown in Eq. 2 [6].

$$ A=\delta \sum \limits_{i=1}^j{\left[\psi \lambda \right]}^2 $$

Typical biomimetic technology methods are neural network methods and genetic algorithms. These two methods have formed an independent research system, and they have also played a huge role in data mining. The neural network method is based on the IP model and the Hebb Learning Rule, and the three types of neural network models are established. The neural network sports training index is a distributed matrix structure. Neural network learning is reflected in the gradual calculation of neural network weights. Using neural network techniques is particularly effective when it is difficult to obtain concepts from complex or inaccurate data. The trained neural network is like an “expert” with some kind of specialized sports training indicators, so it can learn from experience like people [7].

Genetic algorithm is the algorithm that simulates the process of biological evolution. It consists of three basic processes of breeding, crossing, and mutating. The algorithm has played a significant role in optimizing calculations and classifying machine learning.

From this, it can be seen that certain mathematic operations on several data variables can get the corresponding mathematical formulas. The statistical analysis method uses statistical principles to analyze the data. It includes common statistics, correlation analysis, regression analysis, variance analysis, cluster analysis, and discriminant analysis [8].

The generation of fuzzy mathematics is due to the objective existence of ambiguity. And the higher the complexity of the system is, the stronger its ambiguity is. This is the principle of mutual grammar summarized by Zadeh. The fuzzy set theory can be used to make fuzzy judgments, fuzzy decisions, fuzzy pattern recognition, fuzzy association rules, and fuzzy cluster analysis on practical problems. The expression of the fuzzy mathematics method is shown in formula 3.

$$ Pi(m)=\frac{P\left({Z}_1+{Z}_2\right)}{x_1{x}_2}+\lambda $$

In which Pi(m) denotes fuzzy mathematics, and P is the representation of the complexity of the system. Z1 represents the fuzzy judgment, Z2 is the fuzzy decision, x1 represents the fuzzy pattern recognition, x2 represents the fuzzy cluster, and λ represents the fuzzy association rule.

The visual data analysis technology broadened the traditional charting function and enabled users to analyze the data more clearly, for example, turning multi-dimensional data into a variety of graphics, which play a very strong role in revealing the inherent nature and regularity of the data. The purpose is to enable users to browse data and mining process alternately and improve the effect of mining. This technology plays an important role in all stages of data mining. In the preparation phase, the source data is displayed through scatter plots and histograms, which will lay the foundation for better data selection. In the mining phase, various mining processes are described in the visual form, and the user can see from which database the data is extracted, how to extract, how to preprocess, and how to mine. In the presentation phase, the technique makes the training indicators easier to understand.

2.2 Establishment of training analysis mechanism

Data mining classification techniques include decision trees, Bayesian, neural networks, and rough sets [9]. This paper mainly studies the decision tree classification method based on the following considerations.

First, the decision tree method can generate easily understandable rules. Because the end users are teaching managers, they often do not have the data mining sports training indicators, so the interpretability of the mining method is very important. The decision tree represents the final classification result in a tree structure, and it can also generate If-Then rules. The theoretical expression can be written as follows:

$$ {E}_0=\sum \limits_{i=1}^n\left({a}_i-\overline{a}\right)\left({f}_i-\overline{f}\right)\cdot 1/\left[\sum \limits_{i=1}^n\left({e}_i-\overline{e}\right)\right] $$

In which E0 represents the theoretical expression function, n is the calculated length, a means the element record range, f is the discrete index, and e represents the index range.

Second, the calculation of the method is not very large. This system is mainly a practical application, not algorithm research, so the work efficiency is more important. This method can greatly shorten the time of calculation and improve the system’s execution efficiency. The efficiency of execution can be written as the following formula [10]:

$$ E=p\sum \limits_{i=1}^n\left({a}_i-\overline{a}\right)\left({f}_i-\overline{f}\right)\cdot 1/\left[\sum \limits_{i=1}^n\left({e}_i-\overline{e}\right)\right]+\log \left({a}^n+ ef\right) $$

In which E is the execution efficiency, and p means the defined attributes of function. In addition, the decision tree method can handle continuous and discrete data. The database contains more types of data, not only qualitative attributes but also quantitative attributes. Among them, qualitative attributes account for the majority. The method works better with discrete data.

Finally, the decision tree can clearly show the importance of attributes. It chooses the splitting attribute by the calculation of the information entropy, and which is the metric of the importance of the attribute. From an intuitive point of view, the higher the level of the node is, the more important the attributes represented by the node are. From an intuitive point of view, the higher the level of the decision tree node is, the more important the attributes represented by that node are. Then, the role of the nodes of the same level is basically the same.

In summary, this paper chooses the decision tree method for the analysis of sports training index. Its process function can express formula 6 [11].

$$ \frac{\partial T}{\partial t}\left({x}_j,{t}_n\right)=\frac{T\left({x}_j,{t}_{n+1}\right)-T\left({x}_j,{t}_n\right)}{\tau }+O\left(\tau \right) $$

In which T represents the set of training data, also known as the training set or training database, t is the decision tree fancier, xj represents the j-layer data, O represents the split-choice attribute, τ represents the calculation width, and n is the range of conditions.

The decision tree is the process of classifying data through a series of rules, which is the induction learning algorithm. It infers the classification rules of the decision tree representation from a set of irregular elements. It adopts the top-down recursive method to compare attribute values at internal nodes and branch downwards according to different attribute values. The leaf node is the class to be divided. The path from the root node to the leaf node corresponds to a classification rule, and the entire tree represents a set of rules.

In Fig. 3, it is seen that the decision tree is a tree structure similar to a flow chart, which consists of decision nodes, branches, and leaves. Each node corresponds to a non-category attribute, each branch corresponds to each possible value of the attribute, and each leaf node of the tree represents a category. The middle node of the tree is usually represented by a rectangle, while the leaf node is represented by an ellipse. At present, a variety of decision tree algorithms have been formed, such as CLS, ID3, CHAID, CART, FACT, C4.5, GINI, SEES, SLIQ, and SPRINT [12]. The most famous algorithm is the ID3 algorithm proposed by Quinlan.

Fig. 3
figure 3

Decision tree

Figure 4 describes the generation process of the decision tree, which is divided into learning and testing. The learning phase adopts a top-down recursive approach [13]. The algorithm is divided into two steps: one is the generation of the tree, and the other is the pruning of the tree, which is to remove some data that may be noise or abnormal.

Fig. 4
figure 4

The decision tree generation

The formula for removing noise and abnormal data volume is as follows:

$$ {L}_n(x)=\sum \limits_{j=0}^n{y}_j\left(\coprod \limits_{\begin{array}{l}i=0\\ {}i\ne j\end{array}}^n\frac{x-{x}_i}{x_j-{x}_i}\right) $$

In which Ln(x) represents the amount of noise removed, x represents a series, xi is the ith layer of the conclusion, xj represents the jth layer of the conclusion, C represents the decision tree, and n means the scope of the condition.

The condition that the decision tree stops splitting is that the data on one node belongs to the same category and no attribute can be reused for segmentation. Building the decision tree can be done by scanning the database several times. This means that fewer resources are required and that it is easy to handle situations where there are many predictors. Therefore, the model of the decision tree can be built very quickly and is suitable for applying to a large amount of data. Through the determination of index parameter classification, the data mining technology is imported and the analysis mechanism is established. Finally the model is built.

3 Methods

3.1 The analysis of data mining process

Data mining is a multi-stage process, which mainly includes data preparation, data mining, and result interpretation. The data mining process of sports training index is the iterative process of these three phases, as shown in Fig. 5 [14].

Fig. 5
figure 5

Data mining process model

Data preparation accounts for the largest proportion of the entire mining process, usually around 60%. This stage is divided into three steps: data selection, data processing, and data transformation. Data selection mainly refers to the extraction of data from the database and the formation of target data. Preprocessing is to process the extracted data so that it meets the requirements. The main purpose of the transformation is to reduce the data dimension. According to formula 4 and formula 5, the expression of the initial feature function is as follows [15]:

$$ {m}_i{I}_i{N}_i=\frac{{}_i^{i+1}{v}_i{\theta}_i^2}{\left(E-{E}_1-{E}_2\right){l}_i} $$

In which m represents the data feature variables, I is the data variability, N is the target data, v means calculation magnitude, θ is the spelling records, l means mining scope, E is the data mining, E1 represents the mining of initial conditions, E2 represents the mining of working state, and i represents the data of the ith level.

Data mining is firstly algorithmic planning, such as the discovery of data summary, classification, clustering and association rules, or discovery of sequence patterns. Then, the algorithm is selected for this mining method. The choice of the algorithm directly affects the quality of the mining model. After completing the above preparations, the algorithms of data mining can be run. This stage is the phase that data mining analysts and experts are most concerned about. It can also be called data mining in the real sense and expressed by the following function:

$$ D=\mid M(q)\mid =\left[\begin{array}{c}0\\ {}{m}_xf\\ {}0\\ {}{I}_i\end{array}\right]+\mid G(q)\mid =\left[\begin{array}{c}{E}_S\\ {}0\\ {}{E}_R\\ {}{I}_i\end{array}\right] $$

In which D represents the data mining process, M(q) represents the sum of condition vectors of Eq. 5 and Eq. 6, G(q) represents the sum of state mining state vectors, mx represents the difficulty of index analysis, and f represents the frequency of mining.

Ii represents the amount of data mining in the i period, and Es represents the mining status. ER represents the mining conditions, where qRn, |M(q)|d, and Es is a constant, M(q) is an inverse matrix, and \( {m}_x{I}_i{N}_i-\cos {v}_i{\theta}_i^2f/{l}_i\left(E-{E}_1-{E}_2\right)=0 \)|xRn. G(q)| ≤ da, and the integral of the value is a constant.

Data mining tasks include correlation analysis, cluster analysis, classification, prediction, timing model, and deviation detection. Association analysis means that when the values of two or more data items appear repeatedly and the probability is high, there is an association between them. The association rules of these data items can be established to reflect the correlation between events. If there is an association between multiple attributes, the attribute value of one can be predicted based on the others, for example, 90% of customers who buy bread buy milk, which is an association rule. Putting them together will increase their sales. In large databases, there are many such association rules, which require them to be screened. Generally, use the values of “support” and “confidence” to filter the useless rules, which can be expressed by the following formula [16]:

$$ \delta =\frac{1}{L-l}\sum \limits_{i=1}^j{\frac{SF}{dh}}^2 $$

In which δ represents the useless association rule, L represents the value of the support, l is the value of confidence, S is the data schedulability, F is the value of the data attribute, h represents the correlation coefficient, and d represents a motion index state.

The timing model of data mining refers to searching through the time series for a pattern with a high probability of recurrence. In this model, it is necessary to find out the rule that the ratio always exceeds a certain minimum percentage in a certain minimum time [17]. These rules will be adjusted as the situation changes. One of the most important methods in the model is “similar timing.” Using it, the temporal event database is viewed in chronological order, from which one or more similar temporal events can be found.

$$ \psi =F\mathrm{s}{\int}_{-1}^1\left({P}_L\right)\cdot \frac{Nc}{\varepsilon \xi} $$

In which Ψ is the similar timing events, Nc represents the data mining time, Fs means the constant of the sports index, and ζ represents the data of the sports index.

Data mining clusters data into several categories. The data of the same category are similar to each other. The distances of different categories of data are relatively large and different from each other. Clustering includes statistical analysis methods, machine learning methods, and neural network methods. Statistical analysis is clustering based on distance. This method is the clustering of global comparison. It needs to examine all individuals to determine the division of the class. The distance in clustering of the machine learning is determined according to the concept description, which is called concept clustering. When the clustering objects increase, concept clustering is called concept formation. In neural networks, self-organizing neural network methods are used for clustering. Such as the ART model and Kohonen model, this is the unsupervised learning method [18]. After a given distance threshold, each sample is clustered according to the threshold. The clustering formula is as follows:

$$ \lambda =\frac{Ns\cdot {Ns}_L}{QN}+\psi $$

In which λ represents the clustering of data mining, Q represents the mining coefficient, the N means the total amount of mining, the Ns represents the overall amount of the s-layer, NsL represents the overall amount of the next layer of the s-layer, and Ψ is the similar timing events.

Classification is most widely used in data mining. It is to find the concept description of the category and use this description to construct the model. The description represents the overall information of such data, that is, the content description. Connotation description is divided into feature description and discernment description. Feature description is the description of common features of data, and discriminatory description is the description of the difference between them. The process of classification is to analyze the input data, find an accurate description for each class by calculating the characteristics of the data, and use this description to classify the subsequent data [19].

Deviation detection is to find out the abnormal situation of data. Deviation includes many potential sports training indicators, such as anomalous instances in the classification, deviations in results from predictions, and changes in magnitude. The basic method of deviation detection is to find the difference between the result and the reference, which can be expressed by Eq. 13.

$$ Pi(w)=\frac{C}{F\cdot E}{\left|\sum \limits_{i=1}^j Pi(m)e+\lambda \right|}^2 $$

In which the Pi(w) represents the difference between the observations and the reference, and the Pi(m) is the fuzzy mathematical method.

The forecast is to use historical data to find the law of change, establish a model, and use this model to predict the types and characteristics of the data. Regression analysis is a typical prediction method, which establishes a regression equation with time as a variable. In the prediction process, entering any time value can get the status at this time. The neural network method realizes the learning of nonlinear samples, which can discriminate nonlinear functions. Classification can also be used for prediction, but classification is generally used for discrete values; regression prediction is used for continuous values; neural network method prediction can be used for continuous values as well as discrete values [20, 21].

The expression and interpretation of results are based on the user’s purpose of analyzing the information and distinguishing the most valuable information.

The patterns found in the early stages are evaluated by the user, and the useless patterns are deleted. If the user’s requirements cannot be met, the pattern is returned to the previous stage. In addition, the end users faced by data mining are people. Therefore, the discovered patterns must be visualized. For example, the decision tree is transformed into an “if…then…” rule whose process model is shown in Fig. 6.

Fig. 6
figure 6

The model of the data mining process

3.2 Effective data analysis

If the sample belongs to the same class, this node is a leaf node and is marked with this class. Otherwise, the measure of information gain is used as heuristic information to select the attribute of the sample classification, which is the “test” or “decision” attribute of the node. Assumed that all attributes are classified, that is, take discrete values. The branch is created for each known value of the test attribute, and the sample is divided.

The algorithm uses a similar approach, recursively forming the sample decision tree on each partition. Once the attribute appears on a node, it is not necessary to consider this attribute on the descendants of the node. The entire recursion process stops when one of the following conditions is true:

  1. (1)

    All samples for the given node belong to the same class.

  2. (2)

    There are no remaining attributes that can be used to further divide.

  3. (3)

    There is no sample in the branch. In this case, the leaf is created with the majority of the training sample set. When the decision tree is created, many branches reflect abnormalities in training. The pruning method uses statistical metrics to clip the least reliable branches to improve the ability of the decision tree to correctly classify.

The pre-pruning method prunes by stopping the construction of the tree in advance. Once stopped, the node becomes the leaf. This leaf has the most frequent classes in the subset sample. When constructing a tree, if the information gain is the equal measure, it can be used to assess the superiority of the split. If the partitioning of the sample results in a split below a predefined threshold, the partitioning stops. However, choosing a proper threshold is difficult, higher may result in an oversimplified tree, and lower will make the simplification too little. The method expression can be written as follows:

$$ \delta =\frac{1}{\mu -1}\sum \limits_{i=1}^j{\left[ Pi(m)-t\right]}^2 $$

In which δ means the pre-pruning method, μ represents containing the sample of subsets, Pi(m) represents the fuzzy mathematics method, and t represents the fancier of decision tree.

Post-pruning is the cutting of fully grown branches. By deleting the node’s branches, the nodes are cut off. In the pruning algorithm of the cost complexity, the untrimmed nodes become leaves.

The expected error rate of pruned subtrees on non-leaf nodes is calculated. Then, combing the weighting of the branches, the error rate of each branch is used to calculate the expected error rate of no pruning. If the pruning results in a high error rate, the subtree is preserved. Using test sets to evaluate the accuracy of each tree, the decision tree with the lowest expected error rate is obtained. Post-pruning requires more calculations than pruning, but the resulting tree is more reliable, and its formula can be written as Eq. 15.

$$ As=\frac{\partial^2\left({A}_1+{A}_2\right)}{\partial {V}^2}+{g}_0{F}_0/H $$

In which As represents the marker expression, A1 represents the error rate of each branch, A2 is the weight assessment of the branches, V means the range of element records, g0 represents the index of the index, F0 represents the index range, and H is the concept tree method.

When extracting classification rules from the decision tree, the rules are expressed in the form of “if-then.” The rule is created for each path from the root to the leaves to form the conjunct of the predecessor. Leaf nodes contain class predictions that form the rule post. Based on the analysis of the three processes of data preparation, data mining, and result interpretation, the model based on the analysis of sports training index obtains the data mining results of the index and realizes the analysis of the index. The application of data mining technology in the analysis of sports training index was completed.

4 Experiment

In order to ensure the effectiveness of the technology proposed in this paper, a simulation test analysis is performed. The test uses different types of sports training index as objects for the analysis. In order to ensure the validity of the test, the conventional index analysis method is used as a comparison object. The test data is presented in the same chart, and conclusions are reached through the calculation of comprehensive analysis capabilities.

4.1 Data preparation

The test parameters are set to ensure the accuracy of the test. In this paper, different types of index are used as test objects. Two kinds of analysis methods are used to conduct simulation tests and analyze the results. Because the results obtained by different methods and the analysis methods are different, it is necessary to ensure the consistency of the environment. The data set results in this paper are shown in Table 1.

Table 1 Parameter settings of the simulation test

The two analysis methods are put in this environment, and the simulation data is loaded. The simulation parameters are shown in Table 2.

Table 2 Simulation parameters of index types

4.2 Test design

In order to verify the comprehensive analysis capabilities of the two methods, the experiments of coverage simulation, accuracy simulation, and immunity simulation were carried out in this paper. The results are recorded, and the comprehensive ability of the index analysis is calculated according to the formula.

First, the data is input into the simulation system set in accordance with the requirements of Table 1, and the correlation operation is performed. Then, under the same conditions, three experiments were conducted separately.

Finally, the third-party software of analysis and recording is used to analyze the data generated, while eliminating the uncertainty caused by various factors. For different types of indicators and analysis methods, simulation tests were performed and the results were shown in the test comparison curves. The conclusion is drawn by the formula for calculating the comprehensive analysis ability.

4.3 The test of coverage simulation

The comparison curve of the results of the coverage simulation test is shown in Fig. 7.

Fig. 7
figure 7

The comparison curve of the coverage simulation test

From the comparison curve, it can be seen that the overall results of the method designed in this paper is 87.41%, while the coverage of the traditional method is only 79.42%.

4.4 The test of the accuracy simulation

The comparison curve of the test results is shown in Fig. 8.

Fig. 8
figure 8

The comparison curve of accuracy simulation test

By comparison, the error rate of the method designed in this paper is 89.92%, while that of the traditional analysis method is 74.12%.

4.5 The test of the noise immunity simulation

The comparison curve of the noise immunity simulation test results is shown in Fig. 9.

Fig. 9
figure 9

The comparison curve of noise immunity simulation test

As can be seen in Fig. 9, the anti-interference ability of the design method is 98.41%, while the anti-jamming capability of the traditional analysis method is 69.53%.

4.6 The calculation of comprehensive analysis ability

Substitute the test results of coverage and accuracy into the following formula:

$$ \chi =\frac{1}{n}k\sum \limits_{i=1}^n{\left(\frac{Dg}{y}\right)}^2 $$

In which D represents the coverage test results, g means the results of the accuracy test, y represents the results of the noise immunity test, and k represents the simulation coefficient. This paper takes 0.98.

The proposed method is denoted as χ1, the conventional method is denoted asχ2, Δχ = χ1 − χ2 is the positive number indicates that the comprehensive analysis ability is improved, and the negative number Δχ = χ1 − χ2 represents the decrease in the comprehensive analysis ability. Then, the Δχ = χ1 − χ2 is written as follows:

$$ {\displaystyle \begin{array}{l}\Delta \chi ={\chi}_1-{\chi}_2\\ {}=\frac{1}{n}k\sum \limits_{i=1}^n{\left(\frac{D_1{g}_1}{y_1}\right)}^2-\frac{1}{n}k\sum \limits_{i=1}^n{\left(\frac{D_2{g}_2}{y_2}\right)}^2\\ {}=0.371409\end{array}} $$

Compared with the conventional method, the comprehensive ability of the data mining application is increased by 37.14%, which can be applied to the analysis of sports training index of different data types.

5 Results and discussion

This paper puts forward the application of data mining technology in the analysis of sports training indicators. It relies on the construction of the index analysis model; through the analysis of mining process and data, the analysis of sports training index is completed. The experimental data shows that the method designed in this paper has extremely high effectiveness. It is hoped that the research in this paper can provide a theoretical basis for the analysis methods of sports training indicators.

Availability of data and materials

The data sets used and/or analyzed during the current study are available from the corresponding author on reasonable request.

Ethics approval and consent to participate

This article does not contain any studies with human participants or animals performed by any of the authors.



Sage Extended Enterprise Suite


  1. W. Chong, W. Cong, Simulation of 3D visual action amplitude tracking method in sports. Computer Simulation 1, 245–248 (2017)

    Google Scholar 

  2. Z. Peng, S. Wang, Z. Wuping, Simulation of high accuracy control of volley hit point on volleyball front. Computer Simulation 12, 246–249 (2017)

    Google Scholar 

  3. L. Zhang, X. Yang, C. Sang, Cloud computing and data mining application in enterprise profitability analysis based on the perspective of cash flow. RISTI - Revista Iberica de Sistemas e Tecnologias de Informacao 2016, 161–172 (2016)

    Google Scholar 

  4. X. Ruan, G. Tao, H. Liu, et al., Application of data mining for investigating the cognition of how square dance promote community sports culture construction. Boletin Tecnico/technical Bulletin 55(13), 594–600 (2017)

    Google Scholar 

  5. J.M. Rodríguez-Jiménez, P. Cordero, M. Enciso, et al., Data mining algorithms to compute mixed concepts with negative attributes: an application to breast cancer data analysis. Mathematical Methods in the Applied Sciences 39(16), 4829–4845 (2016)

    Article  MathSciNet  Google Scholar 

  6. H. Hong, P. Tsangaratos, I. Ilia, et al., Application of fuzzy weight of evidence and data mining techniques in construction of flood susceptibility map of Poyang County. China Science of the Total Environment 625, 575–588 (2018)

    Article  Google Scholar 

  7. Z. Huang, J. Tang, G. Shan, J. Ni, Y. Chen, C. Wang, An efficient passenger-hunting recommendation framework with multi-task deep learning. IEEE Internet Things J. (2019).

  8. A. Hamedianfar, H.Z.M. Shafri, Integrated approach using data mining-based decision tree and object-based image analysis for high-resolution urban mapping of WorldView-2 satellite sensor data. J. Appl. Remote. Sens. 10(2), 025001 (2016)

    Article  Google Scholar 

  9. Y. Xue, X. Zhang, S. Li, et al., Analysis of factors influencing tunnel deformation in loess deposits by data mining: a deformation prediction model. Eng. Geol. 232, 94–103 (2018)

    Article  Google Scholar 

  10. I. Boersch, U. Füssel, C. Gresch, et al., Data mining in resistance spot welding: a non-destructive method to predict the welding spot diameter by monitoring process parameters. Int. J. Adv. Manuf. Technol. (2017)

  11. Regulski K, Wilkkołodziejczyk D, Kacprzyk B, et al. Approximation of ausferrite content in the compacted graphite iron with the use of combined techniques of data mining. Archives of Foundry Engineering, 2017, 17(3).

  12. W. Liu, J. Rostami, E. Keller, Application of new void detection algorithm for analysis of feed pressure and rotation pressure of roof bolters. Int. J. Min. Sci. Technol. 27(1), 77–81 (2017)

    Article  Google Scholar 

  13. K. Mathan, P.M. Kumar, P. Panchatcharam, et al., A novel Gini index decision tree data mining method with neural network classifiers for prediction of heart disease. Des. Autom. Embed. Syst. 9, 1–18 (2018)

    Google Scholar 

  14. J. Rojas, J. Forero, P. Gaona, et al., Analysis of physico-chemical variables and their influence on water quality of the Bogota River using data mining. Int. J. High Performance Syst. Architecture (2017) (In Press)

  15. J. Górecki, M. Hofert, M. Holeňa, An approach to structure determination and estimation of hierarchical Archimedean Copulas and its application to Bayesian classification. J. Intell. Inf. Syst. 46(1), 21–59 (2016)

    Article  Google Scholar 

  16. Z.S. Pourtaghi, H.R. Pourghasemi, R. Aretano, et al., Investigation of general indicators influencing on forest fire and its susceptibility modeling using different data mining techniques. Ecol. Indic. 64, 72–84 (2016)

    Article  Google Scholar 

  17. P. Pinto, I. Theodoro, M. Arrais, et al., Data mining and social web semantics: a case study on the use of hashtags and memes in online social networks. IEEE Lat. Am. Trans. 15(12), 2276–2281 (2017)

    Article  Google Scholar 

  18. Q.A. Kester, Using formal concepts analysis techniques in mining data from criminal databases and profiling events based on factors to understand criminal environments. Lect. Notes Comput. Sci 9790, 480–496 (2016)

    Article  MathSciNet  Google Scholar 

  19. D.T. Bui, T.A. Tuan, H. Klempe, et al., Spatial prediction models for shallow landslide hazards: a comparative assessment of the efficacy of support vector machines, artificial neural networks, kernel logistic regression, and logistic model tree. Landslides 13(2), 361–378 (2016)

    Article  Google Scholar 

  20. Y. Han, F. Moutarde, Analysis of large-scale traffic dynamics in an urban transportation network using non-negative tensor factorization. Int. J. Intell. Transp. Syst. Res. 14(1), 36–49 (2016)

    Google Scholar 

  21. Z. Huang, X. Xu, H. Zhu, M.C. Zhou, An efficient group recommendation model with multiattention-based neural networks. IEEE Transactions on Neural Networks and Learning Systems (2020).

Download references



Informed consent

All authors agree to submit this version and claim that no part of this manuscript has been published or submitted elsewhere.



Author information

Authors and Affiliations



Liqiu Qian and Jiatong Liu wrote the entire article. The author(s) read and approved the final manuscript.

Corresponding author

Correspondence to Jiatong Liu.

Ethics declarations

Competing interests

The authors declare that they have no conflict of interest.

Additional information

Publisher’s Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Qian, L., Liu, J. Application of data mining technology and wireless network sensing technology in sports training index analysis. J Wireless Com Network 2020, 121 (2020).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: