# The Teaching Effect Evaluation Model of University Ideological and Political Theory under the Background of New Media and Big Data

Authors: Jiacheng Liu; Zamira Madina
Journal: Security and Communication Networks
 (2022)

---

## Abstract

This study uses new media technology and big data technology to build a teaching impact assessment model of university ideological and political theory based on new media and big data in order to enhance the effect of ideological and political teaching in colleges and universities. Furthermore, by specifying the instance distribution interval, this work explains the probable probability distribution of all instances of the tuple, ensuring the integrity of the data information of the clustering object and therefore boosting the algorithm’s clustering accuracy. Furthermore, this research constructs an intelligent system frame structure by combining the real teaching requirements of ideology and politics. Finally, from the viewpoints of new media teaching efficiency and teaching impact assessment, this research develops experiments to validate system functionalities. The experimental research results show that the teaching effect evaluation model of university ideological and political theory constructed in this study based on new media and big data has a good teaching effect, and the effect of ideological and political teaching evaluation also meets the actual teaching needs.


---

## Body

## 1. Introduction

With the continuous development of the economy and society and the rapid development of information technology, our learning, living, and working methods are slowly changing. The rapid development of the information age has also profoundly affected the teaching methods of ideological and political education. Both developed and developing countries use various forms to study and explore how to use new media to implement ideological and political teaching [1]. With the continuous progress of ideological and political education reform, the party and the country have further requirements for the informatization of ideological and political education. Moreover, they clearly pointed out that it is necessary to rely on education informatization to promote the modernization of ideological and political education and indeed improve the ideological and political literacy of young people in new media. At the national level, in the past five years, a number of new media plans for ideological and political education have been introduced [2].Most ideological and political instructors use more conventional teaching approaches when it comes to ideological and political education. The ideological and political instructors are the major source of instruction, and they educate in the form of ideological and political courses, with a relatively easy teaching approach. As a result, the ideological and political classroom is lifeless, unable to fully express students’ subjectivity, and lacking in the spirit of inquiry and investigation. The rise of new media affords a number of choices for teaching ideological and political courses in this setting [3].This paper combines big data technology to construct a teaching effect evaluation model of university ideological and political theory and conducts research on the effect of university ideological and political teaching through this model and provides a measurement tool for the subsequent improvement of teaching quality.


## 2. Related Work

The literature [4] referred to “electronic video” as “new media,” from which the concept of new media was born. Nowadays, with the continuous development of digital media in the information age, there are more and more books on new media. The literature [5] proposed that the continuous division of mobile phones interacts with other cells to form a new organism. It is believed that mobile phones are a powerful spark plug that ignites the torch of technological progress and human development. Since then, new media has become a hot topic of the times, and people’s attention to new media has gradually increased. The literature [6] believed that with the emergence of new media the relationship between humans and machines needs to be re-thought. The continuous development of new media has already changed people’s living habits. Moreover, foreign countries are gradually combining new media with education. With the advancement of the Internet age, new media education platforms, including TED open courses, continue to emerge, and the role of new media in education is getting more and more attention and development. In the process of combing the research related to foreign new media, we can draw such a conclusion. First of all, regarding the definition of new media, although there is no accurate conclusion, scholars generally believe that the definition of new media should be defined from the perspective of time development and technological development. Secondly, with regard to the influence of new media, the literature [7] believed that the influence of new media not only brings great changes to human communication activities, but also changes the way people live and socialize. The value provided by new media is not limited to the realm of communication; it has already had an impact on every aspect of society. Finally, the evolution of new media has an impact on the evolution of civic education. Furthermore, most nations have incorporated media literacy education as part of civic or moral education, and new media have been employed in the area of education on a constant basis. However, due to the different social, economic, political, and historical and cultural backgrounds of countries, there are few studies on the effective use of new media in the teaching of ideological and political courses in high schools in foreign academic circles.The media environment has a special impact on contemporary high school ideological and political teaching due to its unique communication channels, presentation methods, and management modes. From the perspective of building an efficient political classroom, the literature [8] summarizes the impact as creating effective teaching situations, breaking the key and difficult points of teaching, improving the goals of emotional attitudes and values, and cultivating students’ innovative ability. From the perspective of classroom application, the literature [9] summarizes the advantages of new media technology as conducive to improving classroom teaching efficiency, conducive to reforming teaching concepts and methods, and conducive to enhancing students’ interest in political learning.Literature [10] summarizes the advantages of the network as time advantages and space advantages and believes that the time resources and space resources of the network should be actively developed and summarized into two major aspects. One includes the use of the speed of the Internet to supplement current affairs knowledge in time, the use of the timeliness of the Internet to introduce the latest materials in a timely manner, the use of the real-time nature of the Internet to quickly obtain feedback information, the use of the practical flexibility of the Internet to extend classroom teaching, and the use of the Internet Virtuality, real-time experience activities. Literature [11] believes that the spatial advantages of the network are helpful to students’ psychology, resource sharing, and home-school cooperation. By analyzing the characteristics of the new media environment and the status quo of the teaching of ideological and political courses in high schools, the opportunities brought by the new media environment to teaching resources can be summarized as follows: the source of educational resources has become open and diversified, and the form of teaching resources has become virtualized. Starting from the teaching process, the teaching process of high school ideological and political courses has increasingly shown the characteristics of combining virtual and real. Literature [12] believes that the use of new media technology can carry out high school political teaching reform; the specific methods include political teaching network, regular teacher demonstration network class, open class, student assessment results resource evaluation and analysis, etc. To better actualize the teaching process of merging virtual and real, new media and new technologies offer teaching approaches such as cloud platforms and online teaching resource libraries [13]. Starting from the characteristics of the new media environment, literature [14] believes that although the new media environment has its advantages, it has an impact on students’ thinking and concepts due to its open and virtual characteristics. The knowledge taught by high school politics teachers is easy to be subverted by the information on the Internet. At the same time, because high school students are in adolescence and have weak discrimination and control ability, they are easy to be misled and denied in the face of bad information.


