SCIFNET: Stance community identification of topic persons using friendship network analysis

Abstract A topic that involves communities with different competing viewpoints or stances is usually reported by a large number of documents. Knowing the association between the persons mentioned in the documents can help readers construct the background knowledge of the topic and comprehend the numerous topic documents more easily. In this paper, we investigate the stance community identification problem where the goal is to cluster important persons mentioned in a set of topic documents into stance-coherent communities. We propose a stance community identification method called SCIFNET, which constructs a friendship network of topic persons from topic documents automatically. Stance community expansion and stance community refinement techniques are designed to identify stance-coherent communities of topic persons in the friendship network and to detect persons who are stance-irrelevant about the topic. The results of experiments based on real-world datasets demonstrate the effectiveness of SCIFNET and show that it outperforms many well-known community detection approaches and clustering algorithms.

[1]  Mark H. Chignell,et al.  A social hypertext model for finding community in blogs , 2006, HYPERTEXT '06.

[2]  Gerald Keller,et al.  Statistics for Management and Economics , 1990 .

[3]  Hiroshi Kanayama,et al.  Fully Automatic Lexicon Expansion for Domain-oriented Sentiment Analysis , 2006, EMNLP.

[4]  Xing-yuan Wang,et al.  Uncovering the overlapping community structure of complex networks by maximal cliques , 2014 .

[5]  Yiming Yang,et al.  Topic Detection and Tracking Pilot Study Final Report , 1998 .

[6]  Xingyuan Wang,et al.  Approximating web communities using subspace decomposition , 2014, Knowl. Based Syst..

[7]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[8]  Randy Goebel,et al.  Local Community Identification in Social Networks , 2009, 2009 International Conference on Advances in Social Network Analysis and Mining.

[9]  Xingyuan Wang,et al.  Detecting overlapping communities by seed community in weighted complex networks , 2013 .

[10]  Xing-yuan Wang,et al.  Overlapping community detection using neighborhood ratio matrix , 2015 .

[11]  F. Y. Wu.  The Potts model , 1982 .

[12]  M E Newman,et al.  Scientific collaboration networks. I. Network construction and fundamental results. , 2001, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Hinrich Schütze,et al.  Introduction to information retrieval , 2008 .

[14]  Inderjit S. Dhillon,et al.  Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion , 2015, IEEE Transactions on Knowledge and Data Engineering.

[15]  Xing-yuan Wang,et al.  Detecting overlapping communities in networks using the maximal sub-graph and the clustering coefficient , 2014 .

[16]  Chien Chin Chen,et al.  An Unsupervised Approach for Person Name Bipolarization Using Principal Component Analysis , 2012, IEEE Transactions on Knowledge and Data Engineering.

[17]  M E J Newman,et al.  Fast algorithm for detecting community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[18]  Xingyuan Wang,et al.  Community detection using local neighborhood in complex networks , 2015 .

[19]  Yun Chi,et al.  Combining link and content for community detection: a discriminative approach , 2009, KDD.

[20]  Jitendra Malik,et al.  Normalized Cuts and Image Segmentation , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[21]  Zellig S. Harris,et al.  Distributional Structure , 1954 .

[22]  Yizhou Sun,et al.  On community outliers and their efficient detection in information networks , 2010, KDD.

[23]  Xing-yuan Wang,et al.  Detecting community structure via the maximal sub-graphs and belonging degrees in complex networks , 2014 .

[24]  Michael L. Littman,et al.  Measuring praise and criticism: Inference of semantic orientation from association , 2003, TOIS.

[25]  Mourad Oussalah,et al.  An automated system for grammatical analysis of Twitter messages. A learning task application , 2016, Knowl. Based Syst..

[26]  Chris H. Q. Ding,et al.  A min-max cut algorithm for graph partitioning and data clustering , 2001, Proceedings 2001 IEEE International Conference on Data Mining.

[27]  Xiaowei Xu,et al.  SCAN: a structural clustering algorithm for networks , 2007, KDD '07.

[28]  Xingyuan Wang,et al.  Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks , 2014 .

[29]  Chien Chin Chen,et al.  Bipolar Person Name Identification of Topic Documents Using Principal Component Analysis , 2010, COLING.

[30]  Chien Chin Chen,et al.  TSCAN: a novel method for topic summarization and content anatomy , 2008, SIGIR '08.

[31]  Randy Goebel,et al.  Detecting Communities in Social Networks Using Max-Min Modularity , 2009, SDM.

[32]  Chien Chin Chen,et al.  TSCAN: A Content Anatomy Approach to Temporal Topic Summarization , 2012, IEEE Transactions on Knowledge and Data Engineering.

[33]  Padhraic Smyth,et al.  A Spectral Clustering Approach To Finding Communities in Graph , 2005, SDM.

[34]  Xingyuan Wang,et al.  Epidemic spreading in time-varying community networks , 2014, Chaos.

[35]  Xingyi Zhang,et al.  Overlapping Community Detection based on Network Decomposition , 2016, Scientific Reports.

[36]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[37]  Johan Bollen,et al.  Co-authorship networks in the digital library research community , 2005, Inf. Process. Manag..

[38]  Malik Magdon-Ismail,et al.  Communities and Balance in Signed Networks: A Spectral Approach , 2012, 2012 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining.

[39]  James Allan,et al.  Finding and linking incidents in news , 2007, CIKM '07.

[40]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[41]  George Kingsley Zipf,et al.  Human behavior and the principle of least effort , 1949 .

[42]  A. Hoffman,et al.  Lower bounds for the partitioning of graphs , 1973 .

[43]  Hamido Fujita,et al.  SoNeR: Social Network Ranker , 2016, Neurocomputing.

[44]  Xing-yuan Wang,et al.  Detecting communities by the core-vertex and intimate degree in complex networks , 2013 .

[45]  Jiming Liu,et al.  Community Mining from Signed Social Networks , 2007, IEEE Transactions on Knowledge and Data Engineering.

[46]  David Barber,et al.  Bayesian reasoning and machine learning , 2012 .

[47]  Ramesh Nallapati,et al.  Event threading within news topics , 2004, CIKM '04.

[48]  Tang Jinhui,et al.  Overlapping community detection based on node location analysis , 2016 .

[49]  Jennifer Widom,et al.  SimRank: a measure of structural-context similarity , 2002, KDD.

[50]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[51]  M. Newman,et al.  Finding community structure in very large networks. , 2004, Physical review. E, Statistical, nonlinear, and soft matter physics.

[52]  Ioannis Antonellis,et al.  Simrank++: query rewriting through link analysis of the clickgraph (poster) , 2007, Proc. VLDB Endow..

[53]  V. Traag,et al.  Community detection in networks with positive and negative links. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[54]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.

[55]  Yiannis Kompatsiaris,et al.  Community detection in Social Media , 2012, Data Mining and Knowledge Discovery.