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?
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsReferences
Akoglu, L., et al.: Mining connection pathways for marked nodes in large graphs. In: SDM (2013)
Andersen, R., Lang, K.J.: Communities from seed sets. In: WWW (2006)
Barbieri, N., Bonchi, F., Galimberti, E., Gullo, F.: Efficient and effective community search. DAMI 29(5), 1406–1433 (2015)
Bavelas, A.: A mathematical model of group structure. Hum. Organ. 7, 16–30 (1948)
Burt, R.: Structural Holes: The Social Structure of Competition. Harvard University Press (1992)
Cui, W., Xiao, Y., Wang, H., Wang, W.: Local search of communities in large graphs. In: SIGMOD (2014)
Faloutsos, C., McCurley, K.S., Tomkins, A.: Fast discovery of connection subgraphs. In: KDD (2004)
Girvan, M., Newman, M.E.J.: Community structure in social and biological networks. PNAS 99(12), 7821–7826 (2002)
Kempe, D., Kleinberg, J.M., Tardos, É.: Maximizing the spread of influence through a social network. In: KDD (2003)
Kloumann, I.M., Kleinberg, J.M.: Community membership identification from small seed sets. In: KDD (2014)
Kossinets, G., Watts, D.J.: Empirical analysis of an evolving social network. Science 311(5757), 88–90 (2006)
Latora, V., Marchiori, M.: Efficient behavior of small-world networks. Phys. Rev. Lett. 87(19), 198701 (2001)
Marchiori, M., Latora, V.: Harmony in the small-world. Phys. A: Stat. Mech. Appl. 285(3–4), 539–546 (2000)
Przytycka, T., Singh, M., Slonim, D.: Toward the dynamic interactome: it’s about time. Brief. Bioinform. 11(1), 15–29 (2010). https://doi.org/10.1093/bib/bbp057
Ruchansky, N., Bonchi, F., García-Soriano, D., Gullo, F., Kourtellis, N.: The minimum wiener connector problem. In: SIGMOD (2015)
Ruchansky, N., Bonchi, F., García-Soriano, D., Gullo, F., Kourtellis, N.: To be connected, or not to be connected: that is the minimum inefficiency subgraph problem. In: CIKM (2017)
Sozio, M., Gionis, A.: The community-search problem and how to plan a successful cocktail party. In: KDD (2010)
Tong, H., Faloutsos, C.: Center-piece subgraphs: problem definition and fast solutions. In: KDD, pp. 404–413 (2006)
Wiener, H.: Structural determination of paraffin boiling points. J. Am. Chem. Soc. 69(1), 17–20 (1947)
Acknowledgements
I wish to thank all the co-authors of the various papers on which this invited talk is built: Natali Ruchansky, Ioanna Tsalouchidou, David García-Soriano, Francesco Gullo, Nicolas Kourtellis, Ricardo Baeza-Yates.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Switzerland AG
About this paper
Cite this paper
Bonchi, F. (2019). Distance-Based Community Search (Invited Talk Extended Abstract). In: Catania, B., Královič, R., Nawrocki, J., Pighizzini, G. (eds) SOFSEM 2019: Theory and Practice of Computer Science. SOFSEM 2019. Lecture Notes in Computer Science(), vol 11376. Springer, Cham. https://doi.org/10.1007/978-3-030-10801-4_2
Download citation
DOI: https://doi.org/10.1007/978-3-030-10801-4_2
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-10800-7
Online ISBN: 978-3-030-10801-4
eBook Packages: Computer ScienceComputer Science (R0)