# Research on the Performance of Network Propagation by Using the Machine Learning and Internet-of-Things Technology Integrating Model

Authors: Feng Chen
Journal: Computational Intelligence and Neuroscience
 (2022)

---

## Abstract

We combine machine learning with Internet of Things technology to study the performance of network propagation model. This paper first introduces the construction environment of the business push system and then realizes user clustering and active business push by using the experimental data. Experimental results show that the active service push system constructed in this paper is feasible and effective. The experiment also compares and analyzes the influence of different clustering methods on the accuracy of service push. The results show that the clustering effect of the multi-Markov chain model (m-MCM) method is superior to that of theK-means method, a commonly used machine learning method, and the accuracy of user-service push obtained by the m-MCM method is superior to that obtained by the K-means method. Finally, on the basis of the existing experimental results, the shortcomings of the service push system are summarized, the future improvement direction and specific implementation measures are proposed, and new requirements for the future update of the service push system are put forward.


---

## Body

## 1. Introduction

The industrial Internet of Things is the product of the deep integration of the Internet of Things, big data, cloud computing, and other new-generation information technologies into the manufacturing industry. It is the main starting point for the digital transformation of the manufacturing industry and has become a key support for the fourth industrial revolution. Germany, the United States, Japan, and other major developed countries have established promotion agencies for the industrial Internet of Things and formulated strategic plans for the development of advanced manufacturing industries, including the industrial Internet of Things, so as to realize the transformation and upgrading of traditional manufacturing industries and reshape their competitive advantages. China has also formulated the “Made in China 2025” policy to accelerate the in-depth integration of the new generation of information technology and manufacturing as the main line and to promote intelligent manufacturing as the main direction.


## 2. Related Works

The research on the industrial Internet of Things started earlier in the world, and the research from the perspective of economics mainly focuses on business model, innovation model, enterprise organization, and other fields. First, regarding research on the business model, Arnold et al. [1] divided the business model of the industrial Internet of Things into cloud-based business model, service-oriented business model, and process-oriented business model according to different service objects. Gierej [2] believes that the emergence of the industrial Internet of Things on the one hand heralds the prospect of the development of industrial intelligence and on the other hand marks the transformation of the traditional manufacturing industry to “Outcome Economy,” that is, the product and service delivery mode with customer demand as the core. Montori et al. [3] proposed that the industrial Internet of Things has spawned a new business model, which is due to the fundamental change of consumer behavior and the entry of competitors from outside the manufacturing industry (such as technology enterprises and information technology enterprises). In order to cope with the drastic change of market environment and the increasingly fierce competition, manufacturing enterprises must adjust their original product-centered business model to evolve into the business model of “integration of product and service” [4, 5]. Second, regarding research on the innovation model, Kazuyuki [6] analyzed the relationship between the utilization status, scope, and innovation of big data of Japanese B2B and B2C large enterprises based on questionnaire survey data and pointed out that the application of Internet of Things and big data can on the one hand improve enterprise productivity and on the other hand change enterprise production mode and work content, and the society needs to cope with and adapt to this change. Third, regarding enterprise organization research, Iivari et al. [7] pointed out that the key issues that industrial IoT enterprises need to consider are not only the technical level but also the organizational level so as to achieve the balance and adaptation of enterprise organization, human resources, and industrial IoT technology. This requires the corresponding adjustment of the organizational structure of the enterprise, such as the development and integration of industrial Internet technology, the reconstruction of the core business of the enterprise, and the new mode of production and employee incentive system. Since the beginning of the twenty-first century, academic research on platform enterprises has increased dramatically. The references research path is as follows [8, 9]: since 2000, bilateral market research [10, 11], platform architecture research [9], open innovation research [12], and business ecosystem research have transferred to user innovation research [8, 13], it has formed the research trend of platform strategy under the interdisciplinary background. As soon as the concept of cloud manufacturing was put forward, it became an emerging topic and was warmly welcomed by many scientific researchers. Based on cloud computing, Internet of Things, and other contemporary information technologies, cloud manufacturing extends the concept of “software as a service,” an emerging concept in the field of cloud computing, and is introduced into the manufacturing industry.The research significance of information push technology is mainly reflected in three aspects. First of all, for service providers, a fast and accurate personalized service push system can improve the service quality, provide convenient and high-quality service content for service demanders smoothly, improve their competitiveness in the market, and promote the long-term development of enterprises. Secondly, for the service demand side, the intelligent service push technology saves users’ time and energy and improves users’ sense of pleasure in experience, and the efficient information push technology can realize the sharing value of information so that the majority of users can quickly find their service needs through this technology. Finally, for manufacturing production form, the development of information push technology accelerates the upgrade of the traditional manufacturing industry and makes manufacturing better integrated into the global economic development in order to improve the utilization rate of resources, reduce the manufacturing cost, promote the wisdom of the worldwide manufacturing model, and provide strong technical support [14].From passive search to active screening and elimination, active service push technology has changed greatly the people’s lifestyle. With the acceleration of social development, people hope to obtain more convenient and satisfying services through active service push technology. Information push is an active, intelligent, and perceptive information service form. According to the needs of users, the technology combines various advanced information technologies such as big data, artificial intelligence, and other technologies to timely and actively transfer information to the needs of users. This technology is widely used in e-commerce, social networks, information science, user personalized knowledge services, and other fields [15].Active service push technology combined with automatic system recognition and analysis technology analyzes the potential interest preference of push objects. It helps manufacturing enterprises find potential service objects among a large number of users, realize real-time push operation of personalized service, and improve the accuracy and satisfaction of push service. Active push service is widely used in a web browser and e-commerce platform. For example, Baidu platform analyzes the frequency of browsing and length of stay according to the types of web pages frequently browsed by users and recommends news content that may be of interest to users according to the specific ranking order, thus eliminating the user input keywords or related website.There are two characteristics of the active service push technology. (1) Active service push refers to the fact that the system automatically obtains the information of the web page browsing by users and uses various advanced data analysis technologies to push the content that users may be interested in. In the past, the demand analysis of services was initiated by users. (2) Cloud platforms are built through service virtualization. It is a gathering place of services and resources, realizing the sharing of services and resources, providing products and services needed by the market efficiently, and delivering them to users timely and accurately. Platform system 24 hours uninterrupted background operation.Research institutions have done a lot of research on the combination of information push with business processes such as enterprise design and manufacturing. The existing research is mainly reflected in the application of knowledge push in specific fields [16]. In terms of active push of cloud services, Palmisano [17] explored the blank field of online e-retail system and designed and built a recommendation system based on environment awareness. Tosi [18] proposed a method of knowledge push based on user content after identifying the user’s interest characteristics. Kobayashi et al. [19] proposed a search engine method based on user interest characteristics in the face of information flooding in the current network environment.There is a lot of networked manufacturing service information in the cloud manufacturing service platform. This paper takes the data maintenance disaster caused by big data as the research background, analyzes the historical browsing data of users, and speculates users’ preferences, tastes, and needs from the perspective of operators. A machine learning method based on the Markov chain model is proposed to aggregate users with the same interest characteristics, and then a collaborative filtering recommendation algorithm is used to analyze browsing logs, interaction logs, and transaction logs of users with the same interest characteristics. Finally, according to users’ ratings, recommend some novel service information that users have not contacted before or may be interested in.


## 3. Construction of Network Propagation Model

This section introduces the peripheral architecture of the network propagation and how to use machine learning to realize the active push process of service.


### 3.1. The Peripheral Architecture of Network Propagation

As shown in Figure1, the peripheral architecture of the push system is composed of four modules, which are data capture, data preprocessing, user clustering analysis with similar interest preferences, and service push module.Figure 1
The peripheral framework of the push system.The main functions of each module in the push system are as follows.


#### 3.1.1. Data Capture Module

This module provides important user data resources for simulation experiments. The data acquisition of this module mainly includes two processes: (1) web crawler technology to simulate logging into a social manufacturing network to obtain interested topic database information; (2) web crawler technology combined with a website API interface to capture the information of many ordinary users in the platform. After a month of data collection, the web crawler helped obtain personal and browsing information from unauthorized users, eventually collecting 830 users and more than 200,000 text messages. In order to reduce potential errors, this paper divides the data set into 20% as test set and 80% as training set according to the rule of 2 : 8.


#### 3.1.2. Data Preprocessing Module

The module mainly refines and analyzes the obtained text information and converts the obtained text information into numerical information to enable computer recognition. This module mainly includes two processes. (1) Transform the interest topic library information into a standard user interest eigenvalue vector. (2) With the standard user interest eigenvalue vector as the reference, the text information of each user is transformed into the eigenvalue vector as the input parameter of machine learning.


#### 3.1.3. User Clustering Module with Similar Interest

This module mainly gathers a class of users with the same interest and hobbies together through the Markov chain model in machine learning, reduces the scope of user collaborative filtering calculation, and reduces the workload of the working platform. This module takes the user interest eigenvalue vector obtained in the data preprocessing module as the relevant parameters of the multi-Markov model. In the multi-Markov model, the eigenvalue vector of each user can be regarded as a Markov chain, so the set of users becomes the set of Markov chains. In the set of Markov chains, clustering and merging Markov chains with the same or similar characteristics can realize the aggregation of a class of users with the same interests.


#### 3.1.4. Service Push Module

This module is based on user clustering module with similar interests. Through the clustering module, a class of users with the same interest characteristics are gathered together. By analyzing the transaction record information obtained by the data acquisition module, the user-based collaborative filtering recommendation method is used to realize the active push of the service.


### 3.2. Overall Framework Design of Push System

Section3.1 outlines the peripheral architecture of the push system, and this section will analyze the main contents of the push system module one by one. Figure 2 describes the main contents of the system in detail. Data acquisition module and data preprocessing module mainly include data acquisition, interest topic database data, and data processing of ordinary users. User clustering module mainly includes transforming user’s eigenvalue vector into Markov chain and similar Markov chain clustering operation; service push module mainly includes service evaluation and active push operation of user transaction records. This section will introduce the main contents of user clustering module and service push module in detail.Figure 2
Push system internal details.


