# Motivation Analysis of Technological Startups Business Models Based on Intelligent Data Mining and Analysis

Authors: Xuejiao Ren; Xiaozhou Ding
Journal: Journal of Electrical and Computer Engineering
 (2022)

---

## Abstract

To improve the motivation analysis effect of the technological startups business model, this study combines intelligent data mining technology to analyze related factors and proposes a method of adjusting parameters of machine-learning model based on Bayesian optimization algorithm. Moreover, this study integrates the prior information and sample information of the machine learning algorithm performance function and builds an intelligent analysis model based on the elements of the technological startups business model. Finally, this article designs experiments to evaluate the effect of intelligent data mining of the system model in this study. The research shows that the motivation analysis model of the technological startups’ business model based on intelligent data mining analysis proposed in this study meets the basic requirements of the design system of this study.


---

## Body

## 1. Introduction

The essence of innovative enterprises should be to rely on innovation to make profits and thus rely on innovation to survive and develop. Only when an enterprise can rely on innovation to make profits and thus revolve around innovation to survive and develop, it has the willingness to maintain a high innovation investment, can maintain continuous innovation capabilities, will have endless innovation results, and will undergo long-term accumulation [1]. Otherwise, if an enterprise cannot rely on innovation to make profits and cannot rely on innovation for survival and development, then the enterprise will not be able to maintain a high investment in innovation, it will not be possible to maintain continuous innovation capabilities, and it will not be possible to have endless innovation results. Once the support policy is cancelled, these enterprises will lack the motivation to carry out continuous technological innovation and return to the old path of “innovation inaction,” which makes the original innovation pilot policy investment lose its value. Then, the pilot goal of guiding enterprises to take the road of independent innovation and cultivating a large number of exemplary innovative enterprises will fail [2]. Only by analyzing and grasping the more essential characteristics of innovative enterprises can we formulate more scientific standards, provide a scientific reference for cultivating innovative enterprises and building an innovative country, and ensure the smooth implementation of the pilot work of innovative enterprises in the country’s and the national innovation strategy [3].This study combines intelligent data mining technology to analyze the business model motivation of technological startups, which provides a theoretical reference for subsequent related research.


## 2. Related Work

