# Application and Analysis of Artificial Intelligence in College Students’ Career Planning and Employment and Entrepreneurship Information Recommendation

Authors: Hui Zhang; Zhuonan Zheng
Journal: Security and Communication Networks
 (2022)

---

## Abstract

With the arrival of graduation season, the number of graduates is expanding every year, and the employment rate of college students has become one of the data that colleges and universities pay attention to. To improve the employment rate of college students, we should first educate each college student in career planning, so that they can clearly understand their own positioning and future development direction. Career planning can guide students to understand their jobs and analyze their professional fields. Faced with massive employment information, it is also a big problem for college students to search and choose information. In this paper, the personalized recommendation system for entrepreneurship is described, and the basic principles of information recommendation are described. The basic information and personal interest points of college students are represented by feature vectors, which provide a favorable theoretical support for college students’ career planning and employment and entrepreneurship information recommendation. An information recommendation model under deep learning is formed. Finally, the performance of the model under the traditional algorithm and the optimized information recommendation model is evaluated, and the satisfaction of users to this system is scored so as to provide a convenient and quick information recommendation system for college students, thus indirectly improving the employment rate of graduates and providing corresponding solutions to the problem of difficult employment.


---

## Body

## 1. Introduction

In this era of rapid information development, the acquisition of resources is convenient and fast. College students’ career planning is particularly important for their future development, which is a clear plan for their future. College students choose the learning resources and knowledge data they need to plan their future development on the Internet and make a preliminary design of themselves by using the algorithm recommended by the platform [1]. From the perspective of the Internet, this paper analyzes how college students should plan their careers and know themselves correctly from what aspects [2]. The teaching mode is to take online teaching data to reflect on offline teaching, stimulate college students’ awareness of independent career development, set teaching content according to the law of students’ growth process, and carry out teaching activities aiming at cultivating students’ practical ability in the process of exploration [3]. According to the online recruitment information, this paper analyzes the feasibility of career planning of Chinese college students. Taking the major of human resource management as an example, this paper studies the determination of career development path, job quality requirements, and career planning stage of Chinese college students and uses dynamic network recruitment information to adopt the rolling planning method to plan college career [4]. Career planning education strengthens the ideological and political education of college students and enhances the effectiveness, affinity, and appeal of ideological and political education. Finally, it discusses the countermeasures of this education to college students’ career planning [5]. With the continuous expansion of e-commerce, the traditional recommendation system can no longer meet the needs of current data processing. Combined with the recommendation algorithm of big data, a personalized recommendation system of e-commerce platform is constructed [6]. Data collection and processing are carried out in distance education, and gesture recognition of virtual reality is used to recommend educational information in class [7]. On the social platform, the influence of users’ comments on the surrounding environment and active screening and recommendation of information are the basic user activities and services of the social software [8]. In the recommendation of students’ personalized problems in the field of education, this paper puts forward a recommendation algorithm of tacit knowledge points and verifies whether the algorithm is reliable [9]. As for the increasing information and suggestions in the investment market, the portfolio model is optimized by empirical analysis according to different fuzzy information [10]. While enhancing situational awareness, it also brings many challenges to the recommendation of battlefield situation information. In the sorting stage, the situation information in the candidate set is accurately scored and sorted, and finally, the situation information with higher scores is recommended to the commander [11]. In the collaborative filtering algorithm model, users can quickly collect personalized information of users with high accuracy, which can provide a quick way for users to retrieve information [12]. In the aspect of web page design and smart phone, the system of tourism information recommendation needs to aim at the real needs of users, carry out intelligent data screening, and provide the information they want according to their preferences [13]. Label labeling is also based on the recommendation algorithm of the system, which constructs a synonymous label set for collecting synonymous labels under the definition classification, which is the result of applying the cluster seepage method to the existing resources of users [14]. The development of Internet is also important for farmers to obtain information resources. Farmers can plant grains according to accurate agricultural information to meet people’s needs [15]. When recommending information, there will be a lot of mixed, fuzzy, and cross information, which will be fused according to their similarity and recommended to users [16]. There are many incomplete domains in migration learning that will be used in information recommendation systems [17]. Analyze users’ information access history records, extract their whereabouts, label them according to semantic means, and finally search users for information [18]. For the generation of massive data information in the bus card, a comfortable bus route can be recommended to passengers according to their needs. The bus data card can calculate the waiting time, congestion time, and travel time between different bus stops on different bus lines at different times [19]. In the mobile environment, the group system recommendation is carried out considering the preferences of group users, and the recommendation system can also be used for restaurant recommendation according to the preferences of users themselves [20]. On social software, the platform will also recommend people you may know according to your personal information and contacts and recommend friends among users [21]. In business activities, the personalized recommendation system also has an important application value and carries out personalized recommendation of mobile business methods [22]. Between the system and users, a system simulation model of personalized information recommendation is established, the effectiveness of the model and the sensitivity of main influencing parameters are analyzed, and the characteristics and mechanism of information recommendation between the system and users are revealed [23]. Users interact with tags. Based on the tensor decomposition method of the matrix model, especially the pyramid decomposition method, aiming at the high computational complexity of the TD model, a pairwise interactive tensor decomposition method is proposed to optimize it [24]. According to an abstract conceptual method, human preferences are recommended for new information. The recommended items are selected by using conceptual ideas, which is the user’s impression of the items inferred by using label data of free classification [25].