### 3.3. Markov Chain Model

#### 3.3.1. Single Markov Chain Model (s-MCM)

According to the characteristics of the Markov chain, the interest characteristic value vector of each ordinary user is transformed into the corresponding parameters in the single Markov chain model to predict the user’s interest orientation and interest category. However, if you want to use the single Markov chain model to judge the user interest category, you must make the following assumptions about the user browsing process on the website.Assumption l.
(Markov hypothesis) Assuming that the browsing process is a random process, users can be regarded as homogeneous discrete Markov chain. Therefore, a user’s browsing record on the website is translated into a sequence of random variablesX, which satisfies Markov property.
Under assumption 1, we establish a single Markov chain model (s-MCM).Definition 1.
s-MCM is represented by tripleMC=X,A,λ [20]. X represents the discrete random variable, its value range is x1,…,xi,…,xn, and xi is one state of the model, representing that the user stays in the state of interest. A represents state transition probability matrix, which is also named transition matrix. In the transition matrix, the probability of transition from state xi to state xj can be calculated by the formula Pij=PXt=xj/Xt−1=xi, and the transition process can be simplified and written as a state pair xi,xj. λ represents the initial state distribution, where each term Pi=PXt=0=xi. In summary, the transfer matrix A is(1)A=pij=P11P12⋯P1j⋯P1nP21P22⋯P2j⋯P2n⋯⋯⋯⋯⋯⋯Pi1Pi2⋯Pij⋯Pin⋯⋯⋯⋯⋯⋯Pn1Pn2⋯Pnj⋯Pnn,(2)R=u1u2u3u4u54005055054054035355440430.
At the same time, the initial state distribution is as follows:(3)λ=pi=P1,P2,…,Pn.
According to the definition of the single Markov chain model, a user’s interest eigenvalue sequenceXi is essentially a collection of all pages xi visited by the user. By counting the number of visits that the user clicks on different pages xi, the vector of the user’s number of visits to different pages is obtained, that is, the interest eigenvalue vector Xi. All the data recorded in the process is denoted d1. By analogy, the data recorded by the m th user is dm, so the data set obtained by all users is D=d1,d2,…,dm.
Thus, the parametersPij and Pi in the single Markov chain model based on all user data can be estimated by the data set D and the maximum likelihood estimation method; namely,(4)pij=sij∑j=1nsij,(5)pi=∑j=1nsij∑i=1n∑j=1nsij.
In (4) and (5), sij represents the number of occurrences of state pairs xi,xj in all user text information. When the parameters pij and pi are calculated, substituted into (2) and (3), the triple parameters X,A,λ of the single Markov chain model can be obtained based on all user data.


#### 3.3.2. Multi-Markov Chain Model

As described in the summary of Section3.3.1, it is inaccurate to describe all users’ interest characteristics and categories only by establishing a single Markov chain model based on all users’ data. In order to improve the accuracy of predicting user interest characteristics, this paper introduces the concept of multi-Markov chain model based on the single Markov chain model, which aims to obtain higher accuracy. The reason why the multi-Markov chain model is more suitable for the modeling of this topic is that the user’s interest preference is affected by the user’s own manufacturing environment, manufacturing capacity, and other factors. It is an uncertain complex sequence affected by multiple external factors. Therefore, the same category of users with the same or similar interest features is more suitable to be described by the same model; on the contrary, it is more reasonable to describe different types of users with different or not similar interest characteristics by different models. Based on this idea, a multi-Markov chain model based on all user data is established to describe the interest characteristics of all users. The premise is that the user’s browsing process needs to meet the following two assumptions.Assumption 2.
(User Classification Hypothesis) Let all users haveK categories, and then C=c1,c2,…,ck denotes the category set of users, and PC=ck denotes the probability that any user belongs to category ck.(6)∑k=1KPC=ck=1.Assumption 3.
(Markov-like chain hypothesis) Let the same category of users have the same or similar interest features, and the sequence of these features is a unique random process. The multi-Markov chain model is defined under Assumptions1 and 2.Definition 2.
m-MCM is represented by four tuplesX,K,PC,MC. X is a discrete random variable in the range of x1,…,xi,…,xn, and xi is a state of the model, representing the user interest eigenvalues. K is a preset value in the model, representing the number of user classifications. C=c1,c2,…,ck denotes the category of users, and the probability distribution of different types of users is represented by the distribution function PC. Element mck represents the Markov chain composed of the same user ck with the same interest type. If the element mck is set together, we obtain the class Markov set MC=mc1,mc2,…,mck, which represents the set of Markov chains of all categories of users.
In the multi-Markov chain model, the state transition matrixAk of the class k is(7)Ak=pkij=Pk11Pk12⋯Pk1j⋯Pk1nPk21Pk22⋯Pk2j⋯Pk2n⋯⋯⋯⋯⋯⋯Pki1Pki2⋯Pkij⋯Pkin⋯⋯⋯⋯⋯⋯Pkn1Pkn2⋯Pknj⋯Pknn.
And the initial distribution of classk is(8)λk=pki=Pk1,Pk2,…,Pkn.
In (7) and (8), the unknown parameters pkij and pki can be obtained according to the definition of the multi-Markov chain. Because any user has its own unique interest characteristics in the initial state and can be regarded as a class of users alone, the parameters pkij and pki can be obtained by a calculation method similar to the single Markov chain; namely,(9)Pkij=Skij+akij∑j=1nSkij+akij,(10)pki=∑j=1nSkij+αkij∑i=1n∑j=1nSkij+αkij.
In (9) and (10), Skij represents the number of state pairs xi,xj appearing in the class k user text information. αkij is the superparameter. And the superparameter αkij can be calculated by assuming that all state pairs xi,xj have the same number of occurrences, that is, Bayes assumption, and then αkij can be obtained by (11) approximation:(11)αkij=βn×n.
In (11), constant β is often replaced by the size n of the problem domain space. In summary, when the parameters pkij and pki are calculated, substituted into (7) and (8), we obtain the four-tuple parameters of the m-like Markov chain mode X,K,PC,MC. It is worth declaring that there are m users in the whole process, and the users are divided into m categories; each class Markov chain calculated represents a sequence of user interest eigenvalues.


### 3.4. Fusion of Interest Feature Vector and Multi-Markov Chain Model

The user’s interest eigenvalue vector has been calculated in Section 3. This section will focus on how to use the known interest eigenvalue vector to calculate the parameters in the multi-Markov chain model.The core idea is summarized as follows. Firstly,K = m is set to generate a quasi-Markov chain, and the practical significance of this step is to regard each user as an independent category, so the sequence of interest characteristic values of m users is correspondingly transformed into m Markov chains. Then, according to the one-to-one correspondence between m users and m Markov chains, the clustering operation of these Markov chains is carried out to realize the clustering of m users. The specific Markov-like chain generation process is as follows.The initial state is regarded as a multi-Markov chain model under special circumstances; that is, a user’s interest eigenvalue sequence is a category (K = m), and then the data set D=d1,d2,…,dm composed of m user’s interest eigenvalue is divided into K categories: D1,D2,…,Dk. Therefore, each user category c_k is essentially a single Markov chain model based on learning data D_k. Therefore, the parameters pkij and pki can be obtained by (9) and (10), and then the state transition matrix Ak and the initial state λk are obtained.At this point, the interest eigenvalue vector ofm users is transformed into a Markov-like chain of m users. Then, the clustering of similar or similar users is actually the clustering of similar or similar user class Markov chain.


### 3.5. Markov Chain Clustering

Section3.4 has introduced in detail how the text data of m users are transformed into a Markov chain like m users; that is, the collected user data is transformed into a Markov chain set. The user clustering is actually the clustering of Markov chains, so the similarity evaluation criteria of two Markov chains must be defined in advance.According to the definition, the dynamic characteristics of the Markov chain are represented by its state transition matrix, so the similarity between Markov chainsmck and mcl can be defined by mining the relationship between the two state transition matrices. The definition process of similarity is as follows. Let mck and mcl be any two Markov chains, and their state transition matrices are Ak and Al, respectively. The i th row pki parameter in the state transition matrix Al is Pkij|j=1,2,…,n. And the i th row pli parameter in the state transition matrix Ak is Plij|j=1,2,…,n.The parameters of both rows represent the distribution of variablest under a given condition Xt−1=xt, that is, PXt|Xt−1=xt, whose approximation can be represented by their cross-entropy. The parameters of the two lines Pki and Pli both represent the distribution of the variable t under the given Xt−1=xt condition, that is, PXt|Xt−1=xt, whose approximation can be represented by their cross-entropy:(12)CEPki,Pli=∑j=1nPkijlogPkijPlij.Therefore, the approximate degree of state transition matricesAk and Al can be expressed by the mean of cross-entropy of all row distributions; namely,(13)SimilarityAk,Al=∑i=1nCEPki,Plin.However, if (4)–(16) is directly used to evaluate the similarity between state transition matrices Ak and Al; there will be two defects:(1)
First, the cross-entropy (12) is directional, so (13) does not meet the symmetric property; that is, SimilarityAk,Al≠SimilarityAl,Ak.(2)
Equation (13) reflects that the more similar the dynamic characteristics of two Markov chains are, the smaller the similarity value of the two Markov chains is, which does not conform to the definition of similarity semantics.Therefore, to avoid the above two defects, we define the similarity ofmck and mcl of two Markov chains as(14)Similaritymck,mcl=2SimilarityAk,Al+SimilarityAl,Ak.Note: if theSimilarityAk,Al+SimilarityAl,Ak=0, 2/0 = ∞. The analysis (14) shows that the more similar the dynamic characteristics of two Markov chains are, the greater the similarity value is, which meets the requirement of similarity semantics.


### 3.6. Multi-Markov Chain Model Clustering Method