In the early stages of business model development, since no consensus has been reached on the definition of a business model, most studies are revealing specific business model types, among which the research results of e-commerce genres are particularly significant. The e-commerce genre focuses on exploring the “new way of doing business” that appears under network conditions, especially under the conditions of the Internet [4]. Literature [5] reveals the new economic characteristics under network conditions. First, information assets are not lost in use like physical assets, but can be copied on a large scale at a very low cost. Second, companies can provide products or services to customers through information networks, services forming a new economic scale; third, companies can provide products for cross-industry and cross-regional customers, creating new economies of scope; fourth, greatly reducing transmission costs; and fifth, the transformation of supply and demand, rapidly changing from supply-side to demand-side leading. From an economic point of view, literature [6] summarizes the new laws under the network economy, one is the high production cost, low copy cost, or zero-copy cost of information products; the second is network externalities, where the utility of information products or services increases with users. But with the rapid rise, third is the conversion cost, including learning costs, fixed investment, external utility, etc.; fourth is the lock-in effect, and due to the existence of the above factors, users may be locked in products or services with inferior effects. Literature [7] analyzes and summarizes the four major value creation sources of e-commerce. The first is efficiency, i.e., e-commerce can improve efficiency by reducing search costs, increasing the range of choices, enhancing information symmetry, simplicity, speed, and economies of scale; the second is complementarity. E-commerce can create value by enhancing the complementarity of products and services, online and offline, different technologies, and different activities; the third is novelty, where e-commerce can create new transaction structures, new transaction content, new participants, etc. The fourth is create value with the lock-in effect, where e-commerce can create value by locking customers in by increasing conversion costs, positive network effects, etc. On this basis, literature [8] believes the existing entrepreneurial theories, neither strategic theories can explain the value creation of e-commerce well, so it is necessary to introduce the concept of “business model” as the focus of corporate value research under the network economy, and believe that business model reveals that companies trade with them in order to use opportunities to create value design of content, structure, and governance.Literature [9] laid the theoretical foundation for product platform research, expanded the most basic product platform concept, and proposed horizontal, vertical, and comprehensive derived product family derived maps, as well as the basic principles of product platform generation update. Literature [10] further expands the application scope of the platform concept and defines the concept of an industrial platform: an industrial platform is a product, service, or technology that is developed by one or several companies as the basis for other companies to create complementary products, services, and technologies. Literature [11] summarized the basic concepts and types of platforms in detail and applied them to different scenarios such as product platforms, supply chain platforms, industrial platforms, and multilateral market platforms. Platform strategy research: literature [12] believes that the platform strategy model is to attract multilateral groups to the platform to form a platform ecosystem so that multilateral groups can interact and cooperate based on the rules and space of the platform and to exert the overall network effect and achieve a win-win situation for all parties. Literature [13], Researching platform strategy: from the perspective of business ecosystem, the research shows that both buyers and sellers of platform companies will affect each other's income, and the strategies adopted by one side of the platform will also affect the strategic choices of the other side.Literature [14] proposed that business model innovation not only requires a systematic way of thinking but also needs to consider the degree of matching with the external environment. Enterprise business model innovation can be achieved by changing the four elements of customers, technology, infrastructure, and profit models. Literature [15] analyzes the ways and strategies of enterprise business model innovation based on the perspective of external stakeholders of the enterprise and believes that the driving force for enterprises to achieve continuous innovation of business models is the cooperative operation between enterprises. Literature [16] found that, different from the industrial age enterprises, the business model innovation of modern enterprises is based on the entire ecosystem, which is inseparable from the integration of internal resources of the organization, and the construction of the external environmental ecosystem of the enterprise cannot be ignored. Literature [17] analyzes business model innovation from the perspective of a value chain and believes that enterprise business model innovation can be understood as the change and adjustment of the original value chain by the enterprise or the change of the constituent elements of the enterprise value chain.


## 3. Intelligent Data Mining Algorithm

