Social Media Community using Optimized Clustering Algorithm

Abstract

The increasing influence of social media and the enormous participation of users creates new opportunities to study human social behavior along with the capability to analyze a large number of data streams. One of the interesting problems is to differentiate between different kinds of users, for example, users who are leaders and introduce new issues and discussions on social media. Furthermore, positive or negative attitudes can also be inferred from those discussions. Such problems require a formal analysis of social media logs and unit of information that can spread from person to person through the social network. Once the social media data such as user messages are parsed and network relationships are recognized, data mining techniques can be applied to group different types of communities. However, the appropriate granularity of user communities and their behavior is hardly captured by present methods. In this paper, we present a framework for the different task of detecting communities by clustering messages from large streams of social data. Our framework uses a K-Means clustering algorithm along with Genetic algorithm and Optimized Cluster Distance (OCD) method to cluster data. The goal of our proposed framework is twofold that is to overcome the problem of general K-Means for choosing best preliminary centroids using the Genetic algorithm, as well as to amplify the distance between clusters by pairwise clustering using OCD to get an accurate cluster. Various cluster validation metrics are used by us to evaluate the performance of our algorithm. The analysis shows that the proposed method gives better clustering results and provides a different use-case of grouping user communities based on their activities. Our approach is optimized and scalable for real-time clustering of social media data.