Based on the above steps, we give a user clustering method based on the multi-Markov chain model.(i)
User clustering steps:(ii)
Input: user learning dataD=d1,d2,…,dm.(iii)
Output: User clustering result.(iv)
Process:(v)
Step l: Use (9) and (10) to map the learning data D into M Markov chains.(vi)
Step 2: Use (11) to (14) to calculate the similarity degree between two Markov chains and arrange them according to the similarity value obtained by calculation from large to small.(vii)
Step 3: According to the preset number of classifications and similarity values, clusterm Markov chains.(viii)
Step 4: According to the corresponding relationship betweenm Markov chains and m users, output the clustering result.


### 3.7. Design of Active Service Push Algorithm

The service push system can be vividly described by a black box. The basic data resources of the pushed object are processed by the black box to obtain the push list, and they will receive service recommendations from the platform at a certain point offline.In the existing service push system, the system that can achieve accurate push has not emerged because each push method only uses a small part of the system information. To achieve the goal of pushing more accurate, higher quality, and higher satisfaction services for service push objects, this paper adopts multilevel and all-round analysis methods to deal with the information acquired in the system, that is, the cluster-service collaborative filtering and mixed push method. Through the clustering analysis of users in the platform, users with the same interest category are classified into one class. Then, the collaborative filtering recommendation algorithm is used to push services to users with the same interest category. Because the evaluation model of “user-service“ for users of the same type is similar, there will not be too many nonevaluation services, which makes the evaluation matrix sparse. This can improve the accuracy of service push. The user clustering analysis method in the mixed push method has been introduced in detail in the previous sections, and the user-based collaborative filtering method will be explained in detail in the following.


### 3.8. User-Based Collaborative Filtering Recommendation Method

Through user clustering, a class of nearest neighbor user sets with similar interest characteristics can be obtained. The services in user sets are all closely related to users. Although the massive service types and quantity at the beginning of push have been reduced through clustering operation, service demanders will still be at a loss when facing a series of untargeted push services if these services are sent to service push objects in no order. In order to reduce the time spent by service demanders to understand each service, the nearest neighbor user set is substituted into the “user-service” evaluation model, which aims to generate a ranking list of services that users may like through this model. Finally, the service push object will receive the push information offline and in some way.


### 3.9. Establishment of “User-Service Evaluation Model”

“User-service evaluation model” is shown as follows. Assuming that there arem users in the nearest neighbor user set and s corresponding service sets, the “user-service” evaluation matrix R is(15)R=u1⋮ui⋮umr1⋯rj⋯rsR11⋯R1j⋯Rs⋮⋮Ri1⋯Rij⋯Ris⋮⋮Rm1⋯Rmj⋯Rms.In (15), UI represents the i th user, Rj represents the j th service, and Rij represents the score of the i th user on the j th service.Rij is a real number ranging from 1 to 5. The higher the value of Rij is, the higher the user satisfaction is. If the user UI does not evaluate the service Rj, the value of Rij is defined as 0. The real-value scoring method is widely spread among service platforms because this scoring mode is more reasonable and detailed, which can greatly reduce the sparsity of “user-service” evaluation matrix R so as to improve the accuracy and satisfaction of service push to the greatest extent.


### 3.10. Similarity between Computing Services

When the “user-service” evaluation matrixR is used to calculate the list of push score values of similar services, cosine similarity value and Person similarity value between services can generally be calculated. However, the Person similarity calculation method is more delicate, and the average operation of subtracting the score value from the overall service score value is used to reduce the impact of different evaluation values on the same service with the same evaluation. The calculation results are more reliable and convincing, so the Person similarity measurement is adopted in this paper.


### 3.11. Person Similarity Measurement Calculation Method

Assuming thatIpq is the set of users who have commented on service rp and rq together in the nearest user set and Rp¯ and Rq¯ are the average ratings of users on service rp and rq, respectively, then the similarity δrp,rq is shown in (16):(16)δrp,rq=∑i∈IpqRip−Rp¯Riq−Rq¯∑i∈IpqRip−Rp¯2∑i∈IpqRiq−Rq¯2.


### 3.12. The Calculation Example of Service Actively Pushes

Calculation example 1: assume that usersu0,u1,u2,u3,u4,u5 are a small group of nearest neighbor users after a clustering, and its user-service evaluation matrix is(17)r1r2r3r4r5R=u0u1u2u3u4u54005055054054035355440430.Among them,R1¯=3.67,R2¯=2.83,R3¯=2.67,R4¯=3.0,R5¯=1.83. The users who jointly commented on service 1 and service 2 are u1,u2,u4, so δr1,r2 can be calculated by the following formula:(18)δr1,r2=∑i∈I12Ri1−R1¯Ri2−R2¯∑i∈I12Ri1−R¯12∑i∈I12Ri2−R¯22=5−3.67×5−2.83+4−3.67×4−2.83+5−3.67×3−2.835−3.672+4−3.672+5−3.672×5−2.832+4−2.832+3−2.832=0.7413.Furthermore, the calculation process ofδr1,r3,δr1,r4,andδr1,r5 is as follows:(19)δr1,r3=4−3.674−2.67+5−3.675−2.67+4−3.674−2.674−3.672+5−3.672+4−3.672×4−2.672+5−2.672+4−2.672=0.9422,δr1,r4=4−3.67×5−3+5−3.67×5−3+5−3.67×5−3+4−3.67×3−34−3.672+5−3.672+v2+4−3.672×5−32+5−32+5−32+0=0.8908,δr1,r5=5−3.67×4−1.83+4−3.67×3−1.83+5−3.67×4−1.835−3.672+4−3.672+5−3.672×4−1.832+3−1.832+4−1.832=0.9819,where δr1,r5>δr1,r3>δr1,r4δr1,r2 is sorted according to the service similarity value. And the active service push list is shown in Table 1.Table 1
Active service push list.
Push sequence sortService typeService evaluation1r5 (service 5)0.98192r3 (service 3)0.94223r4 (service 4)0.89084r2 (service 2)0.7413Therefore, according to the service push data in Table1, if user u0 is the active service push object, service 5 and service 3 will be pushed preferentially.


## 3.1. The Peripheral Architecture of Network Propagation

As shown in Figure1, the peripheral architecture of the push system is composed of four modules, which are data capture, data preprocessing, user clustering analysis with similar interest preferences, and service push module.Figure 1
The peripheral framework of the push system.The main functions of each module in the push system are as follows.


### 3.1.1. Data Capture Module

This module provides important user data resources for simulation experiments. The data acquisition of this module mainly includes two processes: (1) web crawler technology to simulate logging into a social manufacturing network to obtain interested topic database information; (2) web crawler technology combined with a website API interface to capture the information of many ordinary users in the platform. After a month of data collection, the web crawler helped obtain personal and browsing information from unauthorized users, eventually collecting 830 users and more than 200,000 text messages. In order to reduce potential errors, this paper divides the data set into 20% as test set and 80% as training set according to the rule of 2 : 8.


### 3.1.2. Data Preprocessing Module

The module mainly refines and analyzes the obtained text information and converts the obtained text information into numerical information to enable computer recognition. This module mainly includes two processes. (1) Transform the interest topic library information into a standard user interest eigenvalue vector. (2) With the standard user interest eigenvalue vector as the reference, the text information of each user is transformed into the eigenvalue vector as the input parameter of machine learning.


### 3.1.3. User Clustering Module with Similar Interest

This module mainly gathers a class of users with the same interest and hobbies together through the Markov chain model in machine learning, reduces the scope of user collaborative filtering calculation, and reduces the workload of the working platform. This module takes the user interest eigenvalue vector obtained in the data preprocessing module as the relevant parameters of the multi-Markov model. In the multi-Markov model, the eigenvalue vector of each user can be regarded as a Markov chain, so the set of users becomes the set of Markov chains. In the set of Markov chains, clustering and merging Markov chains with the same or similar characteristics can realize the aggregation of a class of users with the same interests.


### 3.1.4. Service Push Module

This module is based on user clustering module with similar interests. Through the clustering module, a class of users with the same interest characteristics are gathered together. By analyzing the transaction record information obtained by the data acquisition module, the user-based collaborative filtering recommendation method is used to realize the active push of the service.


## 3.1.1. Data Capture Module

This module provides important user data resources for simulation experiments. The data acquisition of this module mainly includes two processes: (1) web crawler technology to simulate logging into a social manufacturing network to obtain interested topic database information; (2) web crawler technology combined with a website API interface to capture the information of many ordinary users in the platform. After a month of data collection, the web crawler helped obtain personal and browsing information from unauthorized users, eventually collecting 830 users and more than 200,000 text messages. In order to reduce potential errors, this paper divides the data set into 20% as test set and 80% as training set according to the rule of 2 : 8.


## 3.1.2. Data Preprocessing Module

The module mainly refines and analyzes the obtained text information and converts the obtained text information into numerical information to enable computer recognition. This module mainly includes two processes. (1) Transform the interest topic library information into a standard user interest eigenvalue vector. (2) With the standard user interest eigenvalue vector as the reference, the text information of each user is transformed into the eigenvalue vector as the input parameter of machine learning.


## 3.1.3. User Clustering Module with Similar Interest

This module mainly gathers a class of users with the same interest and hobbies together through the Markov chain model in machine learning, reduces the scope of user collaborative filtering calculation, and reduces the workload of the working platform. This module takes the user interest eigenvalue vector obtained in the data preprocessing module as the relevant parameters of the multi-Markov model. In the multi-Markov model, the eigenvalue vector of each user can be regarded as a Markov chain, so the set of users becomes the set of Markov chains. In the set of Markov chains, clustering and merging Markov chains with the same or similar characteristics can realize the aggregation of a class of users with the same interests.


## 3.1.4. Service Push Module

This module is based on user clustering module with similar interests. Through the clustering module, a class of users with the same interest characteristics are gathered together. By analyzing the transaction record information obtained by the data acquisition module, the user-based collaborative filtering recommendation method is used to realize the active push of the service.


## 3.2. Overall Framework Design of Push System

Section3.1 outlines the peripheral architecture of the push system, and this section will analyze the main contents of the push system module one by one. Figure 2 describes the main contents of the system in detail. Data acquisition module and data preprocessing module mainly include data acquisition, interest topic database data, and data processing of ordinary users. User clustering module mainly includes transforming user’s eigenvalue vector into Markov chain and similar Markov chain clustering operation; service push module mainly includes service evaluation and active push operation of user transaction records. This section will introduce the main contents of user clustering module and service push module in detail.Figure 2
Push system internal details.