## 3. New Media Teaching Data Processing Algorithm

The algorithm first builds an interval number model of uncertain tuples to ensure the integrity of the distribution information of uncertain instances and avoid the decrease in accuracy of clustering results due to the loss of data information; then, calculate the interval number boundary distance of uncertain tuples, and compare the relationship between the extreme distance and the threshold. According to the comparison results of the two, the positional relationship between the uncertain tuples is judged, and the neighborhood density of the uncertain tuples is calculated. By comparing with the density threshold, it is judged whether the current tuple can be a core tuple, so as to realize the initial construction of the cluster. Next, the neighbor tuples around the core tuple are continuously merged until the high-density area formed by the core tuple and its neighbors cannot be expanded, and the current cluster construction is completed. Traverse the remaining uncertain tuples in the dataset to ensure that all uncertain tuples can be allocated to appropriate clusters to achieve density clustering of uncertain data [15].Certain data clustering methods are unable to quantify the data information characterising the clustering objects due to the uncertainty of the data. Since it is a consequence, while constructing a clustering algorithm for uncertain data, we must evaluate how the algorithm-related concepts appropriately convey the data’s uncertainty, as this has a direct impact on the algorithm’s ultimate clustering outcome. The IN-DBSCAN algorithm is an extension of the traditional deterministic data clustering algorithm DBSCAN. It first supplements the related description of the uncertainty of data distribution and then redefines the basic concepts in the DBSCAN algorithm from the perspective of data probability distribution, ensuring density clustering [16].Although uncertain objects cannot provide exact values, they can only describe the distribution information of uncertain instances through probability distribution functions, but it is often easy to determine the upper and lower limits of the instances, so the interval number model can be used to describe the uncertainty of the data. The interval number model of the uncertain tuple is based on the center and radius of the interval number to confirm the position information of the uncertain tuple, and the possible probability distribution of all instances of the tuple is described by describing the instance distribution interval to ensure the integrity of the data information of the clustering object, and then improve the clustering accuracy of the algorithm. At the same time, the interval number distance calculation method based on the possible value boundary of the instance can effectively avoid the meaningless distance calculation outside the boundary range, which provides the possibility to simplify the calculation process of the distance between uncertain objects and improve the operating efficiency of the algorithm. In summary, the uncertain data described by the interval number model can help improve the performance of the uncertain data clustering algorithm. Therefore, this article uses interval numbers to describe the instance distribution of uncertain objects [17].For any uncertain tupleXi, the value interval of the uncertain instance xij,pij is xL,xR. Then, the closed interval IXi=xL,xR∈R of the real number set is called the interval number of the uncertain tuple Xi. Among them, xL is the lower limit of the number of intervals IXi, and xR is the upper limit of the number of intervals IXi. If and only if xL=xR, the interval number IXi is an accurate value; that is, the uncertain tuple Xi is a certain data.For the interval numberIXi=xL,xR of any uncertain tuple X, we assume xL=mxi−rxi,xR=mxi+rxi, then mxi=xL+xR/2 is recorded as the center of interval number IXi , and rxi=xR−xL/2 is recorded as the radius of interval number IXi .The interval number Ix is a real number interval on the number line, as shown in Figure1(a). In order to represent uncertain tuples in different dimensions, we need to further expand the concept of interval numbers [18].Figure 1
K-dimensional interval number of uncertain tuple. (a) One-dimensional interval number of uncertain tuple. (b) Two-dimensional interval number of uncertain tuple. (c) Three-dimensional interval number of uncertain tuple.Uncertain tupleXi is given, and the record value of its uncertain instance xij,pij is a k-dimensional vector, denoted as xij=xij1,xij2,...,xijk . The value interval of the value xijk in any dimension in xij is xLk,xRk; then the set of real closed intervals Ixi=xL1,xR1,xL2,xR2,...,xLk,xRk is called the k-dimensional interval number of the uncertain tuple Xi. Among them, xLk is the lower limit of the interval number IXi, which represents the minimum value of xijk in different dimensions. xRk is the upper limit of the interval number IXi, which represents the maximum value of xijk in different dimensions. If and only if xLk=xRk , the uncertain tuple Xi is an exact vector [19].The k-dimensional interval numberIxi=xL1,xR1,xL2,xR2,...,xLk,xRk is given. If there is xLk=mxik−rxik and xRk=mxik+rxik, mXi=mXi1,mXi2,...,mXik|mXik=xLk+xRk/2 is the center of the interval number IXi , and rXi=rXi1,rXi2,...,rXik|rXik=rRk−rLk/2 is the radius of the interval number IXi .The spatial representation of the k-dimensional interval numberIXi of the uncertain tuple is shown in Figure 1(a). When there is k = 2, the interval number IXi is a rectangular area in the plane in the Cartesian coordinate system, as shown in Figure 1(b). When there is k = 3, the interval number IXi is a cube space in the spatial rectangular coordinate system; as shown in Figure 1(c), k is extended to any positive integer n; at this time, Ix is a multidimensional spatial data, expressed as a hyperbox space in the spatial coordinate system.In order to meet the needs of practical problems, researchers have successively proposed a variety of interval number distance calculation formulas. Among them, P-distance and Hausdorff distance are commonly used distance calculation formulas for theoretical research on interval numbers. Their calculation process is as follows [20]:(1)dpa˜,b˜=bL−aLp+bU−aUpp,p≥1,dHa˜,b˜=maxbL−aL,bU−aU,where a˜ and b˜ are two interval numbers, aU and bU represent the lower limit of the interval number, and aL and bL represent the upper limit of the interval number. We can find that these two distance formulas only consider the deviation of the corresponding limit of the interval number. The data in the interval’s distribution information is lost. As a result, the aforementioned method is ineffective for calculating the interval number distance of the uncertain tuple. In addition, based on the expected value and width of the interval number, Bao Yu’e et al. proposed a more general meaning interval number distance formula-EW-type distance; the calculation process is as follows:(2)dEWa˜,b˜=cEa˜−Eb˜p+13Wa˜−Wb˜pp,p≥1.In the formula,Ea˜=aL+aU/2 represents the expected value of a˜, and Wa˜=aU−aL/2 represents the width of a˜. Compared with the P-distance and the Hausdorff distance, the EW-type distance considers the width difference of the interval number and the expected difference of the interval number, which effectively improves the utilization of data information, and the interval number distance is more comprehensive and detailed. The calculation result is more in line with people’s intuitive judgment. However, the data in the default interval of the EW-type distance obeys a uniform distribution, and the EW-type distance cannot provide a satisfactory result for the data of other probability density distributions. Therefore, we need to design a more efficient interval number distance calculation strategy to calculate the distance between uncertain tuples [21].If it is assumed that the one-dimensional interval numbers of any two uncertain tuplesX and X; are Ixi=mxi−rxi,mxi+rxi and Ixj=mxj−rxj,mxj+rxj, respectively; then, the positional relationship between Ixi and Ixj on the real number axis is shown in the four distance states shown in Figure 2: connected state, overlapping state, and containment state. We stipulate that the distance states of the other three interval numbers except for the distance state are non-separation states, and define the distance calculation formulas for Ixi and Ixj . If the distance between the interval numbers Ixi and Ixj is separated, the maximum value of the two distances is dmax=mxi−mxj+rxi+rxj, and the minimum value of the two distances is dmin=mxi−mxj−rxi−rxj. If the distance between the number of intervals Ixi and Ixj is not separated, the maximum value of the two distances is dmax=mxi−mxj+rxi+rxj, and the minimum value of the two distances is 0. Therefore, for any two one-dimensional interval numbers, the distance between them is d=dmin,dmax; among them, there is(3)dmin=mxi−mxj−rxi−rxjmxi−mxj−rxi−rxj>0,0mxi−mxj−rxi−rxj≤0,dmax=mxi−mxj+rxi+rxj,Figure 2
Four positional relationships of interval numbers. (a) Separated state. (b) Overlapped state. (c) Connected state. (d) Contained state.
(a)(b)(c)(d)The distance calculation method is extended to the number of k-dimensional intervals, and the distanceD=Dmin,Dmax between the uncertain tuples can be obtained, where(4)Dmin=∑j=1kdjmin2,Dmax=∑j=1kdjmax2.The above distance formula effectively utilizes the data information contained in the interval number center and radius and calculates the boundary distance between any two uncertain tuples ofk-dimensional interval numbers. However, in the process of clustering, the distance threshold may be between the minimum boundary distance and the maximum boundary distance. At this time, it is necessary to calculate the probability distribution of instances that meet the distance threshold in the interval number of uncertain tuples. Therefore, we define the distance distribution of uncertain tuples as follows [22].Any two uncertain tuplesXi and Xj in the dataset D are given, and the probability Pdxi,xj≤ε that the distance between the two is less than or equal to the distance threshold ε can be expressed as(5)Pdxi,xj≤ε=∑k=1s∑l=1sδdxik,xjl≤ε⋅pik⋅pjt.Formula (5) counts the overall probability that the instance distance in the uncertain tuple is less than the distance threshold. Among them, e is a distance threshold, which is used to judge the distance relationship between two uncertain objects. δdxik,xjl≤ε is a logical judgment function, which is used to judge whether the distance d between the uncertain instances xik,pik and xjl,pjl meets the requirement of the threshold ε. If there is dxik,xjl≤ε , there is δdxik,xjl≤ε=0 ; otherwise, there is δdxik,xjl≤ε=1.This study introduces the IN-DBSCAN algorithm, a novel clustering technique for uncertain data based on the interval number model of doubtful data and the computation method of interval number distance. The IN-DBSCAN method enhances and extends the traditional clustering algorithm DBSCAN to accomplish density clustering of uncertain data due to the benefits of density-based clustering techniques in detecting nonspherical clusters. The main idea of the algorithm is to compare the relationship between the number of neighbors of the object and the density threshold by calculating the neighborhood density of the uncertain object and then merge the surrounding uncertain objects to expand the range of a given cluster and realize the segmentation of high density by low-density points. The basic flow of IN-DBSCAN algorithm is shown as in Figure3 [23].Figure 3
The basic flow of the algorithm.X is an uncertain tuple in data set D. For any uncertain tupleXj in D, the probability that it is located in the neighborhood of Xi (that is, the probability that Xj becomes a neighbor tuple of Xi) is Pdxi,xj≤ε ; then the set of probabilistic neighbors in the ε− neighborhood of Xi can be expressed as(6)PNeighborXi=Xj|Pdxi,xj≤ε>0.Among them,ε is a distance threshold, which represents the range of the neighborhood of Xi, and Pdxi,xj≤ε represents the probability of the distance distribution between the uncertain tuples Xi and Xj.Xi is an uncertain tuple in the dataset D. For any uncertain tuple Xj in D, Pdxi,xj≤ε represents Xj′ ’ s support for Xi, denoted as supportdegreeXi,Xj. Then, the overall support totaldegreeXi of Xi can be defined as(7)totaldegreeXi=∑Xj∈PNelghborXisupportdegreeXi,Xj,=∑Xj∈PNelghborXiPdxi,xj≤ε.The degree of support is a necessary condition for discriminating the core uncertain tuples. A parameter thresholdu is given, which represents the minimum support that a certain uncertainty element composition needs to satisfy as the core uncertainty element group. If there is totaldegreeXi≥μ, Xi is considered a core uncertain tuple.We stipulate thataveragedegreeXi represents the average support of Xi; then there is averagedegreeXi=totaldegreeXi/PNeighborXi. Among them, PNeighborXi represents the number of uncertain tuples in the ε− neighborhood of Xi. If Xi is the core uncertain tuple. Since there is averagedegreeXi≤maxPdxi,xj≤ε≤1, we can draw the conclusion of PNeighborXi≥μ. That is, μ can be considered as the minimum number of neighbor tuples that should be included in the ε− neighborhood of the core uncertain tuple.Xi is an uncertain tuple in the dataset D, then the probability of Xi becoming the core uncertain tuple is pε,μ,DcoreXi, and the calculation process can be expressed as(8)pε,μ,DcoreXi=1−∑A⊆PNeighborXi∏Xj∈A1−PdXi,Xj≤ε∏Xj∈A1−PdXi,Xj≤ε∏PNeighborXiPdXi,Xj≤ε.Among them,A is a subset of PNeighbor (Xi), s is a distance threshold, and u is the minimum number of neighbors that can be contained in the neighborhood of the core uncertain tuple.In the process of calculatingpε,μ,DcoreXi, we did not directly count all possible cases where the number of neighbor tuples in the e-neighborhood of the uncertain tuple X; is greater than or equal to the density threshold u. Instead, we indirectly calculate the probability sum of the case where the number of neighbor tuples in the e-neighborhood is less than the density threshold u, and then perform the inversion operation to obtain the probability that X becomes the core uncertain tuple. At this time, the value of density threshold u is usually very small, the number of adjacent tuples is greater than or equal to the density threshold, and much greater than the number of adjacent tuples and less than the density threshold. The use of indirect calculation methods can effectively reduce the computational complexity, thereby improving the operating efficiency of the algorithm.In order to further optimize the calculation efficiency ofpε,μ,DcoreXi, we sort the uncertain tuples in the PNeighbor(X) set in descending order according to the size of pε,μ,DcoreXi and then query the distance distribution probability of the uth tuple in the set. If there is pε,μ,DcoreXi=1, it means that there must be u neighbor tuples in the neighborhood of X. At this time, X must be the core uncertain tuple, we set pε,μ,DcoreXi=1 directly. If there is PdXi,Xj≤ε<1, we are specifically expanding the calculation of pε,μ,DcoreXi.In the datasetD, any two uncertain tuples Xi and Xj are given, and the directly reachable probability pε,μ,Ddir−reachXi,Xj of X, relative to X, is specified, and the calculation process is as follows:(9)pε,μ,Ddir−reachXi,Xj=pε,μ,D⧹Xjdir−reachXi⋅PdXi,Xj≤ε.Among them,pε,μ,D⧹Xjdir−reachXi represents the probability that the neighborhood of X; contains at least u-1 neighboring tuples in addition to the uncertain tuple X, and PdXi,Xj≤ε represents the probability that the distance between Xi and Xj is less than or equal to the threshold e. These two events are independent of each other and do not affect each other. Therefore, the product of the two probabilities indicates that when the density threshold is u, the uncertainty tuple Xi is the neighbor probability of the core uncertainty tuple Xi with respect to the neighborhood of i.Similar to the DBSCAN algorithm, the quality of the clustering results of the IN-DBSCAN algorithm depends on the value of the neighborhood radiusE and the density threshold MinPts. Under normal circumstances, the parameters and MinPts settings are derived from experience and knowledge, which is difficult to determine. The IN-DBSCAN algorithm is very sensitive to these parameter values, and different values may lead to very different clustering results.A MinPts value is supplied, as seen in Figure4. If the value of z is too big, the noise points may be divided into a single cluster, or data items previously belonging to multiple clusters may be combined. If the value of c is too small, the cluster may be split, and the data objects originally belonging to the same cluster are divided into multiple separate clusters. In the case of a given c value, if the value of MinPts is too large, the number of data objects that meet the core uncertain tuple condition will be reduced, and the uncertain tuples originally belonging to the same cluster are marked as noise points. If the value of MinPts is too small, it will lead to an increase in the number of data objects that meet the core uncertain tuple conditions, and the uncertain tuples that are originally noise points may be divided into a certain cluster. Therefore, how to avoid the manual input of parameters in the IN-DBSCAN algorithm and enable it to automatically input parameters through explicit query to achieve adaptive density clustering of uncertain data is an important problem that we need to solve.Figure 4
Different parameter values lead to different division results of the algorithm. (a) EPS = 2, MinPts = 5, (b) EPS = 6, MinPts = 2.
(a)(b)


