Mining User Relations from Online Discussions using Sentiment Analysis and Probabilistic Matrix Factorization

Minghui Qiu, Liu Yang, Jing Jiang

Abstract

Traditional social network analysis relies on explicit links like "follows" or "friends." However, in online discussion forums, relationships are often implicit, revealed through shared viewpoints or clashing sentiments. This paper introduces a two-stage pipeline that combines Natural Language Processing (NLP) with Probabilistic Matrix Factorization (PMF) to map these hidden social structures. By treating user opinions as "ratings" in a recommendation-style model, the researchers can accurately predict user relations and detect ideological subgroups even in sparse datasets where direct interactions are rare.

The Challenge of Sparsity

In typical online forums, users interact with only a small fraction of the community—often as low as 13%. This sparsity makes it difficult to determine the relationship between two users who have never replied to one another. Traditional text analysis fails here because there is no direct exchange to analyze. To solve this, the authors propose "filling in the blanks" by leveraging the ideological landscape: if two users share similar views on various topics, they are likely allies, regardless of direct interaction.

Methodology: From Sentiment to Latent Factors

The proposed system operates in two primary stages: Opinion Extraction and Probabilistic Matrix Factorization.

1. Opinion Extraction

First, the system identifies "aspects" (entities like "Obama" or "Tax Cuts") using Stanford NER. It then applies sentiment analysis via a 25,000-word lexicon and specific dependency path rules to determine the polarity of a user's statement. This process generates two sparse matrices: a User-User matrix (direct interactions) and a User-Aspect matrix (opinions on topics).

2. Probabilistic Matrix Factorization (PMF)

Borrowing from recommender system technology, the researchers apply PMF to these matrices. This maps users and aspects into a shared latent factor space. The core assumption is that users with similar latent vectors share viewpoints. This unsupervised model learns underlying patterns without requiring labeled "friend/foe" data.

The probabilistic graphical model for the proposed PMF approach, showing the relationships between users (u), aspects (a), and their observed ratings (r, s).

Experimental Results

The model was evaluated using six discussion threads from sources like Createdebate.com and Wikipedia, covering contentious topics such as abortion and political candidates.

Relation Polarity Prediction

The PMF-based model (PMF-UOM) significantly outperformed baseline methods in predicting whether a user pair was positive or negative. By looking at how users interacted with the broader community and specific topics, the model could infer relationships between users who had never spoken to each other.

Subgroup Detection

The model was also used to cluster users into ideological camps. The "complete" PMF-UOM model, which integrates both user-user and user-aspect data, achieved the highest purity and lowest entropy compared to state-of-the-art methods like DAP. This confirms that topic-based opinions are essential for understanding social ties.

Performance metrics for subgroup detection across different models, showing that PMF-UOM consistently achieves higher Purity and Accuracy while maintaining lower Entropy.

Conclusion and Future Directions

By treating arguments as "items" in a collaborative filtering framework, this research successfully bridges the gap in sparse social data. While the model currently struggles with highly unbalanced datasets (where one sentiment dominates), it provides a robust foundation for mining implicit social networks. Future work may involve better entity normalization (e.g., linking "GOP" to "Republican Party") and incorporating non-opinionated text through topic modeling to further enrich the latent factor space.

Summary updated

Abstract

Advances in sentiment analysis have enabled extraction of user relations implied in online textual exchanges such as forum posts. However, recent studies in this direction only consider direct relation extraction from text. As user interactions can be sparse in online discussions, we propose to apply collaborative filtering through probabilistic matrix factorization to generalize and improve the opinion matrices extracted from forum posts. Experiments with two tasks show that the learned latent factor representation can give good performance on a relation polarity prediction task and improve the performance of a subgroup detection task.
BibTeX
@inproceedings{qiu2013mining,
  author = {Minghui Qiu and Liu Yang and Jing Jiang},
  title = {{Mining User Relations from Online Discussions using Sentiment Analysis and Probabilistic Matrix Factorization}},
  booktitle = {Conference of the North American Chapter of the Association for Computational Linguistics},
  year = {2013},
}
Figure