# A Deep Neural Network-Based Approach to Media Hotspot Discovery

Authors: Pan Luo
Journal: Advances in Multimedia
 (2023)

---

## Abstract

In recent years, with the rapid development of social network media, it has become a valuable research direction to quickly analyze these texts and find out the current hotspots from them in real time. To address this problem, this paper proposes a method to discover current hotspots by combining deep neural networks with text data. First, the text data features are extracted based on the graphical convolutional neural network, and the temporal correlation of numerical information is modeled using gated recurrent units, and the numerical feature vectors are fused with the text feature vectors. Then, the K-means algorithm is optimized for the initial point selection problem, and a clustering algorithm based on the maximum density selection method in the moving range is proposed. Finally, the text feature representation method based on graph convolutional neural network is combined with the clustering algorithm based on the moving range density maximum selection method to build a deep learning-based media hotspot discovery framework. The accuracy of the proposed media hotspot discovery method and the comprehensive evaluation of the computing time have been verified experimentally.


---

## Body

## 1. Introduction

In recent years, social media such as microblogs, Facebook, and other forums have been developing rapidly and have a high usage rate among Internet users, and more and more people are accustomed to using these social media as a medium to obtain various kinds of information and express their opinions and ideas about different events. The Internet has now become the main battleground of online opinion, changing people’s lifestyles and promoting the continuous development of society [1]. Therefore, being able to quickly analyze the data of these new media and dig into the hotspots will help government departments discover hotspots in real time and effectively guide and control them in a timely manner, and promote the implementation of corresponding policies.Social network users follow each other, forming an intricate network structure, and the evolution of information dissemination is also more complex; the data are multidimensional, multisource, and heterogeneous. Existing models are mainly feature-driven and combined with machine learning methods, and it is difficult to fully summarize the factors affecting the heat of events. In addition, the information posted by users in social networks is mainly textual content, however, the value of textual data is sparse and it is difficult to extract potentially valuable information from it, and the textual content changes dynamically over time, so its time-series characteristics should be fully considered.Hotspot discovery methods generally consist of three parts: text data acquisition, hotspot identification, and hotspot discovery. The relationship between them is shown in Figure1. For massive short text-based topic discovery, problems such as NER, high-precision text separation, and key word extraction, semantic dependencies [2] need to be solved, and common methods are based on statistical indicators, word vector representation learning, and language model learning. The problem-specific analysis is needed to model the hot topics from different perspectives.Figure 1
Data processing flow of hotspot discovery method.Spark can use data grouping, distribute multinode parallel computing method, and support the sharing and reuse of datasets by building directed acyclic graphs and storing datasets in memory, which improves the computational efficiency and the performance of big data real-time processing compared with the early Hadoop big data framework, and provides good support in the direction of streaming computing, graph computing, and machine learning [3]. The way Spark handles distributed stored data on HDFS is to build a data structure with RDD as the core, abstract the data, and all operations are performed around RDD. Spark is also a solution widely used in the industry for big data, as it is the master of data processing, and there are many scholars working to improve the performance of various algorithms based on it.The proposed neural network technology provides a more convenient way for people to deal with problems that are no longer limited to the traditional way. The prototype of neural network is a simple three-layer network structure, also known as “perceptron,” and then for a long time, the development of neural network stagnated until the emergence of multilayer perceptron error back propagation algorithm reopened the door for the field. Later, with the increasing computing power of computers and the scaling up of processing problems, the field developed in a vigorous direction and deep learning was studied as a separate branch of artificial intelligence [4]. Among them, convolutional neural networks, recurrent neural networks, and self-encoder models are the main representative models of deep learning and have been successfully applied in a variety of frontier fields.The hotspot discovery methods at home and abroad are mostly to collect the complicated discussion topics or news information on the Internet to form a dataset, and to analyze and process the text of the dataset by building a model, and to mine the hot topics on the Internet through the clustering algorithm. For the selection of datasets, scholars usually use news texts or information posted on microblogging and Twitter platforms as objects. In general, news texts are selected as the dataset for long text research, which has the characteristics of long length, detailed expression, and extensive content; while for short texts as the target of hot topics research, many domestic researchers choose the API interface provided by the microblogging platform to access and obtain information, while foreign researchers use the Twitter platform to access data and do data analysis. Although Weibo and Twitter platforms have only been used by users in recent years, their special features of posting anytime and anywhere, concise text messages, and the fact that anyone can be the publisher and receiver of the messages have made these platforms widely accepted by users, and therefore these platforms are gradually gaining more attention as a new way of academic research. Most scholars have studied hot topics from the selection of language models to the process of text clustering topic discovery.Some researchers have defined events, topics, and other related contents in detail. Social network topics refer to the constituent sets of topic seed events and their related events, and events can also be regarded as fine-grained topics, so that topics and events are interchangeable in some cases [5]. For the event buzz prediction problem, buzz or popularity is usually quantified as some statistical features, such as the number of times people generate user actions after reading a message. Topic buzz can be expressed as statistical values such as the number of user retweets, likes, and comments. Because of the strong correlation of this type of statistics, they are interchangeable and there is no significant difference for statistical feature selection.Both natural language processing technology and text clustering technology have been iterated and progressed with the development of the Internet era, and many products have been born in several derivative fields through the optimization and innovation of algorithms and models. However, to a large extent, the existing research is not particularly mature. For natural language processing, the results of computer processing are not perfect, and there is still a gap between the semantics of human expression; for text clustering, it is necessary to use natural language processing as the basis to realize the conversion of text digitization [6]. Therefore, how to optimize the language model, so that the model can accurately and comprehensively learn the semantics and achieve accurate mining has some research space.Based on the above background and combined with deep neural network, this paper proposes a media hotspot discovery method. Firstly, to address the problem of text data feature extraction, we model the temporal correlation of numerical information using gated recurrent units from the relationship between text information and the number of event retweets in social networks, and fuse the numerical feature vector with the text feature vector. Then, for the K-means algorithm in the initial point selection problem is optimized, and a clustering algorithm based on the maximum density selection method in the moving range is proposed, which solves both the problem of the number of selected points and the difficult problem of the location of the selected points, and the traversal speed is accelerated by using the ring domain range in the density selection. Finally, the fusion features and the improved clustering algorithm are combined to realize the media hotspot discovery method based on deep neural network, and the feasibility of the method is experimentally verified.


