Triadic co-clustering of users, issues and sentiments in political tweets

Sefa Şahin Koç, Mert Özer, İsmail Hakkı Toroslu, Hasan Davulcu, Jeremy Jordan

Research output: Contribution to journalArticlepeer-review

8 Scopus citations


Social network data contains many hidden relationships. The most well known is the communities formed by users. Moreover, typical social network data, such as Twitter, can also be interpreted in terms of three-dimensional relationships; namely the users, issues discussed by the users, and terminology chosen by the users in these discussions. In this paper, we propose a new problem to generate co-clusters in these three dimensions simultaneously. There are three major differences between our problem and the standard co-clustering problem definition: a node can be a member of more than one clusters; all the nodes are not necessarily members of some cluster; and edges are signed and cluster are expected to have high density of positive signed edges, and low density of negative signed edges. We apply our method to the tweets of British politicians just before the Brexit referendum. Our motivation is to discover clusters of politicians, issues and the sentimental words politicians use to express their feelings on these issues in their tweets.

Original languageEnglish (US)
Pages (from-to)79-94
Number of pages16
JournalExpert Systems With Applications
StatePublished - Jun 15 2018


  • 3 partite graph
  • Co-clustering
  • Hypergraph
  • Sentiment analysis
  • Social network analysis

ASJC Scopus subject areas

  • Engineering(all)
  • Computer Science Applications
  • Artificial Intelligence


Dive into the research topics of 'Triadic co-clustering of users, issues and sentiments in political tweets'. Together they form a unique fingerprint.

Cite this