Distance-Based Community Search (Invited Talk Extended Abstract)

Suppose we have identified a set of subjects in a terrorist network suspected of organizing an attack. Which other subjects, likely to be involved, should we keep under control? Similarly, given a set of patients infected with a viral disease, which other people should we monitor? Given a set of companies trading anomalously on the stock market: is there any connection among them that could explain the anomaly? Given a set of proteins of interest, which other proteins participate in pathways with them? Given a set of users in a social network that clicked an ad, to which other users (by the principle of “homophily”) should the same ad be shown?

[1]  Mona Singh,et al.  Toward the dynamic interactome: it's about time , 2010, Briefings Bioinform..

[2]  V Latora,et al.  Efficient behavior of small-world networks. , 2001, Physical review letters.

[3]  Gueorgi Kossinets,et al.  Empirical Analysis of an Evolving Social Network , 2006, Science.

[4]  Steven B. Andrews,et al.  Structural Holes: The Social Structure of Competition , 1995, The SAGE Encyclopedia of Research Design.

[5]  Jon Kleinberg,et al.  Maximizing the spread of influence through a social network , 2003, KDD '03.

[6]  Kevin J. Lang,et al.  Communities from seed sets , 2006, WWW '06.

[7]  Haixun Wang,et al.  Local search of communities in large graphs , 2014, SIGMOD Conference.

[8]  Francesco Bonchi,et al.  The Minimum Wiener Connector Problem , 2015, SIGMOD Conference.

[9]  Nicola Barbieri,et al.  Efficient and effective community search , 2015, Data Mining and Knowledge Discovery.

[10]  Christos Faloutsos,et al.  Fast discovery of connection subgraphs , 2004, KDD.

[11]  Jon M. Kleinberg,et al.  Community membership identification from small seed sets , 2014, KDD.

[12]  Francesco Bonchi,et al.  To Be Connected, or Not to Be Connected: That is the Minimum Inefficiency Subgraph Problem , 2017, CIKM.

[13]  Aristides Gionis,et al.  The community-search problem and how to plan a successful cocktail party , 2010, KDD.

[14]  H. Wiener.  Structural determination of paraffin boiling points. , 1947, Journal of the American Chemical Society.

[15]  Christos Faloutsos,et al.  Center-piece subgraphs: problem definition and fast solutions , 2006, KDD '06.

[16]  Christos Faloutsos,et al.  Mining Connection Pathways for Marked Nodes in Large Graphs , 2013, SDM.

[17]  V. Latora,et al.  Harmony in the Small-World , 2000, cond-mat/0008357.

[18]  Alex Bavelas.  A Mathematical Model for Group Structures , 1948 .

[19]  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.