## 2. Related Works

### 2.1. Status of Research on Media Hotspot Discovery Methods

Social network media, major forums, portals, and applications that increasingly occupy the main battlefield of online public opinion in the Internet era. These emerging media have a large user base and high user activity, and generate a large amount of text data every day, which have the following characteristics: (1) the popularity of mobile Internet allows users to express their opinions on events anytime and anywhere, with strong real-time, high participation, and rapid information dissemination. (2) Most of the texts have word limits, and Internet buzzwords and various emoticons appear frequently in them, and spelling errors also occur frequently [7]. (3) There are a large number of online water soldiers, who control a large number of marketing accounts and bot accounts, often controlling comments and manipulating the trend of public opinion. (4) Users can follow or be followed by others, and at the same time send out microblogs, twitter, behind which there is a complex social network. (5) Hotspots change rapidly. Many hotspots last for a short period of one to two days or even one to two hours afterwards.Obviously, the emerging media has emerging characteristics, and there are many key points for research, while the traditional topic detection methods focus on the long text, which is a more standardized and informative corpus, and it is difficult to be fully applied to the emerging media text, so the social network media hotspot mining algorithm needs to solve some of the abovementioned problems from the massive text of social network media, according to its unique characteristics, on demand [8]. Therefore, the social media hot topics mining algorithm needs to extract the topics that are being discussed by users or media parties according to their unique characteristics.The validity and accuracy of the media hot topic measure will greatly affect the results of hot topic detection. A more accurate topic heat metric model can measure more accurate hot topics, otherwise the hot topics obtained are easily mixed and difficult to achieve the set detection target [9]. We also get the heat index of a fresh topic based on the change in the frequency of keywords appearing in a topic in the past time window.The hotness value of a topic is measured by considering the user interaction behavior of likes, favorites, retweets, and comments. By calculating the hotness value, the topic is given a hotness score and some topics with low hotness value are quickly filtered out by using the means of statistical rules [10]. In some scenarios, some topics will always be very hot, such as in the game environment, for a certain daily task, which would have been the focus of discussion among players, but very often, we need to pay more attention to some topics that were originally very low in popularity, but suddenly jumped to a higher level of heat, although this heat may not be as high as some daily topics, but it is a topic that we would like to know in time. The topics we want to know more about.In order to more deeply explore the topic of the heat, but also to introduce other characteristics of dimensions, such as the amount and importance of information carried by the information involved in the discussion, the number of participants in the topic, in addition to the breadth of the spread of the topic, the strength of the discussion and other comprehensive consideration, if a topic in the whole topic set the higher the frequency, the more the number of discussions, the more quality of information, the greater its influence, the higher the heat is naturally. We can use the number of topic discussions, the number of related original texts, and the number of high-quality user participation to measure the importance of the topic and its hotness weight. Media hotspot detection and tracking is an important direction of text mining, aiming to help people cope with the problem of information overload [11]. The current common hotspot discovery algorithms are divided into three main categories.(1)
Algorithms based on statistical learning. The object of statistical learning is data, which abstracts data models by extracting data features, and predicts and analyzes objects based on mathematical formulas and statistical indicators.(2)
Methods based on learning models. For example, probability-based spatial temporal models, wavelet analysis-based graphical models. Some researchers have proposed improved support vector machine models using linear fitting to determine the weights of two kernel functions.(3)
Similarity metric-based approach. In the traditional approach using feature vectors, words are generally considered as an indistinguishable symbol used to compose text.