In actual machine learning tasks, the learning capabilities of different algorithm models are also different. If a model can achieve a high prediction accuracy rate, then this model is called a “strong learning algorithm”; conversely, if a model’s prediction accuracy rate is only slightly higher than random guessing, then this model is called a “weak learning algorithm.” Generally speaking, compared with weak learning algorithms, strong learning algorithms have a more complex structure and longer training time. For a complex machine learning task, training a strong learning algorithm is difficult, but training a weak learning algorithm is much simpler.Therefore, it is natural to think that in the task of machine learning, if a “weak learning algorithm” has been obtained, then it can be upgraded to a “strong learning algorithm,” which will reduce the cost of learning while ensuring the learning effect. Researchers have proposed many algorithms for implementing the idea of boosting methods, of which the AdaBoost algorithm is the most representative one.The AdaBoost algorithm was originally a boosting method proposed for the two-classification problem. The idea is to continuously change the weight distribution of the data set when training weak classifiers so that different weak classifiers focus on different parts of the data set and finally combine these weak classifiers to get the final strong classifier.The idea of AdaBoost algorithm needs to study two main issues: the first is how to change the weight distribution of the data set during the training of each weak classifier; the second is how to combine the weak classifiers to generate a strong classifier. In response to the first problem, the AdaBoost algorithm increases the weight of data samples that were judged incorrectly by the previous round of weak classifiers, and at the same time reduces the weight of data samples that are correctly judged and focuses on these judgments in the next round of weak classifier training. Wrong data: intuitively, the AdaBoost algorithm continuously trains the weak classifier to “correct” the previous errors. In theory, the error rate can eventually be minimized; for the second problem, the AdaBoost algorithm uses a weighted linear combination method. Combining weak classifiers into strong classifiers, the algorithm will reduce the weight of weak classifiers with high errors, and at the same time increase the weight of weak classifiers with high accuracy, so that it can play a greater role in the final classification results. One point is very similar to the linear model’s idea of weighting features. The AdaBoost algorithm flow is shown in Algorithm 1.(1)wt+1,i=wtiZte−αt,Gtxi=yi,wtiZteαt,Gtxi≠yi,.Algorithm 1: The AdaBoost algorithm.
(a)
When the algorithm initializes the weights of the data set (first step), it is assumed that the data set initially has a uniform weight distribution, that is, each data sample has the same effect when training the first weak classifier;(b)
When the algorithm calculates the training error of the weak classifier (the fifth step), it can be seen from formula (3) that the training error of the weak class is actually the sum of the weight values of all misclassified samples.(c)
When the algorithm calculates the weight coefficient of the weak classifier (the sixth step). it can be seen from (4) that when εt≤0.5, αm≥0, the coefficient increases with the decrease of the training error. It can be seen that when the training error is greater than 50%, it indicates that the classification ability of the weak classifier is lower than random guessing. Therefore, the algorithm gives the weak classifier a negative weight to indicate that the weak classifier has a negative effect on the final classification result. A weak classifier with a smaller training error will get a greater weight, indicating that the classifier has a greater role in the final classification task.(d)
When the algorithm updates the weight distribution of the training data (step 7), formula (6) shows that the data weight when training the next round of weak classifier is [18]It can be seen that when a data sample is incorrectly classified by a weak classifier, its weight will increase and the weight of a correctly classified data sample will decrease. Therefore, in the next round of training, the role of misclassified data samples in learning will increase, so that the next round of weak classifiers will pay more attention to learning these data samples. The function of the normalization factorZt is to ensure that the sum of the modified weights is always 1.Usually, linear regression algorithms are generally used to solve regression problems, i.e., to estimate continuous value results. If you want to use a linear regression model to solve the classification problem, the most direct method is the threshold method, i.e., to classify the data sample by setting a threshold. For example, for a binary classification problem, when the linear regression model predicts a data sample greater than the inter-classification value, it is classified into 1 class, otherwise it is classified into 0 class. For standard data sets, the threshold method is feasible. However, in actual data mining, the linear regression model is susceptible to the influence of data points whose features take larger values in the data set. Therefore, when the data in the data set increases, the linear regression model is constantly adjusting the parameters to fit the new data and the interval value also needs to be adjusted continuously. Therefore, the linear regression model is not a robust model to solve the classification problem through the intermediate value method, and the threshold also has the disadvantage of insufficient interpretability.Logistic regression model is also called log probability regression, which is a commonly used classification model to deal with binary classification problems. Aiming at the deficiencies of the threshold method, the logistic regression model restricts the predicted value of the linear regression model to a fixed value range and then performs classification by setting the threshold value.The predictive expression of the logistic regression model is [19](2)Y=1,fx≥p,0,fx<p..Among them,x∈Rn is the input feature, Y∈0,1 is the output category, p∈0,1 is the classification threshold, and the expression of the regression function fx is [20](3)fx=gw⋅x+b.Among them,w∈Rn,b∈R is the parameter, g⋅ is the sigmoid function, and the expression is(4)gx=11+e−x.From (4), we can see that the value range of the sigmoid function between the domain −∞,+∞ is 0,1. At x=0, gx=0.5, and as x increases, gx approaches 1. Compared with the threshold method classification, logistic regression has the following advantages:(a)
The model is stable and robust. It can be seen from formula (2)–(10) that logistic regression limits the predicted value of linear regression to an interval. When data points with larger values appear in the data set, the parameters of the model will not be greatly affected.(b)
The model is easy to understand and the prediction results are highly interpretable. Since the value range of the sigmoid function is0,1, which is consistent with the value range of the probability, the value of the regression function fx can be regarded as the probability or confidence that the category Y corresponding to the data sample x is category 1, and the classification threshold can be set to 0.5. That is, when the probability that the category Y corresponding to the data sample x is category 1 is greater than 0.5, then x is classified into category 1, which is also consistent with actual daily experience.In the field of machine learning, the Gaussian process is a kind of random process that exists widely in nature and can be used to represent the distribution of a function. The Gaussian process refers to a set of random variables in which any finite number of random variables in this set obeys the joint Gaussian distribution, so the distribution function of this set of random variables obeys the Gaussian process regression. The Gaussian process assumes that similar inputs will produce similar outputs, and this assumption is used to construct a statistical model of the two functions. The statistical characteristics of the traditional Gaussian distribution are determined by the mean and covariance, the statistical characteristics of the Gaussian process are completely determined by its mean functionm:x⟶R and covariance function k:x×x⟶R. If a function fx obeys the Gaussian process distribution, it is expressed as(5)fx∼GPmx,kx,x′.The Gaussian process is different from the ordinary Gaussian distribution. The probability density functionfx corresponding to any x is no longer a scalar but a normal distribution function. This function reflects the probability distribution of fx. Usually, for the convenience of calculation, it is assumed that the mean value function of the Gaussian process is mx=0. For the covariance function k, the exponential square function is often selected as the covariance function:(6)kxi,xj=exp−12xi−xj2.When the values ofxi and xj are close, the function value is close to 1, otherwise, the function value is close to 0. This function reflects that when two sampling points are close, they have greater mutual influence and strong correlation. However, when the distance is farther, the correlation between them becomes weaker.The process of using Gaussian process to determine the posterior distribution probability of functionfx is as follows:(1)
The algorithm first selectst observations of function f as the training set D1:t=xn,fnn=1t,fn=fxn. We assume that the function f obeys the t -dimensional normal distribution, that is, f∼N0,K, where:(7)K=kx1,x1kx1,x2…kx1,xtkx2,x1kx2,x2…kx2,xt⋮⋮⋱⋮kxt,x1kxt,x2…kxt,xt.Each element in the matrixK is calculated by the covariance function k. The function k measures the degree of approximation between two input values. Obviously, without considering the influence of noise, the diagonal element is kxi,xi=1.(2)
According to the established function model, the algorithm calculates the function valuefn+1=fxn+1 corresponding to the new sampling point xt+1. According to the assumption of the Gaussian process, the new set composed of f1:t and the function value ft+1 in the training set obeys the t+1 -dimensional normal distribution; that is,(8)f1:tft+1∼N0,KkkTkxt+1,xt+1.Among them,(9)f1:t=f1⋮ft,k=kxt+1,x1kxt+1,x2⋯kxt+1,xt,where ft+1 obeys one-dimensional normal distribution, that is, ft+1∼Nμt+1,σt+12. From the joint normal distribution, it can be solved:(10)μt+1xt+1=kTK−1f1:t,σt+12xt+1=−kTK−1k+kxt+1,xt+1.It can be seen from the above formula that what is obtained by the Gaussian process is not a point estimate of the function valueft+1, but a probability distribution of all the values of ft+1. If the number of samples in the training set is large enough, the Gaussian process can obtain an approximate estimate of the function fx distribution. A more intuitive representation of the Gaussian process is shown in Figure 1.Figure 1
One-dimensional Gaussian process.Figure1 shows a one-dimensional Gaussian process with two observations. The black points in the figure represent the observed data points, the black curve represents the mean value of the function value in the Gaussian process domain, and the blue area indicates the value range of the function value within one standard deviation of the mean value. It can be seen from the figure that the variance of function f is smaller when it is close to the observation data point and larger when it is far away from the observation data point.After obtaining the posterior distribution of the function, Bayesian optimization uses the acquisition functionu to derive where the function f obtains the maximum value. We assume that the higher value of the acquisition function corresponds to the larger value of the objective function f. Therefore, maximizing the collection function is equivalent to maximizing the function f:(11)x+=argmaxx∈Aux|D.The following will introduce several common acquisition functions when the prior distribution is Gaussian distribution. Before the introduction, we explain the following symbols and theorems:Φ⋅ - the cumulative distribution function of the standard normal distribution;φ⋅ - the probability density function of the standard normal distribution;x+ represents the position where the function f obtains the optimal value after obtaining t sampling points according to Bayesian optimization, where the expression of x+ is as follows:(12)x+=argmaxxi∈x|xfxi.A continuous random variableX has a density function fx and a probability distribution function Fx. Then, for any constant a〈b, there is:(13)Pa≤X≤b=Fb−Fa=∫abfxdx.We set the random variableX to have a probability density function fx, if(14)∫−∞∞xfxdx∞.Then,(15)EX=∫−∞∞xfxdx,is the mathematical expectation ofX.