## 2. Personalized Recommendation System

### 2.1. Brief Introduction of the Personalized Recommendation System

The personalized recommendation system has become an important tool to obtain information in this era of information crossing. It screens users’ browsing records and personal information according to big data technology to predict products and information that users may like. This can greatly increase the consumption rate and click rate of customers. Personalized information recommendation needs three parts. The first step is to collect and process the information, analyze the information, and finally use the recommendation algorithm to recommend information to users. The process is shown in Figure1.Figure 1
Information recommendation process.


### 2.2. Types of Information Recommendation

There are many kinds of information recommendation contents, such as entertainment, literature, and combination. Entertainment information recommendation mainly integrates information according to the praise rate and comment rate of entertainment videos that users often click on and establishes a user preference model to recommend videos to users, which also increases users’ liking for apps. Literary information recommendation mainly analyzes information according to the news content and personal information that users usually watch and recommends knowledge information to users according to the analysis of news viewing content of different ages, which can accurately push the news that users want to know and the knowledge sources they want to learn. Combined information recommendation is complex, the information from different sources of users is analyzed and screened, and finally, information integration is carried out through the personalized recommendation algorithm to form different information recommendation models for each user. The information sources of combined information recommendation are more complex, and various algorithms are used to recommend so as to improve the accuracy of user preference information. The general flow of information recommendation content is shown in Figure2.Figure 2
Information content recommendation process.


## 2.1. Brief Introduction of the Personalized Recommendation System

The personalized recommendation system has become an important tool to obtain information in this era of information crossing. It screens users’ browsing records and personal information according to big data technology to predict products and information that users may like. This can greatly increase the consumption rate and click rate of customers. Personalized information recommendation needs three parts. The first step is to collect and process the information, analyze the information, and finally use the recommendation algorithm to recommend information to users. The process is shown in Figure1.Figure 1
Information recommendation process.


## 2.2. Types of Information Recommendation

There are many kinds of information recommendation contents, such as entertainment, literature, and combination. Entertainment information recommendation mainly integrates information according to the praise rate and comment rate of entertainment videos that users often click on and establishes a user preference model to recommend videos to users, which also increases users’ liking for apps. Literary information recommendation mainly analyzes information according to the news content and personal information that users usually watch and recommends knowledge information to users according to the analysis of news viewing content of different ages, which can accurately push the news that users want to know and the knowledge sources they want to learn. Combined information recommendation is complex, the information from different sources of users is analyzed and screened, and finally, information integration is carried out through the personalized recommendation algorithm to form different information recommendation models for each user. The information sources of combined information recommendation are more complex, and various algorithms are used to recommend so as to improve the accuracy of user preference information. The general flow of information recommendation content is shown in Figure2.Figure 2
Information content recommendation process.


## 3. Information Recommendation Algorithms

### 3.1. Employment Recommendation Algorithm for College Students

