Learning to Discover Social Circles in Ego Networks
Explore this paper's citation graph
Summary
A novel machine learning task of identifying users' social circles is defined as a node clustering problem on a user's ego-network, a network of connections between her friends, and a model for detecting circles is developed that combines network structure as well as user profile information.
- Type
- article
- Published
- 2012-12-03
- Cited by
- 2,315
- References
- 37
- OpenAlex
- https://openalex.org/W2155461593
- Semantic Scholar
- https://api.semanticscholar.org/CorpusID:2820103
Keywords
Computer science, Similarity (geometry), Construct (python library), Cluster analysis, Set (abstract data type)
References
- Model‐based clustering for social networks
- The Anatomy of the Facebook Social Graph
- Hierarchical clustering schemes
- Bayesian Information Criterion for Censored Survival Models
- Representing Degree Distributions, Clustering, and Homophily in Social Networks With Latent Cluster Random Effects Models
- Defining and evaluating network communities based on ground-truth
- Community-Affiliation Graph Model for Overlapping Network Community Detection
- Freedom and control in modern society
- Connections between the lines: augmenting social networks with text
- Pseudo-Boolean optimization
- Communities from seed sets
- Data Warehouse Tuning: The Supremacy of Bitmap Index
- Toward finding hidden communities based on user profile
- Mixed Membership Stochastic Blockmodels
- Link communities reveal multiscale complexity in networks
- Who says what to whom on twitter
- Relational Topic Models for Document Networks
- Analysis of Twitter Lists as a Potential Source for Discovering Latent Characteristics of Users
- Topic-link LDA: joint models of topic and author community
- You are who you know: inferring user profiles in online social networks
Cited by
- Fast Overlapping and Hierarchical Community Detection via Local Dynamic Interaction
- Subgraph Matching for Single Large Multigraphs Subgraph Matching for Single Large Multigraphs
- Object-Oriented Genetic Programming for the Automatic Inference of Graph Models for Complex Networks
- Pattern Discovery in Complex Networks using Parallelism
- Incorporating Implicit Link Preference Into Overlapping Community Detection
- Link-Prediction Enhanced Consensus Clustering for Complex Networks
- An Adaptive Spectral Algorithm for the Recovery of Overlapping Communities in Networks
- Understanding spreading patterns on social networks based on network topology
- Computational Techniques for Public Health Surveillance
- Preserving privacy in social networks against connection fingerprint attacks
- Community discovery by propagating local and global information based on the MapReduce model
- Empirical comparison of network sampling techniques
- Uncovering the fingerprint of online social networks using a network motif based approach
- Community Detection Detailed for Online Social Networks
- Advances in Knowledge Discovery and Data Mining
- Disassortative Degree Mixing and Information Diffusion for Overlapping Community Detection in Social Networks (DMID)
- SybilFrame: A Defense-in-Depth Framework for Structure-Based Sybil Detection
- Efficient Link Cuts in Online Social Networks
- Privacy and Cooperation in Peer-to-Peer Systems
- Likelihood-based model selection for stochastic block models
Related papers
- 4 Community Detection in Networks with Node Attributes
- SNAP Datasets: Stanford Large Network Dataset Collection
- The political blogosphere and the 2004 U.S. election: divided they blog
- Modularity and community structure in networks.
- Community Structure in Large Networks: Natural Cluster Sizes and the Absence of Large Well-Defined Clusters
- Fast unfolding of communities in large networks
- Community detection in graphs