### 3.1. Probability of Improvement (PI)

The function optimization strategy is to explore near the current optimal value point to find the point that is most likely to be better than the current optimal value until the number of algorithm iterations reaches the upper limit. The function expression is:(16)PIx=Pfx≥fx+=Φμx−fx+σx.The PI strategy is simple, but its shortcomings are very obvious. Since the function is based on the greedy idea, that is, only considering the use of the current optimal solution, the selection of sampling points is limited to a small range, and it is easy to fall into the local optimal solution.In order to solve the problem that the PI function is easy to fall into the local optimal solution, a parameter is usually added when using the PI function. Only when the difference between the value of the next sampling point and the current optimal value is not less than, the sampling point will be considered to replace the current optimal value point. The expanded PI function expression is(17)PIx=Pfx≥fx++ε=Φμx−fx+−εσx.


### 3.2. Expected Improvement (EI)

The optimization strategy of this function is to calculate the expectation of the improvement degree of the function value when exploring the vicinity of the current optimal value point. If the improvement of the function value after the algorithm is executed once is less than the expected value, it means that the current optimal value point may be a local optimal solution, and the algorithm will search for the optimal value point in other positions in the domain. Compared with the PI function, the EI function is not easy to fall into the local optimal solution.When using the EI function, the improvementI of the function after the optimization algorithm is executed once is defined as the difference between the sampling point value and the current optimal value. If the sampling point value is less than the current optimal value, the function improvement degree is 0; that is,(18)Ix=max0,ft+1x−fx+.According to the EI function optimization strategy, the next sampling point of the function is the expected maximum value of the function improvement, namely,(19)x=argmaxEIx=argmaxEmax0,ft+1x−fx+.Whenft+1x−fx+≥0 is, under the condition of Gaussian process prior, function ft+1x obeys a normal distribution with mean μx and variance σ2x. Therefore, the random variable I obeys a normal distribution with mean μx−fx+ and variance σ2x, that is, the distribution function of I is(20)fI=12πσxexp−μx−fx+−I22σ2x,I≥0.The expectation of the improvement degreeI of the function is(21)EI=∫−∞∞IfIdI=∫I=0I=∞I1/2πσxexp−μx−fx+−I2/2σ2xdI=σxZΦZ+φZ.Among them,(22)Z=μx−fx+σx.Formula (21) expresses the expectation of the improvement degree of the function, that is, the expression of the EI function.