Collect and filter the user’s information, the information content comes from different directions, and translate the information content into text information, that is, the content recommendation process is as follows.Step 1.
Transform the content. Each feature point of content is converted into vector points of different dimensions of the space vector, assuming that the text information after content conversion isi, xi is content feature point, and yi is weight. The expression for content i is(1)Contenti=x1:y1;x2:y2;…;xi:yi.
The feature points of the content are represented by vectors:(2)Contenti=y1,y2,y3,…yi.Step 2.
Nw is the feature index, and the similarity relationship between content feature points is calculated. Then, different users have different preference models, and the expression is as follows:(3)Ww=∑iNwcontentiNw.
Calculate the similarity of each similarity point of the content:(4)simW,I=cosW⟶,I⟶=W⟶,I⟶W⟶×I⟶.Step 3.
Generate information recommendation results. The information with the highest similarity is integrated and recommended to users.
In order to realize the career planning and employment and entrepreneurship information recommendation of college students, the information distribution model is constructed. Collect personal information from universities and output data sequences of information characteristics:(5)x=x1,x2,x3,…,xi.
Integrate the characteristic points of college students’ personal information, that is, the expression of characteristic quantity is as follows:(6)mx=xi∑i=1wNw⋅yi.
The sampling model of characteristic points of college students’ personal information:(7)mk=mx∑i=1wyink⋅yk.
In the information feature point sampling model,k is the amount of employment information and q is the employment intention index.
Personal information similarities of college students’ employment intentions:(8)simua,ub=∑i∈Iamxmk∑i∈Iarua,i−rua¯2.∑i∈Iarub,i−rub¯2.
The similarity of information recommendation index between different college students is quantified by standard, and the formula is as follows:(9)Ei,j=Ei+Ej=imx+jmka,=imx+jmk2,k<k0,imx+jmk4,k≥k0.
Employment recommendation information is mainly matched according to the interest and hobbies of college students. By correlating the information of college students’ interests and hobbies, the feature extraction model of college students’ interest points is obtained:(10)y=Fx=f1x,f2x,…,fmx.
The distribution expression of the spatial set of information characteristics of college students’ job allocation in different fields:(11)fm=fkfki=1,k=1,2,3,…,m.
According to the interest and hobbies of college students, information screening is carried out to establish ambiguity functions related to their interest:(12)Q=∑k=1mtik,tjk,ni=1,i=j,0,i≠j.
Construct the distribution model of college students' employment interest characteristics:(13)PU|α=∏i=1mniUi|0,α,PV|α=∏j=1mniVj|0,α.


### 3.2. Career Planning Algorithm for College Students

College students build their own career plans according to their majors and their hobbies and fuse the characteristic points of information to obtain an adaptive learning weight calculation formula:(14)WkU=α1m∑i=1m∑ri,j∑rk+ri,j^,WkV=α1n∑i=1n∑ri,j∑rk+ri,j^.If all the interest points of college students are counted and made into their career planning book, their interest points meet the expression:(15)maxi,j,m,n∑α∈ri∑α∈rj∑α∈rm∑α∈nαxi,j,m,nVn.The self-adaptive function of dividing the group size of college students in different professional fields is as follows:(16)Wk=WkU1−WkVk−1.The deep learning method is used to search the job requirements and interest feature points of universities, and the ambiguity function of the search is as follows:(17)Ek=∑k=0∞1−Wkk.Average number of time slots under the deep learning method:(18)T=Ekni=L1−1/nm−1.Interest matching function under the deep learning method:(19)Ecvc1,c2=u∗lengthc+v∗areainsidec+λ1∫insidecI−c12+λ2∫outsidecI−c22.To sum up, the learning model of college students’ career planning and employment information recommendation is(20)C=MinmaxCi,∑j=1nMj=1,∀i∈1,n,∀j∈1,m.Optimal matching iterative representation of college students’ interest feature points under deep learning model:(21)xik+1=xik+αxik−xjkxik−xjk.Finally, the satisfaction results of college students on career planning and employment information recommendation formed under the information analysis of big data:(22)FMj,i=w˜ki∗αMj,i+w˜k−1i∗1−αMj,i.


## 3.1. Employment Recommendation Algorithm for College Students