## 3.3. Markov Chain Model

### 3.3.1. Single Markov Chain Model (s-MCM)

According to the characteristics of the Markov chain, the interest characteristic value vector of each ordinary user is transformed into the corresponding parameters in the single Markov chain model to predict the user’s interest orientation and interest category. However, if you want to use the single Markov chain model to judge the user interest category, you must make the following assumptions about the user browsing process on the website.Assumption l.
(Markov hypothesis) Assuming that the browsing process is a random process, users can be regarded as homogeneous discrete Markov chain. Therefore, a user’s browsing record on the website is translated into a sequence of random variablesX, which satisfies Markov property.
Under assumption 1, we establish a single Markov chain model (s-MCM).Definition 1.
s-MCM is represented by tripleMC=X,A,λ [20]. X represents the discrete random variable, its value range is x1,…,xi,…,xn, and xi is one state of the model, representing that the user stays in the state of interest. A represents state transition probability matrix, which is also named transition matrix. In the transition matrix, the probability of transition from state xi to state xj can be calculated by the formula Pij=PXt=xj/Xt−1=xi, and the transition process can be simplified and written as a state pair xi,xj. λ represents the initial state distribution, where each term Pi=PXt=0=xi. In summary, the transfer matrix A is(1)A=pij=P11P12⋯P1j⋯P1nP21P22⋯P2j⋯P2n⋯⋯⋯⋯⋯⋯Pi1Pi2⋯Pij⋯Pin⋯⋯⋯⋯⋯⋯Pn1Pn2⋯Pnj⋯Pnn,(2)R=u1u2u3u4u54005055054054035355440430.
At the same time, the initial state distribution is as follows:(3)λ=pi=P1,P2,…,Pn.
According to the definition of the single Markov chain model, a user’s interest eigenvalue sequenceXi is essentially a collection of all pages xi visited by the user. By counting the number of visits that the user clicks on different pages xi, the vector of the user’s number of visits to different pages is obtained, that is, the interest eigenvalue vector Xi. All the data recorded in the process is denoted d1. By analogy, the data recorded by the m th user is dm, so the data set obtained by all users is D=d1,d2,…,dm.
Thus, the parametersPij and Pi in the single Markov chain model based on all user data can be estimated by the data set D and the maximum likelihood estimation method; namely,(4)pij=sij∑j=1nsij,(5)pi=∑j=1nsij∑i=1n∑j=1nsij.
In (4) and (5), sij represents the number of occurrences of state pairs xi,xj in all user text information. When the parameters pij and pi are calculated, substituted into (2) and (3), the triple parameters X,A,λ of the single Markov chain model can be obtained based on all user data.


### 3.3.2. Multi-Markov Chain Model

As described in the summary of Section3.3.1, it is inaccurate to describe all users’ interest characteristics and categories only by establishing a single Markov chain model based on all users’ data. In order to improve the accuracy of predicting user interest characteristics, this paper introduces the concept of multi-Markov chain model based on the single Markov chain model, which aims to obtain higher accuracy. The reason why the multi-Markov chain model is more suitable for the modeling of this topic is that the user’s interest preference is affected by the user’s own manufacturing environment, manufacturing capacity, and other factors. It is an uncertain complex sequence affected by multiple external factors. Therefore, the same category of users with the same or similar interest features is more suitable to be described by the same model; on the contrary, it is more reasonable to describe different types of users with different or not similar interest characteristics by different models. Based on this idea, a multi-Markov chain model based on all user data is established to describe the interest characteristics of all users. The premise is that the user’s browsing process needs to meet the following two assumptions.Assumption 2.
(User Classification Hypothesis) Let all users haveK categories, and then C=c1,c2,…,ck denotes the category set of users, and PC=ck denotes the probability that any user belongs to category ck.(6)∑k=1KPC=ck=1.Assumption 3.
(Markov-like chain hypothesis) Let the same category of users have the same or similar interest features, and the sequence of these features is a unique random process. The multi-Markov chain model is defined under Assumptions1 and 2.Definition 2.
m-MCM is represented by four tuplesX,K,PC,MC. X is a discrete random variable in the range of x1,…,xi,…,xn, and xi is a state of the model, representing the user interest eigenvalues. K is a preset value in the model, representing the number of user classifications. C=c1,c2,…,ck denotes the category of users, and the probability distribution of different types of users is represented by the distribution function PC. Element mck represents the Markov chain composed of the same user ck with the same interest type. If the element mck is set together, we obtain the class Markov set MC=mc1,mc2,…,mck, which represents the set of Markov chains of all categories of users.
In the multi-Markov chain model, the state transition matrixAk of the class k is(7)Ak=pkij=Pk11Pk12⋯Pk1j⋯Pk1nPk21Pk22⋯Pk2j⋯Pk2n⋯⋯⋯⋯⋯⋯Pki1Pki2⋯Pkij⋯Pkin⋯⋯⋯⋯⋯⋯Pkn1Pkn2⋯Pknj⋯Pknn.
And the initial distribution of classk is(8)λk=pki=Pk1,Pk2,…,Pkn.
In (7) and (8), the unknown parameters pkij and pki can be obtained according to the definition of the multi-Markov chain. Because any user has its own unique interest characteristics in the initial state and can be regarded as a class of users alone, the parameters pkij and pki can be obtained by a calculation method similar to the single Markov chain; namely,(9)Pkij=Skij+akij∑j=1nSkij+akij,(10)pki=∑j=1nSkij+αkij∑i=1n∑j=1nSkij+αkij.
In (9) and (10), Skij represents the number of state pairs xi,xj appearing in the class k user text information. αkij is the superparameter. And the superparameter αkij can be calculated by assuming that all state pairs xi,xj have the same number of occurrences, that is, Bayes assumption, and then αkij can be obtained by (11) approximation:(11)αkij=βn×n.
In (11), constant β is often replaced by the size n of the problem domain space. In summary, when the parameters pkij and pki are calculated, substituted into (7) and (8), we obtain the four-tuple parameters of the m-like Markov chain mode X,K,PC,MC. It is worth declaring that there are m users in the whole process, and the users are divided into m categories; each class Markov chain calculated represents a sequence of user interest eigenvalues.


## 3.3.1. Single Markov Chain Model (s-MCM)

According to the characteristics of the Markov chain, the interest characteristic value vector of each ordinary user is transformed into the corresponding parameters in the single Markov chain model to predict the user’s interest orientation and interest category. However, if you want to use the single Markov chain model to judge the user interest category, you must make the following assumptions about the user browsing process on the website.Assumption l.
(Markov hypothesis) Assuming that the browsing process is a random process, users can be regarded as homogeneous discrete Markov chain. Therefore, a user’s browsing record on the website is translated into a sequence of random variablesX, which satisfies Markov property.
Under assumption 1, we establish a single Markov chain model (s-MCM).Definition 1.
s-MCM is represented by tripleMC=X,A,λ [20]. X represents the discrete random variable, its value range is x1,…,xi,…,xn, and xi is one state of the model, representing that the user stays in the state of interest. A represents state transition probability matrix, which is also named transition matrix. In the transition matrix, the probability of transition from state xi to state xj can be calculated by the formula Pij=PXt=xj/Xt−1=xi, and the transition process can be simplified and written as a state pair xi,xj. λ represents the initial state distribution, where each term Pi=PXt=0=xi. In summary, the transfer matrix A is(1)A=pij=P11P12⋯P1j⋯P1nP21P22⋯P2j⋯P2n⋯⋯⋯⋯⋯⋯Pi1Pi2⋯Pij⋯Pin⋯⋯⋯⋯⋯⋯Pn1Pn2⋯Pnj⋯Pnn,(2)R=u1u2u3u4u54005055054054035355440430.
At the same time, the initial state distribution is as follows:(3)λ=pi=P1,P2,…,Pn.
According to the definition of the single Markov chain model, a user’s interest eigenvalue sequenceXi is essentially a collection of all pages xi visited by the user. By counting the number of visits that the user clicks on different pages xi, the vector of the user’s number of visits to different pages is obtained, that is, the interest eigenvalue vector Xi. All the data recorded in the process is denoted d1. By analogy, the data recorded by the m th user is dm, so the data set obtained by all users is D=d1,d2,…,dm.
Thus, the parametersPij and Pi in the single Markov chain model based on all user data can be estimated by the data set D and the maximum likelihood estimation method; namely,(4)pij=sij∑j=1nsij,(5)pi=∑j=1nsij∑i=1n∑j=1nsij.
In (4) and (5), sij represents the number of occurrences of state pairs xi,xj in all user text information. When the parameters pij and pi are calculated, substituted into (2) and (3), the triple parameters X,A,λ of the single Markov chain model can be obtained based on all user data.


## 3.3.2. Multi-Markov Chain Model