### 3.3. GP Upper Confidence Bound (GP-UCB)

In the process of executing an optimization algorithm, this function judges whether to use the current optimal value point (corresponding to the highμx interval) or explore other low confidence intervals (corresponding to the high σx interval) in the next execution. The function balances these two behaviors by setting an additional parameter κ. The function expression is defined as(23)UCBx=μx+κσx.To determine the acquisition function, it is necessary to observe the regression performance of the three functions in the same Gaussian process. Figure2 shows the optimization process comparison of PI, EI, and GP-UCB for the same function. The blue curve is the mean line of the predicted function value of the Gaussian process, the red dotted line is the actual value curve of the function, the red solid line is the current optimal solution, and the blue area is the value range of the function value within one standard deviation near the mean. It can be seen from Figure 2 that after 5 iterations of the algorithm, both the EI function and the GP-UCB function have found the global optimal value of the function, while the PI function has fallen into the local optimal solution. According to the experimental comparison results, we use the EI function to optimize the subsequent machine learning algorithm parameters because EI has better performance than PI on multiple local optimal solution problems. In addition, compared with GP-UCB, EI does not set other parameters, so it has more advantages than GP-UCB in terms of simplicity.Figure 2
The optimization process of the three collection functions.


## 3.1. Probability of Improvement (PI)