### 2.2. Status of Research on Hotspot Discovery Models Based on Deep Neural Networks

In terms of media hotspot discovery. There are two mainstream prediction methods: the first one is to analyze the time series of hotspots’ hotness. Some scholars use time signals, combined with user features and microblogging features to predict the possible future hotspots. By establishing seven quantitative index systems for hotspots and performing multiple linear regression on them, some scholars have achieved simple prediction of hotspot ratings [12]. Some scholars have used logistic models to fit the prediction of public opinion hotspots on microblogs and achieved certain results.In general, although there are some practical results in the prediction of hot topics on the Internet, most of the results are not particularly significant, and there is no mature and complete methodology. The reason for this is that most of the current prediction algorithms rely on probability theory, statistics, and time series analysis, and only a few scholars use machine learning algorithms for practical exploration [13]. In reality, communication network is a complex network system with scale-free network topology. The spread of hot topics in social networks is inevitably affected by network topology, group opinion, the number of different levels of user groups, the personal preferences of different levels of users, the properties of topic information and government intervention, and other external factors.In addition to traditional machine learning methods, there are also some deep learning-based methods applied to the hot event discovery problem. Some researchers based on recurrent neural networks have used the time gap of event occurrence as a random variable to predict the event popularity [14]. Then, some researchers learn a single cascaded graph representation based on the global network structure, which combines a bidirectional gated recurrent network with an attention mechanism to predict future prevalence.Besides, there are also scholars who solve the hot event prediction problem by fusing various types of features. Some researchers explore the feature factors affecting the change of popularity in two categories, static and dynamic, and use recurrent neural networks and convolutional neural networks to encode the features based on the characteristics of each of the two categories, respectively, and input the encoded features directly into the fully connected neural network layer after spelling to obtain the active time of the topics with labels. On this basis, some researchers considered feature fusion, using bidirectional gated recurrent units to encode text features and temporal features, and CNN to encode user features; and introducing attention mechanism in each part to obtain feature high-level representation, fusing the above features to effectively achieve classification prediction of social media event popularity [15]. Then, some researchers proposed attention-based deep neural network for the prediction problem of single tweet retweet situation, calculated the similarity between tweets and users’ interests, learned user features and tweet features by convolutional neural network, and combined the above to predict whether the retweeting behavior will occur.


## 2.1. Status of Research on Media Hotspot Discovery Methods

Social network media, major forums, portals, and applications that increasingly occupy the main battlefield of online public opinion in the Internet era. These emerging media have a large user base and high user activity, and generate a large amount of text data every day, which have the following characteristics: (1) the popularity of mobile Internet allows users to express their opinions on events anytime and anywhere, with strong real-time, high participation, and rapid information dissemination. (2) Most of the texts have word limits, and Internet buzzwords and various emoticons appear frequently in them, and spelling errors also occur frequently [7]. (3) There are a large number of online water soldiers, who control a large number of marketing accounts and bot accounts, often controlling comments and manipulating the trend of public opinion. (4) Users can follow or be followed by others, and at the same time send out microblogs, twitter, behind which there is a complex social network. (5) Hotspots change rapidly. Many hotspots last for a short period of one to two days or even one to two hours afterwards.Obviously, the emerging media has emerging characteristics, and there are many key points for research, while the traditional topic detection methods focus on the long text, which is a more standardized and informative corpus, and it is difficult to be fully applied to the emerging media text, so the social network media hotspot mining algorithm needs to solve some of the abovementioned problems from the massive text of social network media, according to its unique characteristics, on demand [8]. Therefore, the social media hot topics mining algorithm needs to extract the topics that are being discussed by users or media parties according to their unique characteristics.The validity and accuracy of the media hot topic measure will greatly affect the results of hot topic detection. A more accurate topic heat metric model can measure more accurate hot topics, otherwise the hot topics obtained are easily mixed and difficult to achieve the set detection target [9]. We also get the heat index of a fresh topic based on the change in the frequency of keywords appearing in a topic in the past time window.The hotness value of a topic is measured by considering the user interaction behavior of likes, favorites, retweets, and comments. By calculating the hotness value, the topic is given a hotness score and some topics with low hotness value are quickly filtered out by using the means of statistical rules [10]. In some scenarios, some topics will always be very hot, such as in the game environment, for a certain daily task, which would have been the focus of discussion among players, but very often, we need to pay more attention to some topics that were originally very low in popularity, but suddenly jumped to a higher level of heat, although this heat may not be as high as some daily topics, but it is a topic that we would like to know in time. The topics we want to know more about.In order to more deeply explore the topic of the heat, but also to introduce other characteristics of dimensions, such as the amount and importance of information carried by the information involved in the discussion, the number of participants in the topic, in addition to the breadth of the spread of the topic, the strength of the discussion and other comprehensive consideration, if a topic in the whole topic set the higher the frequency, the more the number of discussions, the more quality of information, the greater its influence, the higher the heat is naturally. We can use the number of topic discussions, the number of related original texts, and the number of high-quality user participation to measure the importance of the topic and its hotness weight. Media hotspot detection and tracking is an important direction of text mining, aiming to help people cope with the problem of information overload [11]. The current common hotspot discovery algorithms are divided into three main categories.(1)
Algorithms based on statistical learning. The object of statistical learning is data, which abstracts data models by extracting data features, and predicts and analyzes objects based on mathematical formulas and statistical indicators.(2)
Methods based on learning models. For example, probability-based spatial temporal models, wavelet analysis-based graphical models. Some researchers have proposed improved support vector machine models using linear fitting to determine the weights of two kernel functions.(3)
Similarity metric-based approach. In the traditional approach using feature vectors, words are generally considered as an indistinguishable symbol used to compose text.