As described in the summary of Section3.3.1, it is inaccurate to describe all users’ interest characteristics and categories only by establishing a single Markov chain model based on all users’ data. In order to improve the accuracy of predicting user interest characteristics, this paper introduces the concept of multi-Markov chain model based on the single Markov chain model, which aims to obtain higher accuracy. The reason why the multi-Markov chain model is more suitable for the modeling of this topic is that the user’s interest preference is affected by the user’s own manufacturing environment, manufacturing capacity, and other factors. It is an uncertain complex sequence affected by multiple external factors. Therefore, the same category of users with the same or similar interest features is more suitable to be described by the same model; on the contrary, it is more reasonable to describe different types of users with different or not similar interest characteristics by different models. Based on this idea, a multi-Markov chain model based on all user data is established to describe the interest characteristics of all users. The premise is that the user’s browsing process needs to meet the following two assumptions.Assumption 2.
(User Classification Hypothesis) Let all users haveK categories, and then C=c1,c2,…,ck denotes the category set of users, and PC=ck denotes the probability that any user belongs to category ck.(6)∑k=1KPC=ck=1.Assumption 3.
(Markov-like chain hypothesis) Let the same category of users have the same or similar interest features, and the sequence of these features is a unique random process. The multi-Markov chain model is defined under Assumptions1 and 2.Definition 2.
m-MCM is represented by four tuplesX,K,PC,MC. X is a discrete random variable in the range of x1,…,xi,…,xn, and xi is a state of the model, representing the user interest eigenvalues. K is a preset value in the model, representing the number of user classifications. C=c1,c2,…,ck denotes the category of users, and the probability distribution of different types of users is represented by the distribution function PC. Element mck represents the Markov chain composed of the same user ck with the same interest type. If the element mck is set together, we obtain the class Markov set MC=mc1,mc2,…,mck, which represents the set of Markov chains of all categories of users.
In the multi-Markov chain model, the state transition matrixAk of the class k is(7)Ak=pkij=Pk11Pk12⋯Pk1j⋯Pk1nPk21Pk22⋯Pk2j⋯Pk2n⋯⋯⋯⋯⋯⋯Pki1Pki2⋯Pkij⋯Pkin⋯⋯⋯⋯⋯⋯Pkn1Pkn2⋯Pknj⋯Pknn.
And the initial distribution of classk is(8)λk=pki=Pk1,Pk2,…,Pkn.
In (7) and (8), the unknown parameters pkij and pki can be obtained according to the definition of the multi-Markov chain. Because any user has its own unique interest characteristics in the initial state and can be regarded as a class of users alone, the parameters pkij and pki can be obtained by a calculation method similar to the single Markov chain; namely,(9)Pkij=Skij+akij∑j=1nSkij+akij,(10)pki=∑j=1nSkij+αkij∑i=1n∑j=1nSkij+αkij.
In (9) and (10), Skij represents the number of state pairs xi,xj appearing in the class k user text information. αkij is the superparameter. And the superparameter αkij can be calculated by assuming that all state pairs xi,xj have the same number of occurrences, that is, Bayes assumption, and then αkij can be obtained by (11) approximation:(11)αkij=βn×n.
In (11), constant β is often replaced by the size n of the problem domain space. In summary, when the parameters pkij and pki are calculated, substituted into (7) and (8), we obtain the four-tuple parameters of the m-like Markov chain mode X,K,PC,MC. It is worth declaring that there are m users in the whole process, and the users are divided into m categories; each class Markov chain calculated represents a sequence of user interest eigenvalues.


## 3.4. Fusion of Interest Feature Vector and Multi-Markov Chain Model

The user’s interest eigenvalue vector has been calculated in Section 3. This section will focus on how to use the known interest eigenvalue vector to calculate the parameters in the multi-Markov chain model.The core idea is summarized as follows. Firstly,K = m is set to generate a quasi-Markov chain, and the practical significance of this step is to regard each user as an independent category, so the sequence of interest characteristic values of m users is correspondingly transformed into m Markov chains. Then, according to the one-to-one correspondence between m users and m Markov chains, the clustering operation of these Markov chains is carried out to realize the clustering of m users. The specific Markov-like chain generation process is as follows.The initial state is regarded as a multi-Markov chain model under special circumstances; that is, a user’s interest eigenvalue sequence is a category (K = m), and then the data set D=d1,d2,…,dm composed of m user’s interest eigenvalue is divided into K categories: D1,D2,…,Dk. Therefore, each user category c_k is essentially a single Markov chain model based on learning data D_k. Therefore, the parameters pkij and pki can be obtained by (9) and (10), and then the state transition matrix Ak and the initial state λk are obtained.At this point, the interest eigenvalue vector ofm users is transformed into a Markov-like chain of m users. Then, the clustering of similar or similar users is actually the clustering of similar or similar user class Markov chain.


## 3.5. Markov Chain Clustering

Section3.4 has introduced in detail how the text data of m users are transformed into a Markov chain like m users; that is, the collected user data is transformed into a Markov chain set. The user clustering is actually the clustering of Markov chains, so the similarity evaluation criteria of two Markov chains must be defined in advance.According to the definition, the dynamic characteristics of the Markov chain are represented by its state transition matrix, so the similarity between Markov chainsmck and mcl can be defined by mining the relationship between the two state transition matrices. The definition process of similarity is as follows. Let mck and mcl be any two Markov chains, and their state transition matrices are Ak and Al, respectively. The i th row pki parameter in the state transition matrix Al is Pkij|j=1,2,…,n. And the i th row pli parameter in the state transition matrix Ak is Plij|j=1,2,…,n.The parameters of both rows represent the distribution of variablest under a given condition Xt−1=xt, that is, PXt|Xt−1=xt, whose approximation can be represented by their cross-entropy. The parameters of the two lines Pki and Pli both represent the distribution of the variable t under the given Xt−1=xt condition, that is, PXt|Xt−1=xt, whose approximation can be represented by their cross-entropy:(12)CEPki,Pli=∑j=1nPkijlogPkijPlij.Therefore, the approximate degree of state transition matricesAk and Al can be expressed by the mean of cross-entropy of all row distributions; namely,(13)SimilarityAk,Al=∑i=1nCEPki,Plin.However, if (4)–(16) is directly used to evaluate the similarity between state transition matrices Ak and Al; there will be two defects:(1)
First, the cross-entropy (12) is directional, so (13) does not meet the symmetric property; that is, SimilarityAk,Al≠SimilarityAl,Ak.(2)
Equation (13) reflects that the more similar the dynamic characteristics of two Markov chains are, the smaller the similarity value of the two Markov chains is, which does not conform to the definition of similarity semantics.Therefore, to avoid the above two defects, we define the similarity ofmck and mcl of two Markov chains as(14)Similaritymck,mcl=2SimilarityAk,Al+SimilarityAl,Ak.Note: if theSimilarityAk,Al+SimilarityAl,Ak=0, 2/0 = ∞. The analysis (14) shows that the more similar the dynamic characteristics of two Markov chains are, the greater the similarity value is, which meets the requirement of similarity semantics.


## 3.6. Multi-Markov Chain Model Clustering Method

Based on the above steps, we give a user clustering method based on the multi-Markov chain model.(i)
User clustering steps:(ii)
Input: user learning dataD=d1,d2,…,dm.(iii)
Output: User clustering result.(iv)
Process:(v)
Step l: Use (9) and (10) to map the learning data D into M Markov chains.(vi)
Step 2: Use (11) to (14) to calculate the similarity degree between two Markov chains and arrange them according to the similarity value obtained by calculation from large to small.(vii)
Step 3: According to the preset number of classifications and similarity values, clusterm Markov chains.(viii)
Step 4: According to the corresponding relationship betweenm Markov chains and m users, output the clustering result.


## 3.7. Design of Active Service Push Algorithm

The service push system can be vividly described by a black box. The basic data resources of the pushed object are processed by the black box to obtain the push list, and they will receive service recommendations from the platform at a certain point offline.In the existing service push system, the system that can achieve accurate push has not emerged because each push method only uses a small part of the system information. To achieve the goal of pushing more accurate, higher quality, and higher satisfaction services for service push objects, this paper adopts multilevel and all-round analysis methods to deal with the information acquired in the system, that is, the cluster-service collaborative filtering and mixed push method. Through the clustering analysis of users in the platform, users with the same interest category are classified into one class. Then, the collaborative filtering recommendation algorithm is used to push services to users with the same interest category. Because the evaluation model of “user-service“ for users of the same type is similar, there will not be too many nonevaluation services, which makes the evaluation matrix sparse. This can improve the accuracy of service push. The user clustering analysis method in the mixed push method has been introduced in detail in the previous sections, and the user-based collaborative filtering method will be explained in detail in the following.


## 3.8. User-Based Collaborative Filtering Recommendation Method

Through user clustering, a class of nearest neighbor user sets with similar interest characteristics can be obtained. The services in user sets are all closely related to users. Although the massive service types and quantity at the beginning of push have been reduced through clustering operation, service demanders will still be at a loss when facing a series of untargeted push services if these services are sent to service push objects in no order. In order to reduce the time spent by service demanders to understand each service, the nearest neighbor user set is substituted into the “user-service” evaluation model, which aims to generate a ranking list of services that users may like through this model. Finally, the service push object will receive the push information offline and in some way.


## 3.9. Establishment of “User-Service Evaluation Model”

“User-service evaluation model” is shown as follows. Assuming that there arem users in the nearest neighbor user set and s corresponding service sets, the “user-service” evaluation matrix R is(15)R=u1⋮ui⋮umr1⋯rj⋯rsR11⋯R1j⋯Rs⋮⋮Ri1⋯Rij⋯Ris⋮⋮Rm1⋯Rmj⋯Rms.In (15), UI represents the i th user, Rj represents the j th service, and Rij represents the score of the i th user on the j th service.Rij is a real number ranging from 1 to 5. The higher the value of Rij is, the higher the user satisfaction is. If the user UI does not evaluate the service Rj, the value of Rij is defined as 0. The real-value scoring method is widely spread among service platforms because this scoring mode is more reasonable and detailed, which can greatly reduce the sparsity of “user-service” evaluation matrix R so as to improve the accuracy and satisfaction of service push to the greatest extent.


## 3.10. Similarity between Computing Services

When the “user-service” evaluation matrixR is used to calculate the list of push score values of similar services, cosine similarity value and Person similarity value between services can generally be calculated. However, the Person similarity calculation method is more delicate, and the average operation of subtracting the score value from the overall service score value is used to reduce the impact of different evaluation values on the same service with the same evaluation. The calculation results are more reliable and convincing, so the Person similarity measurement is adopted in this paper.


## 3.11. Person Similarity Measurement Calculation Method

Assuming thatIpq is the set of users who have commented on service rp and rq together in the nearest user set and Rp¯ and Rq¯ are the average ratings of users on service rp and rq, respectively, then the similarity δrp,rq is shown in (16):(16)δrp,rq=∑i∈IpqRip−Rp¯Riq−Rq¯∑i∈IpqRip−Rp¯2∑i∈IpqRiq−Rq¯2.


