Inference of Latent Network Features via Boolean Intersection Representations of Graphs

We propose a new latent Boolean feature model for complex networks that captures different types of node interactions and network communities. The model is based on a new concept in graph theory, termed the Boolean intersection representation of a graph, which generalizes the notion of an intersection representation. We mostly focus on one form of Boolean intersection, termed cointersection, and describe how to use this representation to deduce node feature sets and their communities. We derive several general bounds on the minimum number of features used in cointersection representations and discuss graph families for which exact cointersection characterizations are possible. Our results also include algorithms for finding optimal and approximately optimal cointersection representation of a graph.

[1]  Norman J. Pullman,et al.  Clique coverings of graphs — A survey , 1983 .

[2]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[3]  J. Orlin.  Contentment in graph theory: Covering graphs with cliques , 1977 .

[4]  Ronald J. Gould,et al.  On p -intersection representations , 1996 .

[5]  Douglas B. West,et al.  Thep-intersection number of a complete bipartite graph and orthogonal double coverings of a clique , 1994, Comb..

[6]  Zoubin Ghahramani,et al.  Modeling Dyadic Data with Binary Latent Factors , 2006, NIPS.

[7]  Charalampos E. Tsourakakis.  Provably Fast Inference of Latent Features from Networks: with Applications to Learning Social Circles and Multilabel Classification , 2015, WWW.

[8]  Tao-Ming Wang,et al.  On uniquely intersectable graphs , 1999, Discret. Math..

[9]  Jure Leskovec,et al.  Modeling Social Networks with Node Attributes using the Multiplicative Attribute Graph Model , 2011, UAI.

[10]  Noga Alon,et al.  Covering graphs by the minimum number of equivalence relations , 1986, Comb..

[11]  Thomas L. Griffiths,et al.  Nonparametric Latent Feature Models for Link Prediction , 2009, NIPS.

[12]  Matti Järvisalo,et al.  Optimal Correlation Clustering via MaxSAT , 2013, 2013 IEEE 13th International Conference on Data Mining Workshops.

[13]  Aristides Gionis,et al.  Overlapping correlation clustering , 2011, 2011 IEEE 11th International Conference on Data Mining.

[14]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[15]  Yechezkel Zalcstein,et al.  Clique Partitions of Chordal Graphs , 1993, Combinatorics, Probability and Computing.

[16]  P. Erdös,et al.  The Representation of a Graph by Set Intersections , 1966, Canadian Journal of Mathematics.

[17]  Fred S. Roberts,et al.  (i, J) Competition Graphs , 1991, Discret. Appl. Math..

[18]  Fred S. Roberts,et al.  Applications of edge coverings by cliques , 1985, Discret. Appl. Math..

[19]  Jure Leskovec,et al.  Community-Affiliation Graph Model for Overlapping Network Community Detection , 2012, 2012 IEEE 12th International Conference on Data Mining.