## 2.2. Status of Research on Hotspot Discovery Models Based on Deep Neural Networks

In terms of media hotspot discovery. There are two mainstream prediction methods: the first one is to analyze the time series of hotspots’ hotness. Some scholars use time signals, combined with user features and microblogging features to predict the possible future hotspots. By establishing seven quantitative index systems for hotspots and performing multiple linear regression on them, some scholars have achieved simple prediction of hotspot ratings [12]. Some scholars have used logistic models to fit the prediction of public opinion hotspots on microblogs and achieved certain results.In general, although there are some practical results in the prediction of hot topics on the Internet, most of the results are not particularly significant, and there is no mature and complete methodology. The reason for this is that most of the current prediction algorithms rely on probability theory, statistics, and time series analysis, and only a few scholars use machine learning algorithms for practical exploration [13]. In reality, communication network is a complex network system with scale-free network topology. The spread of hot topics in social networks is inevitably affected by network topology, group opinion, the number of different levels of user groups, the personal preferences of different levels of users, the properties of topic information and government intervention, and other external factors.In addition to traditional machine learning methods, there are also some deep learning-based methods applied to the hot event discovery problem. Some researchers based on recurrent neural networks have used the time gap of event occurrence as a random variable to predict the event popularity [14]. Then, some researchers learn a single cascaded graph representation based on the global network structure, which combines a bidirectional gated recurrent network with an attention mechanism to predict future prevalence.Besides, there are also scholars who solve the hot event prediction problem by fusing various types of features. Some researchers explore the feature factors affecting the change of popularity in two categories, static and dynamic, and use recurrent neural networks and convolutional neural networks to encode the features based on the characteristics of each of the two categories, respectively, and input the encoded features directly into the fully connected neural network layer after spelling to obtain the active time of the topics with labels. On this basis, some researchers considered feature fusion, using bidirectional gated recurrent units to encode text features and temporal features, and CNN to encode user features; and introducing attention mechanism in each part to obtain feature high-level representation, fusing the above features to effectively achieve classification prediction of social media event popularity [15]. Then, some researchers proposed attention-based deep neural network for the prediction problem of single tweet retweet situation, calculated the similarity between tweets and users’ interests, learned user features and tweet features by convolutional neural network, and combined the above to predict whether the retweeting behavior will occur.


## 3. Algorithm Design

### 3.1. Text Feature Extraction Method Based on Graph Convolutional Neural Network