## 3.12. The Calculation Example of Service Actively Pushes

Calculation example 1: assume that usersu0,u1,u2,u3,u4,u5 are a small group of nearest neighbor users after a clustering, and its user-service evaluation matrix is(17)r1r2r3r4r5R=u0u1u2u3u4u54005055054054035355440430.Among them,R1¯=3.67,R2¯=2.83,R3¯=2.67,R4¯=3.0,R5¯=1.83. The users who jointly commented on service 1 and service 2 are u1,u2,u4, so δr1,r2 can be calculated by the following formula:(18)δr1,r2=∑i∈I12Ri1−R1¯Ri2−R2¯∑i∈I12Ri1−R¯12∑i∈I12Ri2−R¯22=5−3.67×5−2.83+4−3.67×4−2.83+5−3.67×3−2.835−3.672+4−3.672+5−3.672×5−2.832+4−2.832+3−2.832=0.7413.Furthermore, the calculation process ofδr1,r3,δr1,r4,andδr1,r5 is as follows:(19)δr1,r3=4−3.674−2.67+5−3.675−2.67+4−3.674−2.674−3.672+5−3.672+4−3.672×4−2.672+5−2.672+4−2.672=0.9422,δr1,r4=4−3.67×5−3+5−3.67×5−3+5−3.67×5−3+4−3.67×3−34−3.672+5−3.672+v2+4−3.672×5−32+5−32+5−32+0=0.8908,δr1,r5=5−3.67×4−1.83+4−3.67×3−1.83+5−3.67×4−1.835−3.672+4−3.672+5−3.672×4−1.832+3−1.832+4−1.832=0.9819,where δr1,r5>δr1,r3>δr1,r4δr1,r2 is sorted according to the service similarity value. And the active service push list is shown in Table 1.Table 1
Active service push list.
Push sequence sortService typeService evaluation1r5 (service 5)0.98192r3 (service 3)0.94223r4 (service 4)0.89084r2 (service 2)0.7413Therefore, according to the service push data in Table1, if user u0 is the active service push object, service 5 and service 3 will be pushed preferentially.


## 4. Experimental Analysis

### 4.1. Experimental Environment and Data

Experimental data set is a user data resource, which is obtained through the API interface provided by the official platform of China Machinery Network. In this paper, the web crawler software developed by myself crawls more than ten official users selected initially and extends other user data according to these users, realizing layer-by-layer crawler and deep mining. By the time of simulation analysis, about 830 users had been mined and recorded, who posted more than 200,000 SMS messages. In the face of such a large data set involving all aspects of society, it is crucial to correctly identify valid and invalid data. First, the distribution of the amount of text information published by these users is graphically described as follows.As shown in Figure3, the number of SMS messages sent by users is close to 248, and the number of similar users in this range is 478. When fewer than 200 messages were posted, the number of received messages dropped sharply, with the lowest users posting only about six messages. For example, the more detailed the user’s information, the more accurate the classification of the user’s interest characteristics, and vice versa. Therefore, in subsequent experimental tests, users with less information need to be filtered to improve the accuracy of user interest feature classification.Figure 3
Distribution of the amount of published information of the NTH user.


### 4.2. Experimental Evaluation Method

After the implementation of user clustering and service active push operation, this paper adopts the classic mean absolute error (MAE) as the measurement index to evaluate the accuracy of the recommendation system to verify its accuracy. MAE is an effective measure to evaluate the difference between the predicted score and the real score. Its basic idea is to calculate the difference between the predicted score and the real score and absolute value. After the absolute value operation, the evaluation indexes are all positive numbers, which avoids the offset between positive and negative values so as to reflect the deviation of predicted value error from the real score value to the greatest extent. The mathematical formula of MAE is defined as follows:(20)MAE=1N∑Pij−Rij.In (17), N represents the sum of the scores predicted by the test, Pij represents the predicted score value of user i for service j, Rij represents the real score of user i for service j. According to (17), the smaller the MAE value is, the smaller the predicted value error is and the higher the accuracy of recommendation is, and vice versa.


### 4.3. Experimental Analysis

#### 4.3.1. Data Dimension Reduction

Section 3.2 introduces the processing method of interest subject database information and user text information in detail, and we obtain the interest eigenvalue vector of each user. In Section 4.3.2, the multi-Markov chain model is established to convert the eigenvalue vector of each user’s interest into a unique corresponding state transition matrix, whose dimension is 624 × 624. Because each user has a unique Markov chain state transition matrix and the matrix dimension is 624 × 624, the clustering calculation will produce repeated data calculation and data dimension disaster, which will greatly affect the calculation efficiency. To sum up, in order to reduce the server load and improve the efficiency of calculation, this paper needs before the user clustering for all users of the Markov chain state transition matrix PCA (Principal Component Analysis) dimensionality reduction. The advantages of PCA dimension reduction are as follows: (1) data dimension reduction can alleviate dimensional disasters; (2) data dimension reduction can minimize information loss while compressing data; (3) the structure of data after dimensionality reduction is easier to understand through visualization. In short, the operation essence of PCA is to map the original data to the low-latitude numerical space through a series of numerical linear transformations under the premise that the characteristics and attributes of the original data are not damaged as much as possible. Figure4 is the Pareto figure of user state transition matrix.Figure 4
Pareto figure of user state transition matrix.


#### 4.3.2. User Clustering

As described in Section4.2, the accuracy of the user clustering effect in the early stage is directly related to the accuracy of user-service active push in the later stage. The clustering of users with the same or similar interest characteristics can increase the accuracy of the later service’s active push. Therefore, this section mainly discusses the user clustering effects of the two methods. This paper adopts two methods to realize user clustering: (1) enhanced learning method in machine learning to realize user clustering, namely, multi-Markov chain model clustering method introduced in Section 3 (m-MCM clustering); (2) the unsupervised learning method in machine learning that realizes the clustering of users, namely, the classical K-means clustering method, the implementation of which is provided by Weka software. After user data processing, user clustering results are shown in Table 2.Table 2
m-MCM andK-means clustering results.
Categorym-MCMK-meansC_15650C_23539C_39435C_475124C_54340C_62126C_76863C_84043C_96569C_103136C_114045C_122712C_133861C_142529C_154237C_163116C_171830C_182724C_191918C_203534As can be seen from Table2, different clustering methods can obtain different clustering results; that is, there will be some deviation in the amount of clustering for each type of user. However, it is difficult to judge which clustering method has a better clustering effect only based on the data in Table 2. Therefore, Figures 5 and 6 are used to show the clustering situation of the K-means method and the m-MCM method for all users, respectively, so as to better distinguish the clustering effect of the two clustering methods. Note: each colored graph in the figure represents a user, a group of users with the same or similar characteristics of interest.Figure 5
The effect ofK-means user clustering method.Figure 6
The effect of m-MCM means user clustering method.By observing Figures5 and 6, it can be found that the scattered noise points in the two images make the clustering effect picture very messy, and it is difficult to clearly distinguish the distribution of clustering users. These noise points are caused by the users with less published information mentioned in Section 3.10. Because the data of these users are less, it is difficult to accurately identify their interests, so they become noise points in the clustering effect figure. Because of these scattered noise points, it is difficult to distinguish the clustering of users accurately. At the same time, noise points will greatly reduce the accuracy of user clustering and affect the clustering effect. Therefore, noise point denoising is also adopted in this paper; that is, users with less data are deleted in advance. The user clustering effect figure after denoising is shown in Figures 7 and 8.Figure 7
The effect picture ofK-means user clustering method after denoising.Figure 8
The Effect picture of m-MCM user clustering method after denoising.After denoising, Figures7 and 8 show an obvious improvement in user clustering effect compared with Figures 5 and 6 without denoising. Although there are still noise points in Figures 7 and 8, the clustering of users can be distinguished, so the existence of some noise points is acceptable and within the error range. However, through observation, it can be found that there are significant differences in the user clustering effect in Figures 7 and 8. These differences come from the following: (1) In Figures 7 and 8, the clearance between cluster and the cluster is bigger, and it shows that other users have been spun off the accurate segmentation. On the contrary, in Figure 7, the gap between clusters is very small, and some clusters are even closely connected, which makes it difficult for us to determine which cluster these points close to the boundary belong to. Therefore, the m-MCM method has a better user clustering effect than the K-means method in the gap comparison between clusters and families. (2) As shown in Figure 8, within each family, the distance between points is mostly compact. On the contrary, in Figure 7, the distance between points inside each cluster is too scattered, which makes it difficult for us to distinguish some close clusters and determine whether this cluster is an aggregation of one category cluster or multiple category clusters. Therefore, the m-MCM method has a better user clustering effect than the K-means method in terms of gap comparison within clusters. (3) According to the clustering distribution in Figure 8, we can accurately divide the distribution of 20 types of user interest characteristics. On the contrary, according to the clustering effect in Figure 7, we can only roughly distinguish the user clustering distribution of 18 categories, which is a little deviation from the 20 categories of interest subject database that we set in advance.In addition, Figure9 lists the comparison figure of clustering time consuming of K-means method and m-MCM method. The figure shows that the clustering time of the m-MCM method is 3416 seconds, while that of the K-means method is 1431 seconds; that is, the clustering time required by the m-MCM method is about two times that of the K-means method. The m-MCM method is not dominant in the time consumed by clustering because the m-MCM method needs to repeatedly calculate the similarity between two Markov chains corresponding to 830 users in clustering. Therefore, although m-MCM clustering has a good clustering effect, it takes a huge amount of time.Figure 9
Comparison of clustering time betweenK-means method and m-MCM method.To sum up, the m-MCM method is better than theK-means method in the user clustering effect. The m-MCM method can relatively accurately determine the interest category to which users belong and accurately define the boundary between classification and class, but it takes more time. If the m-MCM method is applied to the active push of user service, the accuracy of push can be greatly improved.


### 4.4. Verification of Collaborative Filtering Recommendation Method Based on User Score Clustering

