Tripartite Graph Clustering for Dynamic Sentiment Analysis on Social Media

Abstract

The growing popularity of social media (e.g, Twitter) allows users to easily share information with each other and influence others by expressing their own sentiments on various subjects. In this work, we propose an unsupervised \emph{tri-clustering} framework, which analyzes both user-level and tweet-level sentiments through co-clustering of a tripartite graph. A compelling feature of the proposed framework is that the quality of sentiment clustering of tweets, users, and features can be mutually improved by joint clustering. We further investigate the evolution of user-level sentiments and latent feature vectors in an online framework and devise an efficient online algorithm to sequentially update the clustering of tweets, users and features with newly arrived data. The online framework not only provides better quality of both dynamic user-level and tweet-level sentiment analysis, but also improves the computational and storage efficiency. We verified the effectiveness and efficiency of the proposed approaches on the November 2012 California ballot Twitter data.

A short version is in Proceeding of the 2014 ACM SIGMOD International Conference on Management of data

References in corpus (1)

• Thumbs up? Sentiment Classification using Machine Learning Techniques

Cited by in corpus (8)

• The DARPA Twitter Bot Challenge
• Scalable Link Prediction in Dynamic Networks via Non-Negative Matrix Factorization
• Twitter Sentiment Analysis: Lexicon Method, Machine Learning Method and Their Combination
• Community Detection Across Multiple Social Networks based on Overlapping Users
• Heterogeneous information network model for equipment-standard system
• Label Propagation on K-partite Graphs with Heterophily
• A low discrepancy sequence on graphs
• Representation of functions on big data associated with directed graphs