In this section, the content of the feature-gated dynamic graph convolutional network model will be introduced in detail [16]. The main goal of the model is to extract comprehensive features of text data through event-related social network historical text data, which includes the following three parts: text graph modeling, text feature encoding based on graph convolutional network, and feature-gated encoding. The first part focuses on generating word-pair connected graph structures based on the input text; the second part focuses on encoding graph feature vectors to aggregate neighborhood information by graph convolutional networks; the third part focuses on fully capturing temporal features and semantic information by an improved feature gating coding module.In this section of the model, the input event text data are firstly modeled into a series of graph structures with node embedding. Based on this, a sequential graph convolutional network model based on the graph structure is built to achieve hot event prediction. The overall architecture of the event prediction model based on feature-gated dynamic graph convolutional networks is shown in Figure2.Figure 2
Feature extraction model of text data.The input data are either text related to the event or a temporally sorted series of texts, and all time windows are divided, with each time window corresponding to a single layer of the network structure. For the overall network structure, the social network text data related to the event are collected by first calculating the continuous time from the time of the event. After corresponding processing, the historical text data are constructed into a graph structure, in which the nodes are words or phrases, and two nodes are edged according to the principle of mutual information, thus generating an adjacency matrix, in which each node itself has a pretrained feature vector.Based on the time series, a series of adjacency matrices based on node and edge weights are created to represent each graph. Based on the past historical text, a multiword relationship graph represented by the adjacency matrix can be obtained [17]. The dimensionality of the adjacency matrix is determined by the total number of nodes contained in each graph, while the contiguous edge relationships are based on the degree of cooccurrence of words in the set of documents. The pointwise mutual information (PMI) method based on documents is used to calculate the weights between two words:(1)Ati,j=PMIti,j,PMIti,j>0,0,otherwise.To construct a static graph convolution network, the graph can be operated directly based on the idea of GCN. For each sample, there is only one graph of the static graph and therefore only one adjacency matrix, and the final text feature vector is obtained by aggregating its neighborhood attributes during the convolution process. Given an undirected graph, the static graph is calculated as shown:(2)Ht+1=gA^HlWl+bl,where H is the feature matrix containing the feature vectors of all n nodes.Whent > 0, at time t, the initial feature vectors are combined with the feature vectors encoded by the previous time t − 1 graph convolution in a certain ratio to obtain the spliced text feature vectors that contain temporal information:(3)Hpt=H0Wet+bet.We consider the idea of using the channel attention mechanism to propose a feature gating coding module, which automatically obtains the importance of each feature dimension by squeezing learning, and then boosts the useful features and suppresses the less useful ones according to this importance. The module forms the feature statistics of each dimension of a word through a global average pooling operation, and then processes the feature statistics by an activation function to generate feature summaries, and finally relearns the feature representations of key words by weighting the original spliced features.


### 3.2. Media Hotspot Discovery Model Based on Improved Clustering Method

The clustering algorithm based on the maximum density within moving range selection proposed in this section considers that there is an obvious deficiency at the point selection of the K-means clustering algorithm, and the initial point selection has a great influence on the subsequent K-means clustering effect, so the initial point of the theory should be selected as the point closer to the final cluster center. At the same time, learning from the time-consuming lesson of DBSCAN algorithm, we adopt the way of fast moving fixed points in the range of the ring domain in density selection, which saves time cost. Figure3 shows the architecture of the media hotspot discovery model.Figure 3
Architecture diagram of media hotspot discovery model.Since the traditional K-means algorithm is based on the division of distance, the Euclidean distance is often chosen as the metric for the calculation of distance, and the improved clustering algorithm in this section improves the K-means algorithm at the point selection, and the subsequent calculation is still the same as the K-means algorithm. Therefore, for the two vectors, this paper uses the calculation of the Euclidean distance as follows:(4)di,j=∑k=1wFik−Fjk2.The clustering algorithm based on the maximum density within moving range selection proposed in this section considers that there is an obvious deficiency at the point selection of the K-means clustering algorithm, and the initial point selection has a great influence on the subsequent K-means clustering effect [18].The improved clustering algorithm mainly focuses on the improvement of the initial random point selection mechanism of the K-means clustering algorithm, drawing on the advantages of the DBSCAN clustering algorithm based on density to find the clusters to which they belong, and without the selection of points. The algorithm is described as follows.Step 1. Store the vector text dataset in the matrix Text-Matrix, and calculate the point-to-point distance, and store the intervector distance in the distance list DM.Step 2. Select the vector points that are not marked visited from the random Text-Matrix as the initial pointO.Step 3. Calculate the range density value within the neighborhood rangeS centered on O.Step 4. Iterate through the data points in theO-centered annulus range, calculate the respective points, and find the point with the largest range density value. If there is no other point in the range, the point is considered as a meaningless point.Step 5. Repeat the process of (2) to (5). If in the process of moving to find the highest density point, it overlaps with the previously marked point visited, then skip out of the loop and go to the next random initial point selection.Step 6. Use the points in the list as subsequent K-means initial cluster centers for clustering.


## 3.1. Text Feature Extraction Method Based on Graph Convolutional Neural Network