Collect and filter the user’s information, the information content comes from different directions, and translate the information content into text information, that is, the content recommendation process is as follows.Step 1.
Transform the content. Each feature point of content is converted into vector points of different dimensions of the space vector, assuming that the text information after content conversion isi, xi is content feature point, and yi is weight. The expression for content i is(1)Contenti=x1:y1;x2:y2;…;xi:yi.
The feature points of the content are represented by vectors:(2)Contenti=y1,y2,y3,…yi.Step 2.
Nw is the feature index, and the similarity relationship between content feature points is calculated. Then, different users have different preference models, and the expression is as follows:(3)Ww=∑iNwcontentiNw.
Calculate the similarity of each similarity point of the content:(4)simW,I=cosW⟶,I⟶=W⟶,I⟶W⟶×I⟶.Step 3.
Generate information recommendation results. The information with the highest similarity is integrated and recommended to users.
In order to realize the career planning and employment and entrepreneurship information recommendation of college students, the information distribution model is constructed. Collect personal information from universities and output data sequences of information characteristics:(5)x=x1,x2,x3,…,xi.
Integrate the characteristic points of college students’ personal information, that is, the expression of characteristic quantity is as follows:(6)mx=xi∑i=1wNw⋅yi.
The sampling model of characteristic points of college students’ personal information:(7)mk=mx∑i=1wyink⋅yk.
In the information feature point sampling model,k is the amount of employment information and q is the employment intention index.
Personal information similarities of college students’ employment intentions:(8)simua,ub=∑i∈Iamxmk∑i∈Iarua,i−rua¯2.∑i∈Iarub,i−rub¯2.
The similarity of information recommendation index between different college students is quantified by standard, and the formula is as follows:(9)Ei,j=Ei+Ej=imx+jmka,=imx+jmk2,k<k0,imx+jmk4,k≥k0.
Employment recommendation information is mainly matched according to the interest and hobbies of college students. By correlating the information of college students’ interests and hobbies, the feature extraction model of college students’ interest points is obtained:(10)y=Fx=f1x,f2x,…,fmx.
The distribution expression of the spatial set of information characteristics of college students’ job allocation in different fields:(11)fm=fkfki=1,k=1,2,3,…,m.
According to the interest and hobbies of college students, information screening is carried out to establish ambiguity functions related to their interest:(12)Q=∑k=1mtik,tjk,ni=1,i=j,0,i≠j.
Construct the distribution model of college students' employment interest characteristics:(13)PU|α=∏i=1mniUi|0,α,PV|α=∏j=1mniVj|0,α.


## 3.2. Career Planning Algorithm for College Students

College students build their own career plans according to their majors and their hobbies and fuse the characteristic points of information to obtain an adaptive learning weight calculation formula:(14)WkU=α1m∑i=1m∑ri,j∑rk+ri,j^,WkV=α1n∑i=1n∑ri,j∑rk+ri,j^.If all the interest points of college students are counted and made into their career planning book, their interest points meet the expression:(15)maxi,j,m,n∑α∈ri∑α∈rj∑α∈rm∑α∈nαxi,j,m,nVn.The self-adaptive function of dividing the group size of college students in different professional fields is as follows:(16)Wk=WkU1−WkVk−1.The deep learning method is used to search the job requirements and interest feature points of universities, and the ambiguity function of the search is as follows:(17)Ek=∑k=0∞1−Wkk.Average number of time slots under the deep learning method:(18)T=Ekni=L1−1/nm−1.Interest matching function under the deep learning method:(19)Ecvc1,c2=u∗lengthc+v∗areainsidec+λ1∫insidecI−c12+λ2∫outsidecI−c22.To sum up, the learning model of college students’ career planning and employment information recommendation is(20)C=MinmaxCi,∑j=1nMj=1,∀i∈1,n,∀j∈1,m.Optimal matching iterative representation of college students’ interest feature points under deep learning model:(21)xik+1=xik+αxik−xjkxik−xjk.Finally, the satisfaction results of college students on career planning and employment information recommendation formed under the information analysis of big data:(22)FMj,i=w˜ki∗αMj,i+w˜k−1i∗1−αMj,i.


## 4. Experimental Analyses

### 4.1. Simulation Experiment

