A Min-max Cut Algorithm for Graph Partitioning and Data Clustering
ICDM '01 Proceedings of the 2001 IEEE International Conference on Data Mining
Introduction to Information Retrieval
Introduction to Information Retrieval
Fully automatic lexicon expansion for domain-oriented sentiment analysis
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Hi-index | 0.00 |
In this paper, we leverage competing viewpoints of the persons mentioned in a set of topic documents. We propose a method to construct a friendship network of the persons and present a graph-partition based multi-polarization algorithm to group the persons into clusters with competing viewpoints.