In this section, the content of the feature-gated dynamic graph convolutional network model will be introduced in detail [16]. The main goal of the model is to extract comprehensive features of text data through event-related social network historical text data, which includes the following three parts: text graph modeling, text feature encoding based on graph convolutional network, and feature-gated encoding. The first part focuses on generating word-pair connected graph structures based on the input text; the second part focuses on encoding graph feature vectors to aggregate neighborhood information by graph convolutional networks; the third part focuses on fully capturing temporal features and semantic information by an improved feature gating coding module.In this section of the model, the input event text data are firstly modeled into a series of graph structures with node embedding. Based on this, a sequential graph convolutional network model based on the graph structure is built to achieve hot event prediction. The overall architecture of the event prediction model based on feature-gated dynamic graph convolutional networks is shown in Figure2.Figure 2
Feature extraction model of text data.The input data are either text related to the event or a temporally sorted series of texts, and all time windows are divided, with each time window corresponding to a single layer of the network structure. For the overall network structure, the social network text data related to the event are collected by first calculating the continuous time from the time of the event. After corresponding processing, the historical text data are constructed into a graph structure, in which the nodes are words or phrases, and two nodes are edged according to the principle of mutual information, thus generating an adjacency matrix, in which each node itself has a pretrained feature vector.Based on the time series, a series of adjacency matrices based on node and edge weights are created to represent each graph. Based on the past historical text, a multiword relationship graph represented by the adjacency matrix can be obtained [17]. The dimensionality of the adjacency matrix is determined by the total number of nodes contained in each graph, while the contiguous edge relationships are based on the degree of cooccurrence of words in the set of documents. The pointwise mutual information (PMI) method based on documents is used to calculate the weights between two words:(1)Ati,j=PMIti,j,PMIti,j>0,0,otherwise.To construct a static graph convolution network, the graph can be operated directly based on the idea of GCN. For each sample, there is only one graph of the static graph and therefore only one adjacency matrix, and the final text feature vector is obtained by aggregating its neighborhood attributes during the convolution process. Given an undirected graph, the static graph is calculated as shown:(2)Ht+1=gA^HlWl+bl,where H is the feature matrix containing the feature vectors of all n nodes.Whent > 0, at time t, the initial feature vectors are combined with the feature vectors encoded by the previous time t − 1 graph convolution in a certain ratio to obtain the spliced text feature vectors that contain temporal information:(3)Hpt=H0Wet+bet.We consider the idea of using the channel attention mechanism to propose a feature gating coding module, which automatically obtains the importance of each feature dimension by squeezing learning, and then boosts the useful features and suppresses the less useful ones according to this importance. The module forms the feature statistics of each dimension of a word through a global average pooling operation, and then processes the feature statistics by an activation function to generate feature summaries, and finally relearns the feature representations of key words by weighting the original spliced features.


## 3.2. Media Hotspot Discovery Model Based on Improved Clustering Method

The clustering algorithm based on the maximum density within moving range selection proposed in this section considers that there is an obvious deficiency at the point selection of the K-means clustering algorithm, and the initial point selection has a great influence on the subsequent K-means clustering effect, so the initial point of the theory should be selected as the point closer to the final cluster center. At the same time, learning from the time-consuming lesson of DBSCAN algorithm, we adopt the way of fast moving fixed points in the range of the ring domain in density selection, which saves time cost. Figure3 shows the architecture of the media hotspot discovery model.Figure 3
Architecture diagram of media hotspot discovery model.Since the traditional K-means algorithm is based on the division of distance, the Euclidean distance is often chosen as the metric for the calculation of distance, and the improved clustering algorithm in this section improves the K-means algorithm at the point selection, and the subsequent calculation is still the same as the K-means algorithm. Therefore, for the two vectors, this paper uses the calculation of the Euclidean distance as follows:(4)di,j=∑k=1wFik−Fjk2.The clustering algorithm based on the maximum density within moving range selection proposed in this section considers that there is an obvious deficiency at the point selection of the K-means clustering algorithm, and the initial point selection has a great influence on the subsequent K-means clustering effect [18].The improved clustering algorithm mainly focuses on the improvement of the initial random point selection mechanism of the K-means clustering algorithm, drawing on the advantages of the DBSCAN clustering algorithm based on density to find the clusters to which they belong, and without the selection of points. The algorithm is described as follows.Step 1. Store the vector text dataset in the matrix Text-Matrix, and calculate the point-to-point distance, and store the intervector distance in the distance list DM.Step 2. Select the vector points that are not marked visited from the random Text-Matrix as the initial pointO.Step 3. Calculate the range density value within the neighborhood rangeS centered on O.Step 4. Iterate through the data points in theO-centered annulus range, calculate the respective points, and find the point with the largest range density value. If there is no other point in the range, the point is considered as a meaningless point.Step 5. Repeat the process of (2) to (5). If in the process of moving to find the highest density point, it overlaps with the previously marked point visited, then skip out of the loop and go to the next random initial point selection.Step 6. Use the points in the list as subsequent K-means initial cluster centers for clustering.


## 4. Experiments

### 4.1. Text Feature Extraction Experiments