In order to verify the conjecture that the clustering operation in the early stage has a significant impact on the collaborative recommendation in the later stage, a series of simulation experiments are conducted to compare and evaluate the correctness of the conjecture based on the experimental results. Before the beginning of the experiment, the evaluation method of the experiment, data sources, and preprocessing methods should be explained in advance: (1) The evaluation method of the experiment is measured by MAE in Section4.2. The smaller the MAE is, the higher the accuracy of the recommendation is. (2) The experimental evaluation results were measured according to the MAE value of each category. (3) The actual score in the experiment comes from the user’s “user-service” evaluation matrix, while the predicted score is the service score calculated by the “user-service” evaluation model. (4) The scoring data of the experiment is about 160,000 service scoring data of 830 users in the social manufacturing platform. (5) The extended service set shall be considered after user clustering. If the original user does not have this service, the score of the extended service shall be set as 0. If the original user has a score for this service score, it will be added to the “user-service” evaluation matrix according to the original service score. As described in the previous chapter, the better and more accurate the user clustering effect in the early stage, the higher the accuracy of user-service push in the later stage. Therefore, three small experiments are designed in this section to verify this assumption: (1) without user clustering, collaborative filtering recommendation is carried out directly for users; (2) cluster users by K-means method, and then make collaborative filtering recommendation; (3) cluster users using the m-MCM method, and then make collaborative filtering recommendation. Experimental evaluation results are shown in Figure 10.Figure 10
MAE under different clustering methods.Through the analysis of Figure10, the following conclusions can be drawn: (1) MAE value obtained by the nonclustering method is much larger than the MAE value obtained by the clustering method; that is, the accuracy of service push can be greatly improved by clustering users first and then actively pushing service to users. (2) The MAE value obtained by clustering with the m-MCM method is smaller than that obtained by clustering with the K-means method. In other words, different methods of clustering users will result in different accuracy of service push. At the same time, the better the clustering effect, the higher the accuracy of service push. (3) In comparison with MAE values of certain categories, the MAE values obtained by K-means clustering are smaller than those obtained by m-MCM clustering, which indicates that K-means clustering is also advantageous in some fields. If different clustering methods can be reasonably used in different fields to actively push users’ services, in this way, a more precise and active service push effect can be achieved, which also provides a new research idea for future research. (4) As mentioned above, the user clustering takes a quantity, and the m-MCM method of clustering is not dominant. However, the time spent by M-MCM method is almost twice that of K-means method, but in return, the service push accuracy of M-MCM method is also close to twice that of K-means, and higher accuracy of service push will also consume more time. Therefore, these costs are acceptable in terms of time.


## 4.1. Experimental Environment and Data

Experimental data set is a user data resource, which is obtained through the API interface provided by the official platform of China Machinery Network. In this paper, the web crawler software developed by myself crawls more than ten official users selected initially and extends other user data according to these users, realizing layer-by-layer crawler and deep mining. By the time of simulation analysis, about 830 users had been mined and recorded, who posted more than 200,000 SMS messages. In the face of such a large data set involving all aspects of society, it is crucial to correctly identify valid and invalid data. First, the distribution of the amount of text information published by these users is graphically described as follows.As shown in Figure3, the number of SMS messages sent by users is close to 248, and the number of similar users in this range is 478. When fewer than 200 messages were posted, the number of received messages dropped sharply, with the lowest users posting only about six messages. For example, the more detailed the user’s information, the more accurate the classification of the user’s interest characteristics, and vice versa. Therefore, in subsequent experimental tests, users with less information need to be filtered to improve the accuracy of user interest feature classification.Figure 3
Distribution of the amount of published information of the NTH user.


## 4.2. Experimental Evaluation Method

After the implementation of user clustering and service active push operation, this paper adopts the classic mean absolute error (MAE) as the measurement index to evaluate the accuracy of the recommendation system to verify its accuracy. MAE is an effective measure to evaluate the difference between the predicted score and the real score. Its basic idea is to calculate the difference between the predicted score and the real score and absolute value. After the absolute value operation, the evaluation indexes are all positive numbers, which avoids the offset between positive and negative values so as to reflect the deviation of predicted value error from the real score value to the greatest extent. The mathematical formula of MAE is defined as follows:(20)MAE=1N∑Pij−Rij.In (17), N represents the sum of the scores predicted by the test, Pij represents the predicted score value of user i for service j, Rij represents the real score of user i for service j. According to (17), the smaller the MAE value is, the smaller the predicted value error is and the higher the accuracy of recommendation is, and vice versa.


## 4.3. Experimental Analysis

### 4.3.1. Data Dimension Reduction

Section 3.2 introduces the processing method of interest subject database information and user text information in detail, and we obtain the interest eigenvalue vector of each user. In Section 4.3.2, the multi-Markov chain model is established to convert the eigenvalue vector of each user’s interest into a unique corresponding state transition matrix, whose dimension is 624 × 624. Because each user has a unique Markov chain state transition matrix and the matrix dimension is 624 × 624, the clustering calculation will produce repeated data calculation and data dimension disaster, which will greatly affect the calculation efficiency. To sum up, in order to reduce the server load and improve the efficiency of calculation, this paper needs before the user clustering for all users of the Markov chain state transition matrix PCA (Principal Component Analysis) dimensionality reduction. The advantages of PCA dimension reduction are as follows: (1) data dimension reduction can alleviate dimensional disasters; (2) data dimension reduction can minimize information loss while compressing data; (3) the structure of data after dimensionality reduction is easier to understand through visualization. In short, the operation essence of PCA is to map the original data to the low-latitude numerical space through a series of numerical linear transformations under the premise that the characteristics and attributes of the original data are not damaged as much as possible. Figure4 is the Pareto figure of user state transition matrix.Figure 4
Pareto figure of user state transition matrix.


### 4.3.2. User Clustering

As described in Section4.2, the accuracy of the user clustering effect in the early stage is directly related to the accuracy of user-service active push in the later stage. The clustering of users with the same or similar interest characteristics can increase the accuracy of the later service’s active push. Therefore, this section mainly discusses the user clustering effects of the two methods. This paper adopts two methods to realize user clustering: (1) enhanced learning method in machine learning to realize user clustering, namely, multi-Markov chain model clustering method introduced in Section 3 (m-MCM clustering); (2) the unsupervised learning method in machine learning that realizes the clustering of users, namely, the classical K-means clustering method, the implementation of which is provided by Weka software. After user data processing, user clustering results are shown in Table 2.Table 2
m-MCM andK-means clustering results.
Categorym-MCMK-meansC_15650C_23539C_39435C_475124C_54340C_62126C_76863C_84043C_96569C_103136C_114045C_122712C_133861C_142529C_154237C_163116C_171830C_182724C_191918C_203534As can be seen from Table2, different clustering methods can obtain different clustering results; that is, there will be some deviation in the amount of clustering for each type of user. However, it is difficult to judge which clustering method has a better clustering effect only based on the data in Table 2. Therefore, Figures 5 and 6 are used to show the clustering situation of the K-means method and the m-MCM method for all users, respectively, so as to better distinguish the clustering effect of the two clustering methods. Note: each colored graph in the figure represents a user, a group of users with the same or similar characteristics of interest.Figure 5
The effect ofK-means user clustering method.Figure 6
The effect of m-MCM means user clustering method.By observing Figures5 and 6, it can be found that the scattered noise points in the two images make the clustering effect picture very messy, and it is difficult to clearly distinguish the distribution of clustering users. These noise points are caused by the users with less published information mentioned in Section 3.10. Because the data of these users are less, it is difficult to accurately identify their interests, so they become noise points in the clustering effect figure. Because of these scattered noise points, it is difficult to distinguish the clustering of users accurately. At the same time, noise points will greatly reduce the accuracy of user clustering and affect the clustering effect. Therefore, noise point denoising is also adopted in this paper; that is, users with less data are deleted in advance. The user clustering effect figure after denoising is shown in Figures 7 and 8.Figure 7
The effect picture ofK-means user clustering method after denoising.Figure 8
The Effect picture of m-MCM user clustering method after denoising.After denoising, Figures7 and 8 show an obvious improvement in user clustering effect compared with Figures 5 and 6 without denoising. Although there are still noise points in Figures 7 and 8, the clustering of users can be distinguished, so the existence of some noise points is acceptable and within the error range. However, through observation, it can be found that there are significant differences in the user clustering effect in Figures 7 and 8. These differences come from the following: (1) In Figures 7 and 8, the clearance between cluster and the cluster is bigger, and it shows that other users have been spun off the accurate segmentation. On the contrary, in Figure 7, the gap between clusters is very small, and some clusters are even closely connected, which makes it difficult for us to determine which cluster these points close to the boundary belong to. Therefore, the m-MCM method has a better user clustering effect than the K-means method in the gap comparison between clusters and families. (2) As shown in Figure 8, within each family, the distance between points is mostly compact. On the contrary, in Figure 7, the distance between points inside each cluster is too scattered, which makes it difficult for us to distinguish some close clusters and determine whether this cluster is an aggregation of one category cluster or multiple category clusters. Therefore, the m-MCM method has a better user clustering effect than the K-means method in terms of gap comparison within clusters. (3) According to the clustering distribution in Figure 8, we can accurately divide the distribution of 20 types of user interest characteristics. On the contrary, according to the clustering effect in Figure 7, we can only roughly distinguish the user clustering distribution of 18 categories, which is a little deviation from the 20 categories of interest subject database that we set in advance.In addition, Figure9 lists the comparison figure of clustering time consuming of K-means method and m-MCM method. The figure shows that the clustering time of the m-MCM method is 3416 seconds, while that of the K-means method is 1431 seconds; that is, the clustering time required by the m-MCM method is about two times that of the K-means method. The m-MCM method is not dominant in the time consumed by clustering because the m-MCM method needs to repeatedly calculate the similarity between two Markov chains corresponding to 830 users in clustering. Therefore, although m-MCM clustering has a good clustering effect, it takes a huge amount of time.Figure 9
Comparison of clustering time betweenK-means method and m-MCM method.To sum up, the m-MCM method is better than theK-means method in the user clustering effect. The m-MCM method can relatively accurately determine the interest category to which users belong and accurately define the boundary between classification and class, but it takes more time. If the m-MCM method is applied to the active push of user service, the accuracy of push can be greatly improved.