According to the employment data statistics of fresh graduates in 2022, the traditional algorithm model and deep learning algorithm are used to match the interest characteristics of college students, and their accuracy and time-cost calculated by the employment recommendation model are compared. As shown in Figures3 and 4, the relevant parameters are set as follows: the feature scale dataset of user interest points is Q = 500, the fuzzy matching coefficients of interest points are c1  = 0.34 and c2  = 0.32, the distribution coefficient of personalized preference features is cr  = 2, the prediction coefficient of recommendation model is μ1=μ2=0.01, and the total iteration times are 140.Figure 3
Comparison of interest matching accuracy.Figure 4
Time-cost comparison of models.


### 4.2. Functional Testing

This system is mainly aimed at college students’ career planning customization and employment information recommendation services. The following is a test of the functions of each module for the employment information of college students to test whether these functions can be accurately realized and how the running results are. The statistical information is shown in Table1.Table 1
Test module and method.
Test modelMethodJudgment criterionRegister/loginPerform multiple registration/login testsCan you succeed?Modify personal informationSubmit after adding/modifying informationIs personal information in the database?Online recommendationModify personal information viewing resultsCan you update it in real time?Satisfaction degree of recommended informationSatisfaction ratingCan you score?


### 4.3. Performance Testing

Excellent performance is necessary for any information recommendation system. If the performance of the system is too poor, users will have a bad experience, and users will also reduce the use of the recommendation system. Four nodes of the recommendation system are tested. The total number of employment information databases is about 2,000. The relationship between recommendation information response and the number of nodes and employment information is shown in Figures5 and 6.Figure 5
Relationship between corresponding time and node.Figure 6
Relationship between corresponding time and employment quantity.Statistics of time and cost information of recommendation information model is shown in Table2.Table 2
Information corresponding time of different nodes in the information recommendation algorithm model.
Number of nodesNumber of users40608010012014016018024.34.54.44.74.14.34.54.433.13.43.83.53.23.73.33.642.42.72.32.52.82.33.62.1The time-cost of recommendation information response and the number of employment information are counted as shown in Table3.Table 3
Corresponding time of information with different employment quantities in the information recommendation algorithm model.
Number of usersAmount of employment information4008001200160020001001.21.51.92.12.82002.22.43.84.54.83003.44.54.85.25.5


### 4.4. Contrast Experiment

Information screening and fusion under big data analysis, in order to compare the information recommendation system under big data analysis in many aspects, is employment information recommendation and career planning under artificial intelligence better? We make a comprehensive performance comparison of the employment information recommendation model, and the data are shown in Table4 and Figure 7.Table 4
Performance comparison of the artificial intelligence employment information recommendation model.
ModelAccuracy (%)Recall (%)F1 (%)MAE (%)ROC (%)BP98.9989.9778.2510.8787.63Traditional algorithm76.8465.4354.7253.4875.49Figure 7
Performance comparison of the artificial intelligence employment information recommendation model.In order to intuitively see the applicability of the employment recommendation system to college students, we systematically score the per capita satisfaction of college students who have used the information recommendation system and compare the recommendation system using the algorithm model under deep learning with the traditional algorithm model, respectively. The experimental data are shown in Table5.Table 5
Satisfaction score data table.
Scoring pointModelDeep learning model (%)Traditional model (%)5 scoring points per capita3.765.610 scoring points per capita77.923.715 scoring points per capita18.410.7Users carry out quality analysis and research on the information recommendation scoring points of the system and its evaluation standard MAE. The correlation between the per capita scoring points and MAE performance evaluation indicators is shown in Figure8.Figure 8
Linear relationship between number of users and MAE.


## 4.1. Simulation Experiment

According to the employment data statistics of fresh graduates in 2022, the traditional algorithm model and deep learning algorithm are used to match the interest characteristics of college students, and their accuracy and time-cost calculated by the employment recommendation model are compared. As shown in Figures3 and 4, the relevant parameters are set as follows: the feature scale dataset of user interest points is Q = 500, the fuzzy matching coefficients of interest points are c1  = 0.34 and c2  = 0.32, the distribution coefficient of personalized preference features is cr  = 2, the prediction coefficient of recommendation model is μ1=μ2=0.01, and the total iteration times are 140.Figure 3
Comparison of interest matching accuracy.Figure 4
Time-cost comparison of models.