This subsection designs comparison experiments based on the dataset Weibo-late-numerical to evaluate the model effects. The proposed model is compared with the following three types of models to investigate the effectiveness of the feature fusion dynamic graph convolutional model. (1) DGCN: This model is the original dynamic graph convolutional network model. (2) FGDGCN: The combined feature-gated graph convolutional network model. (3) TFDE: This model is the temporal numerical feature dynamic coding model. The evaluation indexes include accuracy, precision, recall, andF1 value.From the experimental results in Table1, it can be seen that the experimental results of both datasets are similar and the model features have improved in effectiveness. In the dataset, the accuracy rate and F1 value of the proposed model are 73.28% and 74.66%, respectively. Both are higher than the dynamic graph convolutional network model using only single-class information and the feature-gated dynamic graph convolutional network model. In contrast, the dynamic coding model with time-series numerical features using only numerical features has all the metrics below the average value and the overall effect is low. It can be seen that the feature extraction model based on feature fusion graph convolutional network can make full use of multiple types of information, including text data, numerical data with temporal changes, and fusion of two types of features complement each other and depend on each other, and the model level is richer.Table 1
Experimental results based on the Weibo-late-numerical dataset.
ModelAccuracy (%)Precision (%)Recall (%)F1 (%)TEFD67.8269.8164.4968.37DGCN72.3573.3468.9670.17FGDGCN75.0974.7569.6372.54Ours78.5675.2673.2874.66Second, the effect of the number of days of history on the model was also investigated. The number of days in history refers to the number of days since the event occurred when the text was collected, and the text data collected during that time are used as the input data for the model. Different models were trained using different history days from 1 to 5 days to investigate the effect of different history days on the model. The model accuracy is shown in Figure4. The experimental results show that the more the data used for modeling in the first 5 days of the event, the higher the accuracy of the model, because the more text data contain more semantic information. The more the information obtained by training the model based on more data, the higher the accuracy of the model. However, the magnitude of the change is less significant, probably due to the fact that the frequency of adding social network data decreases the longer the time since the event started.Figure 4
Experimental results of historical days based on Weibo-late-numerical.


### 4.2. Media Hotspot Discovery Experiment

After the clustering algorithm, the cluster core of each cluster can be obtained, and the cluster core is considered to be the highest similarity point within the current cluster. However, the cluster core is not necessarily a certain text, but only a conceptual point. Therefore, we can find the text closest to the cluster center in each cluster and sort each hot text in reverse order according to the number of texts in the cluster, and the text hotness also decreases from top to bottom, and finally forms a list as the hot content.As Table2 shows the influence of the improved clustering algorithm on the accuracy when different values of neighborhood radius are chosen for multiple datasets, it can be seen that not the smaller the neighborhood radius is chosen, the higher the accuracy of clustering effect. The experimental results show that the optimal selection also varies for different datasets. For the 20 Newsgroups dataset, the optimal neighborhood radius of 0.8 achieves the best accuracy of 84.47%, because the number of clusters found at a neighborhood radius of 0.8 is similar to the actual results, while the number of cluster centers found at a neighborhood radius of 0.8 or more is less than the standard, which greatly affects the subsequent clustering results, and therefore, the accuracy decreases significantly. For the AG News dataset, the optimal neighborhood radius of 0.6 achieves the best accuracy of 82.68%, while the Sogou Chinese dataset also reaches the optimal when the neighborhood radius is chosen to be 0.8. According to the analysis of the experimental results, the size of the dataset is inversely proportional to the selection of the neighborhood radius.Table 2
Experimental results of domain radius selection under various datasets.
DatasetRadius of neighborhood0.6 (%)0.7 (%)0.8 (%)0.9 (%)20 newsgroups71.5472.3874.1373.62AG news82.6884.4779.4575.63Sougou70.4273.6576.2875.37In Figure5, the running time of the three clustering algorithms is compared for different data volumes. The K-means algorithm has the best performance in terms of time performance due to the randomized selection of points and a slight slope change in the time spent on clustering iterations in relation to the increased amount of data. The improved clustering algorithm proposed in this paper has a smooth upward trend and performance in terms of data volume versus time, and is close to the running time of K-means in individual data volume cases.Figure 5
Experimental results of running time of various clustering algorithms.


## 4.1. Text Feature Extraction Experiments

