Discovering social circles in ego networks

@article{McAuley2012DiscoveringSC,
  title={Discovering social circles in ego networks},
  author={Julian McAuley and Jure Leskovec},
  journal={ACM Transactions on Knowledge Discovery from Data (TKDD)},
  year={2012},
  volume={8},
  pages={1 - 28}
}
People's personal social networks are big and cluttered, and currently there is no good way to automatically organize them. [] Key Method We develop a model for detecting circles that combines network structure as well as user profile information. For each circle, we learn its members and the circle-specific user profile similarity metric. Modeling node membership to multiple circles allows us to detect overlapping as well as hierarchically nested circles. Experiments show that our model accurately…
View on ACM
arxiv.org
349 Citations
Highly Influential Citations
34
Background Citations
120
Methods Citations
73
Results Citations
4

Figures and Tables from this paper

349 Citations

Learning to Discover Social Circles in Ego Networks

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.

Learning to Discover Social Circles in Ego Networks

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.

Effective Social Circle Prediction Based on Bayesian Network

Experimental results indicate that the BN model could accurately determine user's existence in social circle and outperforms four baseline predictors, namely Naïve Bayes, IBL, OneR and J48, showing promising application potential in the social circle research area.

Enhanced link clustering with observations on ground truth to discover social circles

Detecting Circles on Ego Network Based on Structure

An algorithm to find circles on personal social network mainly from the structural view is proposed, which is able to cluster the most similar nodes into the same circle based on the defined structural similarity and the condition where nodes constitute a circle.

Automatic Grouping for Social Networks CS229 Project Report

A supervised model for detecting social circles that combines network structure as well as user information is developed that achieves significantly higher accuracy than K-means and Naive Bayes, and has comparable overall performance to that in Leskovec et al.

Learning Social Circles in Ego-Networks Based on Multi-View Network Structure

This paper deriving a bias upper bound that integrates theories of spectral clustering and matrix perturbation, and discussing how the bound may be affected by several network characteristics.

Diversity of a User's Friend Circle in OSNs and Its Use for Profiling

A manually tagged dataset is used to identify functional and social users and demonstrate their different friend circle patterns using examples, and metrics to measure diversity of a user’s friend circle are developed, borrowing concepts from classic works on structural holes and community detection.

Friends Classification of Ego Network Based on Combined Features

This paper presents a method, which combining user attributes, network structure and contact frequent three aspects, first identifies the relationship between users and then attempts to solve the problem of community identification when a user’s profile is missing or inaccessible by use of ego network structural features.

Predicting the dynamics of social circles in ego networks using pattern analysis and GA K‐means clustering

A Genetic Algorithm–based framework is proposed to determine key elements (NoCs) of circle structures and differentiate Ego networks into non‐overlapping, hierarchically nested as well as overlapping circles by leveraging knowledge from the identified patterns in order to assist K‐means clustering.
...

References

SHOWING 1-10 OF 65 REFERENCES

Learning to Discover Social Circles in Ego Networks

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.

You are who you know: inferring user profiles in online social networks

It is found that users with common attributes are more likely to be friends and often form dense communities, and a method of inferring user attributes that is inspired by previous approaches to detecting communities in social networks is proposed.

The Anatomy of the Facebook Social Graph

A strong effect of age on friendship preferences as well as a globally modular community structure driven by nationality are observed, but it is shown that while the Facebook graph as a whole is clearly sparse, the graph neighborhoods of users contain surprisingly dense structure.

Community-Affiliation Graph Model for Overlapping Network Community Detection

The proposed Community-Affiliation Graph Model is a model-based community detection method that builds on bipartite node-community affiliation networks that successfully captures overlapping, non-overlapping as well as hierarchically nested communities, and identifies relevant communities more accurately than the state-of-the-art methods in networks ranging from biological to social and information networks.

Group formation in large social networks: membership, growth, and evolution

It is found that the propensity of individuals to join communities, and of communities to grow rapidly, depends in subtle ways on the underlying network structure, and decision-tree techniques are used to identify the most significant structural determinants of these properties.

Empirical comparison of algorithms for network community detection

Considering community quality as a function of its size provides a much finer lens with which to examine community detection algorithms, since objective functions and approximation algorithms often have non-obvious size-dependent behavior.

Detecting community structure in networks

A number of more recent algorithms that appear to work well with real-world network data, including algorithms based on edge betweenness scores, on counts of short loops in networks and on voltage differences in resistor networks are described.

Model‐based clustering for social networks

A new model is proposed, the latent position cluster model, under which the probability of a tie between two actors depends on the distance between them in an unobserved Euclidean ‘social space’, and the actors’ locations in the latent social space arise from a mixture of distributions, each corresponding to a cluster.

Benchmarks for testing community detection algorithms on directed and weighted graphs with overlapping communities.

The basic ideas behind the previous benchmark are extended to generate directed and weighted networks with built-in community structure, and the possibility that nodes belong to more communities is considered, a feature occurring in real systems, such as social networks.

Birds of a Feather: Homophily in Social Networks

Similarity breeds connection. This principle—the homophily principle—structures network ties of every type, including marriage, friendship, work, advice, support, information transfer, exchange,…
...