Detecting subgroups in online discussions by modeling positive and negative relations among participants

EMNLP-CoNLL(2012)

引用 69|浏览50
暂无评分
摘要
A mixture of positive (friendly) and negative (antagonistic) relations exist among users in most social media applications. However, many such applications do not allow users to explicitly express the polarity of their interactions. As a result most research has either ignored negative links or was limited to the few domains where such relations are explicitly expressed (e.g. Epinions trust/distrust). We study text exchanged between users in online communities. We find that the polarity of the links between users can be predicted with high accuracy given the text they exchange. This allows us to build a signed network representation of discussions; where every edge has a sign: positive to denote a friendly relation, or negative to denote an antagonistic relation. We also connect our analysis to social psychology theories of balance. We show that the automatically predicted networks are consistent with those theories. Inspired by that, we present a technique for identifying subgroups in discussions by partitioning singed networks representing them.
更多
查看译文
关键词
antagonistic relation,negative relation,negative link,detecting subgroup,friendly relation,high accuracy,epinions trust,singed network,signed network representation,social psychology theory,online community,social media application,online discussion
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要