## 4. University Ideological and Political Teaching Effect Evaluation Model Based on New Media and Big Data Technology

This study reforms the ideological and political classroom teaching mode, merges the varied evaluation mechanism, and achieves the teaching evaluation aimed at assessing the core competency based on the learning characteristics of college students. With the help of information technology, this paper develops an Internet + classroom teaching platform suitable for college students to provide technical support for the realization of political classroom teaching reforms and the diversified teaching evaluation of “doing what it says”. Figure5 shows the implementation model of ideological and political classroom teaching evaluation.Figure 5
Implementation model diagram of ideological and political multi-evaluation.The Internet + classroom ideological and political teaching platform can be divided into five modules: online resource management, online learning, communication and discussion, diversified evaluation, and system maintenance. According to the needs of each system user for system functions, the five modules can be subdivided into multiple submodules, as shown in Figure6.Figure 6
The overall function module diagram of the system.The HTML5-based Internet + classroom ideological and political new media teaching platform for colleges and universities is a set of Internet + classroom teaching platform based on “pre-class online learning as the forerunner, flipped classroom teaching as the core, online communication and discussion as the auxiliary, and diversified teaching evaluation as the driving force.” The platform linkage relationship is shown in Figure7.Figure 7
The linkage diagram of the ideological and political teaching platform.As a help, the C/S design mode is used in this article. The desktop version of the teaching platform apps may be swiftly generated by encapsulating HTML5 pages, and screen recording, electronic blackboard writing, and automated file uploading features can be added at the same time. The system structure diagram of the platform is shown in Figure8.Figure 8
Schematic diagram of system structure.On the basis of the above analysis, the effect of the teaching effect evaluation model of university ideological and political theory based on new media and big data constructed in this paper is verified. When designing the experiment, this paper mainly starts from the two perspectives of new media teaching efficiency and teaching effect evaluation and obtains the results shown in Table1 and Figure 9.Table 1
Performance verification of teaching effect evaluation model of university ideological and political theory based on new media and big data.
NOTeaching efficiencyTeaching evaluationNOTeaching efficiencyTeaching evaluationNOTeaching efficiencyTeaching evaluation193.081.32181.585.64186.489.9281.183.32281.476.24282.380.6392.480.42388.388.74386.785.2481.876.72486.891.74481.578.3593.485.12585.780.34583.185.5687.987.02690.380.04688.685.1791.490.32792.183.34793.076.7892.289.22885.882.44883.889.2992.479.02988.475.24993.977.11083.186.03093.382.85085.787.41194.078.23184.085.15183.688.51289.985.63289.790.15285.283.91388.690.63385.388.15393.885.91485.780.63483.978.55489.079.01588.579.53585.990.75585.379.51686.078.43689.175.75686.883.71785.983.73792.379.35792.077.01886.581.63885.075.55887.986.81990.185.53990.889.45991.487.02088.285.04081.577.8Figure 9
Statistical diagram of experimental results.The experimental research results show that the teaching effect evaluation model of university ideological and political theory constructed in this paper based on new media and big data has a good teaching effect, and the effect of ideological and political teaching evaluation also meets the actual teaching needs.


## 5. Conclusion

With the rapid development of new media technology and the popularization of applications, college students have become one of the main applications of new media. Students must not only study professional skills in college, but also have high moral character, philosophy, and behaviour habits. Students have lost the original function of new media as a result of inadequate use of new media by professors, and they are unable to fully exploit the influence of new media in the teaching of ideological and political courses. As a result, the study presented in this article on the use of new media in college curriculum teaching may help to enhance and improve current ideological and political education theories, as well as give reference value and guidance for university ideological and political education. In a practical sense, the application of new media in the teaching of ideological and political courses is conducive to improving the ideological and political awareness of college teachers and students. Therefore, mastering reasonable and effective new media tools (such as micro-classes) for ideological and political teaching is conducive to improving the teaching quality of ideological and political courses, increasing students’ interest in ideological and political courses, and making students’ course knowledge learning more solid.



---

*Source: 2404108-2022-05-26.xml*