The function optimization strategy is to explore near the current optimal value point to find the point that is most likely to be better than the current optimal value until the number of algorithm iterations reaches the upper limit. The function expression is:(16)PIx=Pfx≥fx+=Φμx−fx+σx.The PI strategy is simple, but its shortcomings are very obvious. Since the function is based on the greedy idea, that is, only considering the use of the current optimal solution, the selection of sampling points is limited to a small range, and it is easy to fall into the local optimal solution.In order to solve the problem that the PI function is easy to fall into the local optimal solution, a parameter is usually added when using the PI function. Only when the difference between the value of the next sampling point and the current optimal value is not less than, the sampling point will be considered to replace the current optimal value point. The expanded PI function expression is(17)PIx=Pfx≥fx++ε=Φμx−fx+−εσx.


## 3.2. Expected Improvement (EI)

The optimization strategy of this function is to calculate the expectation of the improvement degree of the function value when exploring the vicinity of the current optimal value point. If the improvement of the function value after the algorithm is executed once is less than the expected value, it means that the current optimal value point may be a local optimal solution, and the algorithm will search for the optimal value point in other positions in the domain. Compared with the PI function, the EI function is not easy to fall into the local optimal solution.When using the EI function, the improvementI of the function after the optimization algorithm is executed once is defined as the difference between the sampling point value and the current optimal value. If the sampling point value is less than the current optimal value, the function improvement degree is 0; that is,(18)Ix=max0,ft+1x−fx+.According to the EI function optimization strategy, the next sampling point of the function is the expected maximum value of the function improvement, namely,(19)x=argmaxEIx=argmaxEmax0,ft+1x−fx+.Whenft+1x−fx+≥0 is, under the condition of Gaussian process prior, function ft+1x obeys a normal distribution with mean μx and variance σ2x. Therefore, the random variable I obeys a normal distribution with mean μx−fx+ and variance σ2x, that is, the distribution function of I is(20)fI=12πσxexp−μx−fx+−I22σ2x,I≥0.The expectation of the improvement degreeI of the function is(21)EI=∫−∞∞IfIdI=∫I=0I=∞I1/2πσxexp−μx−fx+−I2/2σ2xdI=σxZΦZ+φZ.Among them,(22)Z=μx−fx+σx.Formula (21) expresses the expectation of the improvement degree of the function, that is, the expression of the EI function.


## 3.3. GP Upper Confidence Bound (GP-UCB)

In the process of executing an optimization algorithm, this function judges whether to use the current optimal value point (corresponding to the highμx interval) or explore other low confidence intervals (corresponding to the high σx interval) in the next execution. The function balances these two behaviors by setting an additional parameter κ. The function expression is defined as(23)UCBx=μx+κσx.To determine the acquisition function, it is necessary to observe the regression performance of the three functions in the same Gaussian process. Figure2 shows the optimization process comparison of PI, EI, and GP-UCB for the same function. The blue curve is the mean line of the predicted function value of the Gaussian process, the red dotted line is the actual value curve of the function, the red solid line is the current optimal solution, and the blue area is the value range of the function value within one standard deviation near the mean. It can be seen from Figure 2 that after 5 iterations of the algorithm, both the EI function and the GP-UCB function have found the global optimal value of the function, while the PI function has fallen into the local optimal solution. According to the experimental comparison results, we use the EI function to optimize the subsequent machine learning algorithm parameters because EI has better performance than PI on multiple local optimal solution problems. In addition, compared with GP-UCB, EI does not set other parameters, so it has more advantages than GP-UCB in terms of simplicity.Figure 2
The optimization process of the three collection functions.


## 4. Motivation Analysis of the Technological Startups Business Model Based on Intelligent Data Mining Analysis