This subsection designs comparison experiments based on the dataset Weibo-late-numerical to evaluate the model effects. The proposed model is compared with the following three types of models to investigate the effectiveness of the feature fusion dynamic graph convolutional model. (1) DGCN: This model is the original dynamic graph convolutional network model. (2) FGDGCN: The combined feature-gated graph convolutional network model. (3) TFDE: This model is the temporal numerical feature dynamic coding model. The evaluation indexes include accuracy, precision, recall, andF1 value.From the experimental results in Table1, it can be seen that the experimental results of both datasets are similar and the model features have improved in effectiveness. In the dataset, the accuracy rate and F1 value of the proposed model are 73.28% and 74.66%, respectively. Both are higher than the dynamic graph convolutional network model using only single-class information and the feature-gated dynamic graph convolutional network model. In contrast, the dynamic coding model with time-series numerical features using only numerical features has all the metrics below the average value and the overall effect is low. It can be seen that the feature extraction model based on feature fusion graph convolutional network can make full use of multiple types of information, including text data, numerical data with temporal changes, and fusion of two types of features complement each other and depend on each other, and the model level is richer.Table 1
Experimental results based on the Weibo-late-numerical dataset.
ModelAccuracy (%)Precision (%)Recall (%)F1 (%)TEFD67.8269.8164.4968.37DGCN72.3573.3468.9670.17FGDGCN75.0974.7569.6372.54Ours78.5675.2673.2874.66Second, the effect of the number of days of history on the model was also investigated. The number of days in history refers to the number of days since the event occurred when the text was collected, and the text data collected during that time are used as the input data for the model. Different models were trained using different history days from 1 to 5 days to investigate the effect of different history days on the model. The model accuracy is shown in Figure4. The experimental results show that the more the data used for modeling in the first 5 days of the event, the higher the accuracy of the model, because the more text data contain more semantic information. The more the information obtained by training the model based on more data, the higher the accuracy of the model. However, the magnitude of the change is less significant, probably due to the fact that the frequency of adding social network data decreases the longer the time since the event started.Figure 4
Experimental results of historical days based on Weibo-late-numerical.


## 4.2. Media Hotspot Discovery Experiment

After the clustering algorithm, the cluster core of each cluster can be obtained, and the cluster core is considered to be the highest similarity point within the current cluster. However, the cluster core is not necessarily a certain text, but only a conceptual point. Therefore, we can find the text closest to the cluster center in each cluster and sort each hot text in reverse order according to the number of texts in the cluster, and the text hotness also decreases from top to bottom, and finally forms a list as the hot content.As Table2 shows the influence of the improved clustering algorithm on the accuracy when different values of neighborhood radius are chosen for multiple datasets, it can be seen that not the smaller the neighborhood radius is chosen, the higher the accuracy of clustering effect. The experimental results show that the optimal selection also varies for different datasets. For the 20 Newsgroups dataset, the optimal neighborhood radius of 0.8 achieves the best accuracy of 84.47%, because the number of clusters found at a neighborhood radius of 0.8 is similar to the actual results, while the number of cluster centers found at a neighborhood radius of 0.8 or more is less than the standard, which greatly affects the subsequent clustering results, and therefore, the accuracy decreases significantly. For the AG News dataset, the optimal neighborhood radius of 0.6 achieves the best accuracy of 82.68%, while the Sogou Chinese dataset also reaches the optimal when the neighborhood radius is chosen to be 0.8. According to the analysis of the experimental results, the size of the dataset is inversely proportional to the selection of the neighborhood radius.Table 2
Experimental results of domain radius selection under various datasets.
DatasetRadius of neighborhood0.6 (%)0.7 (%)0.8 (%)0.9 (%)20 newsgroups71.5472.3874.1373.62AG news82.6884.4779.4575.63Sougou70.4273.6576.2875.37In Figure5, the running time of the three clustering algorithms is compared for different data volumes. The K-means algorithm has the best performance in terms of time performance due to the randomized selection of points and a slight slope change in the time spent on clustering iterations in relation to the increased amount of data. The improved clustering algorithm proposed in this paper has a smooth upward trend and performance in terms of data volume versus time, and is close to the running time of K-means in individual data volume cases.Figure 5
Experimental results of running time of various clustering algorithms.


## 5. Conclusion

This paper is for the purpose of obtaining hotspot information through certain technical means for a large amount of media text data. With the study of multifaceted research, we understand the current research status, research means, and shortcomings in the research process in the field of hotspot topics, and this paper proposes a hotspot discovery method based on deep neural networks on this basis. First, for the problem of feature extraction, the numerical features are input into the gated cyclic unit to effectively mine the temporal information in the data, and are spliced and fused with the text feature vector, and the final output feature vector incorporates multiangle information. Then, the clustering algorithm with the maximum density selection in the moving range is proposed by combining the advantageous features of K-means algorithm and DBSCAN algorithm. The algorithm achieves the optimization at the point selection of K-means algorithm, and selects the denser point as the initial target point of K-means by moving autonomously according to the density value. Finally, the hotspot discovery model is constructed by combining the feature extraction method and the improved clustering method, and the experimental results show that the combined performance of the method in this paper is better in terms of accuracy and running time. The next step will be to continue the in-depth research on optimizing the feature extraction model to reduce the time complexity and achieve higher accuracy results in a faster way.



---

*Source: 3438025-2023-02-21.xml*