Detection of Hot Topic in Tweets Using Modified Density Peak Clustering

Abstract

Tweets based micro blogging is the most widely used social media to share the opinions in terms of short messages. Tweets facilitate business men to release the products based on the user interest which thereby produces more profits to their business. It also helps the government to monitor the public opinion which leads to better policies and standards. The large number of tweets on different topics are shared daily so, there is a need to identify trending topics. This paper proposes a method for automatic detection of hot topics discussed predominantly in social media by aggregating tweets of similar topics into manageable clusters. This produces hot topic detection irrespective of the current user location. A Modified Density Peak Clustering (MDPC) algorithm based hot topic detection is proposed. Local density of traditional Density Peak Clustering (DPC) is redefined by using the gaussian function in the calculation of dc (threshold distance). The traditional DPC considering some random value as dc (threshold distance) this gives a negative impact on the cluster formation thereby return inappropriate clusters. This can be solved by using the MDPC. The MDPC algorithm works by taking the cosine similarity between the tweets as the input and produces clusters of similar tweets. The cluster having a greater number of tweets is considered as hot topic which is frequently discussed by most of the users on twitter. Events 2012 dataset is collected with streaming API. This contains tweets from 2012 to 2016. The dataset consists of 149 target events and 30 million tweets. Experimental result shows that the proposed algorithm performs better than the traditional algorithms such as density peak clustering, K-means clustering, and Spectral clustering. It has produced the accuracy of 97%.

Band Selection via Band Density Prominence Clustering for Hyperspectral Image Classification

“…Compared to DPC-KNN, which empirically determined the value of k, Jiang et al [41] developed a method called G-DPC-KNN to calculate the cutoff distance d c based on the Gini coefficient and then used kNNs to find cluster centers. Most recently, Anandarao and Chellasamy [42] also addressed the issue of the random selection of the cut-off distance parameter, d c , by using the Gini index or Gaussian function to make a valid guess of d c . Unfortunately, the same issue arising from DPC-KNN in how to determine an appropriate value of k for G-DPC-KNN remains challenging.…”

Lifetime of tweets: a statistical analysis

“…The suggested method ranked the top phrases and hashtags in real-time Twitter trends and found the hot topics. By collecting tweets on comparable themes into manageable clusters, a research provided a method for automatically detecting hot topics which were addressed mostly on social media (Anandarao and Chellasamy 2021 ). The authors used modified density peak clustering (MDPC) algorithm for the same.…”