Community detection in social networks

P Bedi, C Sharma - Wiley interdisciplinary reviews: Data …, 2016 - Wiley Online Library
The expansion of the web and emergence of a large number of social networking sites
(SNS) have empowered users to easily interconnect on a shared platform. A social network …

Privacy preserving social network data publication

JH Abawajy, MIH Ninggal… - … communications surveys & …, 2016 - ieeexplore.ieee.org
The introduction of online social networks (OSN) has transformed the way people connect
and interact with each other as well as share information. OSN have led to a tremendous …

Big data: A survey

M Chen, S Mao, Y Liu - Mobile networks and applications, 2014 - Springer
In this paper, we review the background and state-of-the-art of big data. We first introduce
the general background of big data and review related technologies, such as could …

Toward scalable systems for big data analytics: A technology tutorial

H Hu, Y Wen, TS Chua, X Li - IEEE access, 2014 - ieeexplore.ieee.org
Recent technological advancements have led to a deluge of data from distinctive domains
(eg, health care and scientific sensors, user-generated data, Internet and financial …

Listing all maximal cliques in sparse graphs in near-optimal time

D Eppstein, M Löffler, D Strash - … 2010, Jeju Island, Korea, December 15 …, 2010 - Springer
The degeneracy of an n-vertex graph G is the smallest number d such that every subgraph
of G contains a vertex of degree at most d. We show that there exists a nearly-optimal fixed …

K-core decomposition of large networks on a single PC

W Khaouid, M Barsky, V Srinivasan… - Proceedings of the VLDB …, 2015 - dl.acm.org
Studying the topology of a network is critical to inferring underlying dynamics such as
tolerance to failure, group behavior and spreading patterns. k-core decomposition is a well …

Finding dense subgraphs with size bounds

R Andersen, K Chellapilla - … workshop on algorithms and models for the …, 2009 - Springer
We consider the problem of finding dense subgraphs with specified upper or lower bounds
on the number of vertices. We introduce two optimization problems: the densest at-least-k …

Using co-authorship and citation analysis to identify research groups: a new way to assess performance

L Reyes-Gonzalez, CN Gonzalez-Brambila, F Veloso - Scientometrics, 2016 - Springer
Considering that modern science is conducted primarily through a network of collaborators
who organize themselves around key researchers, this research develops and tests a …

Rating network security posture and comparing network maliciousness

M Liu, M Bailey, M Karir, Y Liu, J Zhang - US Patent 10,038,703, 2018 - Google Patents
Embodiments are disclosed for profiling network-level mali cious activity. Profiling
embodiments include observing malicious activity, representing such activity in accordance …

Covariate-assisted community detection in multi-layer networks

S Xu, Y Zhen, J Wang - Journal of Business & Economic Statistics, 2023 - Taylor & Francis
Communities in multi-layer networks consist of nodes with similar connectivity patterns
across all layers. This article proposes a tensor-based community detection method in multi …