As shown in Figure3, this study believes that the connotation of the business model of effective technological startups is to make correct strategic decisions, realize the value creation of the enterprise, bring relevant economic and social benefits to the enterprise in the efficient operation of the entire industrial chain, and maintain the long-term sustainable and stable development of the enterprise.Figure 3
The connotation of an effective technological startups business model.Taking the constituent elements of the technological startups business model as the starting point of the research, this article further identifies the key factors that affect the effectiveness of the technological startups business model and verifies the mechanism of these influencing factors on the effectiveness of the technological startups business model. This can fully explain the feasibility of evaluating the effectiveness of the technological startups business model by using factors that affect the effectiveness of the technological startups business model as an evaluation index. Through relevant analysis, this article believes that the mechanism of commercial effectiveness is shown in Figure4.Figure 4
The mechanism of the effectiveness of the technological startups business model.Commercial customer value, financial value, brand building, supplier relations, and sustainable development are all significantly related to the effectiveness of corporate technological startups business models. According to the results of gray correlation analysis, the revised technical startups business model effectiveness mechanism is shown in Figure5, and the following specific analysis is carried out.Figure 5
Modification of the mechanism of the effectiveness of the technological startups business model.This study constructs a relationship network for the evaluation of the effectiveness of the technological startups business model starting from the components of the technological startups business model, as shown in Figure6.Figure 6
The relationship between the components of the technological startups business model and the effectiveness evaluation of the technological startups business model.The effectiveness of the technological startups business model is mainly reflected in the sustainable development of the company, and human resources are the basis for the integration of various resources of the company, ensuring the high growth of the company. Moreover, a stable cooperative relationship with suppliers is also the basic guarantee for the long-term development of an enterprise. It is mainly measured by the proportion of scientific research personnel, employee satisfaction, risk identification ability, new product development ability, and cooperation stability. In summary, we have established an evaluation index system for the effectiveness evaluation of the technological startups business model, as shown in Figure7.Figure 7
The evaluation index chart of the effectiveness of the technological startups business model.Based on the above analysis, the logical structure of the platform as shown in Figure8 can be designed.Figure 8
Schematic diagram of the logical structure of the platform.The structure diagram of the platform module is shown in Figure9.Figure 9
Platform module structure diagram.After constructing the above model structure, the intelligent data mining effect of the system model in this studyr is evaluated in the form of simulation experiment, and the data mining effect is calculated, and the results shown in Table1 are obtained.Table 1
Evaluation of the effect of data mining.
NOData mining190.24291.23385.62484.42584.21691.94792.57894.49988.071095.411192.651286.631384.511492.651592.021689.111789.231887.471989.322086.072187.562289.862389.212491.242590.552690.152785.292891.472993.163087.733185.613294.073390.153494.353586.233692.633792.313894.693984.014087.27From the above analysis, we can see that the motivation analysis model of technological startups business model based on intelligent data mining analysis has a good effect in data mining. On this basis, the motivation analysis effect of this system is evaluated and the results shown in Table2 are obtained.Table 2
Evaluation of the motivation analysis effect of the motivation analysis model of the technological startups business model based on intelligent data mining analysis.
NOMotivation analysis170.77271.29388.48472.88576.87686.80773.78874.13972.261084.671177.611289.261381.881478.461568.721684.121785.791873.101980.602068.572188.632287.392369.792488.602589.102686.162775.742877.912977.743087.553181.963268.153371.953475.483579.473674.363780.953873.093968.084070.85From the above research, we can see that the motivation analysis model of technological startups business model based on intelligent data mining analysis in this study meets the basic requirements of the system design in this study.


## 5. Conclusion

Research on new-type enterprises has important guiding significance for China's construction of an innovative country. However, although the current research has laid a theoretical foundation in the definition of innovative enterprises, business models, intellectual property rights, value chains, and value networks, in general, they have not clearly revealed the nature and business model issues of innovative enterprises. Therefore, it is necessary to take innovative enterprises as the basic research object, and in accordance with the theoretical framework of business models, from the perspective of innovative enterprises’ value source, internal value chain, and external value network, reveal the process of innovative enterprises’ knowledge value creation around intellectual property rights. At the same time, it is necessary to explain the composition and characteristics of the external value network they are in, analyze the business model of innovative enterprises with knowledge assets as the core, and reveal the specific types of business models under different social and economic conditions to fill the theoretical gaps of innovative enterprises. This article combines intelligent data mining technology to analyze the motivations of the technological startups business model, which provides a theoretical reference for subsequent related research.



---

*Source: 9316534-2022-05-17.xml*