## 4.3.1. Data Dimension Reduction

Section 3.2 introduces the processing method of interest subject database information and user text information in detail, and we obtain the interest eigenvalue vector of each user. In Section 4.3.2, the multi-Markov chain model is established to convert the eigenvalue vector of each user’s interest into a unique corresponding state transition matrix, whose dimension is 624 × 624. Because each user has a unique Markov chain state transition matrix and the matrix dimension is 624 × 624, the clustering calculation will produce repeated data calculation and data dimension disaster, which will greatly affect the calculation efficiency. To sum up, in order to reduce the server load and improve the efficiency of calculation, this paper needs before the user clustering for all users of the Markov chain state transition matrix PCA (Principal Component Analysis) dimensionality reduction. The advantages of PCA dimension reduction are as follows: (1) data dimension reduction can alleviate dimensional disasters; (2) data dimension reduction can minimize information loss while compressing data; (3) the structure of data after dimensionality reduction is easier to understand through visualization. In short, the operation essence of PCA is to map the original data to the low-latitude numerical space through a series of numerical linear transformations under the premise that the characteristics and attributes of the original data are not damaged as much as possible. Figure4 is the Pareto figure of user state transition matrix.Figure 4
Pareto figure of user state transition matrix.


## 4.3.2. User Clustering

As described in Section4.2, the accuracy of the user clustering effect in the early stage is directly related to the accuracy of user-service active push in the later stage. The clustering of users with the same or similar interest characteristics can increase the accuracy of the later service’s active push. Therefore, this section mainly discusses the user clustering effects of the two methods. This paper adopts two methods to realize user clustering: (1) enhanced learning method in machine learning to realize user clustering, namely, multi-Markov chain model clustering method introduced in Section 3 (m-MCM clustering); (2) the unsupervised learning method in machine learning that realizes the clustering of users, namely, the classical K-means clustering method, the implementation of which is provided by Weka software. After user data processing, user clustering results are shown in Table 2.Table 2
m-MCM andK-means clustering results.
Categorym-MCMK-meansC_15650C_23539C_39435C_475124C_54340C_62126C_76863C_84043C_96569C_103136C_114045C_122712C_133861C_142529C_154237C_163116C_171830C_182724C_191918C_203534As can be seen from Table2, different clustering methods can obtain different clustering results; that is, there will be some deviation in the amount of clustering for each type of user. However, it is difficult to judge which clustering method has a better clustering effect only based on the data in Table 2. Therefore, Figures 5 and 6 are used to show the clustering situation of the K-means method and the m-MCM method for all users, respectively, so as to better distinguish the clustering effect of the two clustering methods. Note: each colored graph in the figure represents a user, a group of users with the same or similar characteristics of interest.Figure 5
The effect ofK-means user clustering method.Figure 6
The effect of m-MCM means user clustering method.By observing Figures5 and 6, it can be found that the scattered noise points in the two images make the clustering effect picture very messy, and it is difficult to clearly distinguish the distribution of clustering users. These noise points are caused by the users with less published information mentioned in Section 3.10. Because the data of these users are less, it is difficult to accurately identify their interests, so they become noise points in the clustering effect figure. Because of these scattered noise points, it is difficult to distinguish the clustering of users accurately. At the same time, noise points will greatly reduce the accuracy of user clustering and affect the clustering effect. Therefore, noise point denoising is also adopted in this paper; that is, users with less data are deleted in advance. The user clustering effect figure after denoising is shown in Figures 7 and 8.Figure 7
The effect picture ofK-means user clustering method after denoising.Figure 8
The Effect picture of m-MCM user clustering method after denoising.After denoising, Figures7 and 8 show an obvious improvement in user clustering effect compared with Figures 5 and 6 without denoising. Although there are still noise points in Figures 7 and 8, the clustering of users can be distinguished, so the existence of some noise points is acceptable and within the error range. However, through observation, it can be found that there are significant differences in the user clustering effect in Figures 7 and 8. These differences come from the following: (1) In Figures 7 and 8, the clearance between cluster and the cluster is bigger, and it shows that other users have been spun off the accurate segmentation. On the contrary, in Figure 7, the gap between clusters is very small, and some clusters are even closely connected, which makes it difficult for us to determine which cluster these points close to the boundary belong to. Therefore, the m-MCM method has a better user clustering effect than the K-means method in the gap comparison between clusters and families. (2) As shown in Figure 8, within each family, the distance between points is mostly compact. On the contrary, in Figure 7, the distance between points inside each cluster is too scattered, which makes it difficult for us to distinguish some close clusters and determine whether this cluster is an aggregation of one category cluster or multiple category clusters. Therefore, the m-MCM method has a better user clustering effect than the K-means method in terms of gap comparison within clusters. (3) According to the clustering distribution in Figure 8, we can accurately divide the distribution of 20 types of user interest characteristics. On the contrary, according to the clustering effect in Figure 7, we can only roughly distinguish the user clustering distribution of 18 categories, which is a little deviation from the 20 categories of interest subject database that we set in advance.In addition, Figure9 lists the comparison figure of clustering time consuming of K-means method and m-MCM method. The figure shows that the clustering time of the m-MCM method is 3416 seconds, while that of the K-means method is 1431 seconds; that is, the clustering time required by the m-MCM method is about two times that of the K-means method. The m-MCM method is not dominant in the time consumed by clustering because the m-MCM method needs to repeatedly calculate the similarity between two Markov chains corresponding to 830 users in clustering. Therefore, although m-MCM clustering has a good clustering effect, it takes a huge amount of time.Figure 9
Comparison of clustering time betweenK-means method and m-MCM method.To sum up, the m-MCM method is better than theK-means method in the user clustering effect. The m-MCM method can relatively accurately determine the interest category to which users belong and accurately define the boundary between classification and class, but it takes more time. If the m-MCM method is applied to the active push of user service, the accuracy of push can be greatly improved.


## 4.4. Verification of Collaborative Filtering Recommendation Method Based on User Score Clustering

In order to verify the conjecture that the clustering operation in the early stage has a significant impact on the collaborative recommendation in the later stage, a series of simulation experiments are conducted to compare and evaluate the correctness of the conjecture based on the experimental results. Before the beginning of the experiment, the evaluation method of the experiment, data sources, and preprocessing methods should be explained in advance: (1) The evaluation method of the experiment is measured by MAE in Section4.2. The smaller the MAE is, the higher the accuracy of the recommendation is. (2) The experimental evaluation results were measured according to the MAE value of each category. (3) The actual score in the experiment comes from the user’s “user-service” evaluation matrix, while the predicted score is the service score calculated by the “user-service” evaluation model. (4) The scoring data of the experiment is about 160,000 service scoring data of 830 users in the social manufacturing platform. (5) The extended service set shall be considered after user clustering. If the original user does not have this service, the score of the extended service shall be set as 0. If the original user has a score for this service score, it will be added to the “user-service” evaluation matrix according to the original service score. As described in the previous chapter, the better and more accurate the user clustering effect in the early stage, the higher the accuracy of user-service push in the later stage. Therefore, three small experiments are designed in this section to verify this assumption: (1) without user clustering, collaborative filtering recommendation is carried out directly for users; (2) cluster users by K-means method, and then make collaborative filtering recommendation; (3) cluster users using the m-MCM method, and then make collaborative filtering recommendation. Experimental evaluation results are shown in Figure 10.Figure 10
MAE under different clustering methods.Through the analysis of Figure10, the following conclusions can be drawn: (1) MAE value obtained by the nonclustering method is much larger than the MAE value obtained by the clustering method; that is, the accuracy of service push can be greatly improved by clustering users first and then actively pushing service to users. (2) The MAE value obtained by clustering with the m-MCM method is smaller than that obtained by clustering with the K-means method. In other words, different methods of clustering users will result in different accuracy of service push. At the same time, the better the clustering effect, the higher the accuracy of service push. (3) In comparison with MAE values of certain categories, the MAE values obtained by K-means clustering are smaller than those obtained by m-MCM clustering, which indicates that K-means clustering is also advantageous in some fields. If different clustering methods can be reasonably used in different fields to actively push users’ services, in this way, a more precise and active service push effect can be achieved, which also provides a new research idea for future research. (4) As mentioned above, the user clustering takes a quantity, and the m-MCM method of clustering is not dominant. However, the time spent by M-MCM method is almost twice that of K-means method, but in return, the service push accuracy of M-MCM method is also close to twice that of K-means, and higher accuracy of service push will also consume more time. Therefore, these costs are acceptable in terms of time.


## 5. Summary and Discussion

The experiment in Section 4.2 implements user clustering and active service push. On this basis, the experiment also compares the clustering effect of theK-means method and the m-MCM method, as well as the accuracy of active service push. The experiment draws the following conclusions: (1) Cluster analysis of users before collaborative filtering can greatly improve the accuracy of active service push. (2) Different user clustering methods lead to different active service push. If the user clustering effect is better, the accuracy of the service push will be higher. Through experimental verification, this paper concludes that the clustering effect of the m-MCM method is better than that of the K-means method, and the accuracy of the clustering effect of the m-MCM method is better than the accuracy of service push after K-means method clustering. (3) In the early stage, spending more time on user clustering can improve the accuracy of the cluster, which is of great help to the later active service push. Since this paper constructed the active service push system for the first time, the experiment in Section 4.2 only preliminarily completed the basic architecture of active service push. In the future, the push system should be further updated and improved in the following aspects: (1) Reduce the clustering analysis time in the early stage of the push system and improve the clustering accuracy without reducing the user clustering effect. (2) A combination of multiple clustering methods is adopted to conduct cluster analysis on users so as to improve the speed and accuracy of cluster analysis and lay a good foundation for later service push. (3) The establishment of a more perfect “user-service” evaluation model can more accurately realize personalized service recommendation for users, thus improving the accuracy of service push by users.



---

*Source: 5480015-2022-09-19.xml*