## 4.2. Functional Testing

This system is mainly aimed at college students’ career planning customization and employment information recommendation services. The following is a test of the functions of each module for the employment information of college students to test whether these functions can be accurately realized and how the running results are. The statistical information is shown in Table1.Table 1
Test module and method.
Test modelMethodJudgment criterionRegister/loginPerform multiple registration/login testsCan you succeed?Modify personal informationSubmit after adding/modifying informationIs personal information in the database?Online recommendationModify personal information viewing resultsCan you update it in real time?Satisfaction degree of recommended informationSatisfaction ratingCan you score?


## 4.3. Performance Testing

Excellent performance is necessary for any information recommendation system. If the performance of the system is too poor, users will have a bad experience, and users will also reduce the use of the recommendation system. Four nodes of the recommendation system are tested. The total number of employment information databases is about 2,000. The relationship between recommendation information response and the number of nodes and employment information is shown in Figures5 and 6.Figure 5
Relationship between corresponding time and node.Figure 6
Relationship between corresponding time and employment quantity.Statistics of time and cost information of recommendation information model is shown in Table2.Table 2
Information corresponding time of different nodes in the information recommendation algorithm model.
Number of nodesNumber of users40608010012014016018024.34.54.44.74.14.34.54.433.13.43.83.53.23.73.33.642.42.72.32.52.82.33.62.1The time-cost of recommendation information response and the number of employment information are counted as shown in Table3.Table 3
Corresponding time of information with different employment quantities in the information recommendation algorithm model.
Number of usersAmount of employment information4008001200160020001001.21.51.92.12.82002.22.43.84.54.83003.44.54.85.25.5


## 4.4. Contrast Experiment

Information screening and fusion under big data analysis, in order to compare the information recommendation system under big data analysis in many aspects, is employment information recommendation and career planning under artificial intelligence better? We make a comprehensive performance comparison of the employment information recommendation model, and the data are shown in Table4 and Figure 7.Table 4
Performance comparison of the artificial intelligence employment information recommendation model.
ModelAccuracy (%)Recall (%)F1 (%)MAE (%)ROC (%)BP98.9989.9778.2510.8787.63Traditional algorithm76.8465.4354.7253.4875.49Figure 7
Performance comparison of the artificial intelligence employment information recommendation model.In order to intuitively see the applicability of the employment recommendation system to college students, we systematically score the per capita satisfaction of college students who have used the information recommendation system and compare the recommendation system using the algorithm model under deep learning with the traditional algorithm model, respectively. The experimental data are shown in Table5.Table 5
Satisfaction score data table.
Scoring pointModelDeep learning model (%)Traditional model (%)5 scoring points per capita3.765.610 scoring points per capita77.923.715 scoring points per capita18.410.7Users carry out quality analysis and research on the information recommendation scoring points of the system and its evaluation standard MAE. The correlation between the per capita scoring points and MAE performance evaluation indicators is shown in Figure8.Figure 8
Linear relationship between number of users and MAE.


## 5. Conclusion

Our daily life is full of our personal information all the time, and the processing of data information is also the service action of our intelligent society for people’s social activities. Using artificial intelligence technology, large-scale data such as college students’ personal information, intended positions, and their own interest intentions are integrated and analyzed and finally provided to clients with corresponding needs and the same interest points. The research results of this paper are as follows:(1)
The starting point of employment and entrepreneurship information recommendation algorithm is to build the recommendation strategy algorithm model through the basic personal information and interest feature points of users(2)
Combined with the information recommendation model under deep learning, the information and users’ needs can achieve an optimal matching mechanism, which greatly improves the accuracy of information recommendation and forms a good information retrieval experience for users(3)
Taking the corresponding time of the model as the performance evaluation index of the information recommendation system, the optimized algorithm model can improve the accuracy of information recommendation(4)
According to the user satisfaction score and the MAE value of the model, we can further see the feasibility of the information recommendation model for employment and entrepreneurship information recommendation and career planning



---

*Source: 8073232-2022-09-13.xml*