The DOI matches its Crossref record; 54 of the 54 references it cites were found in a registry or an index.
Discovering social circles in ego networks
Abstract
People's personal social networks are big and cluttered, and currently there is no good way to automatically organize them. Social networking sites allow users to manually categorize their friends into social circles (e.g., “circles” on Google+, and “lists” on Facebook and Twitter). However, circles are laborious to construct and must be manually updated whenever a user's network grows. In this article, we study the novel task of automatically identifying users' social circles. We pose this task as a multimembership node clustering problem on a user's ego network, a network of connections between her friends. 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 identifies circles on a diverse set of data from Facebook, Google+, and Twitter, for all of which we obtain hand-labeled ground truth.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Birds of a Feather: Homophily in Social Networks
McPherson, M., Smith-Lovin, L., & Cook, J. M. (2001) · Annual Review of Sociology · doi:10.1146/annurev.soc.27.1.415 · Cited by 18,567
Modularity and community structure in networks
Newman, M. E. J. (2006) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0601602103 · Cited by 12,256
Information theory, inference, and learning algorithms
(2004) · Choice Reviews Online · doi:10.5860/choice.41-5949 · Cited by 6,362
Fast algorithm for detecting community structure in networks
Newman, M. E. J. (2004) · Physical Review E · doi:10.1103/physreve.69.066133 · Cited by 5,406
Uncovering the overlapping community structure of complex networks in nature and society
Palla, G., Derényi, I., Farkas, I., & Vicsek, T. (2005) · Nature · doi:10.1038/nature03607 · Cited by 5,373
Information Theory, Inference, and Learning Algorithms
(2004) · Kybernetes · doi:10.1108/03684920410534506 · Cited by 4,937
Hierarchical Clustering Schemes
Johnson, S. C. (1967) · Psychometrika · doi:10.1007/bf02289588 · Cited by 4,897
Monte Carlo Methods in Statistical Physics
Newman, M. E. J., & Barkema, G. T. (1999) · doi:10.1093/oso/9780198517962.001.0001 · Cited by 3,165
Updating quasi-Newton matrices with limited storage
Nocedal, J. (1980) · Mathematics of Computation · doi:10.1090/s0025-5718-1980-0572855-7 · Cited by 2,958
Learning to Discover Social Circles in Ego Networks
Leskovec, J., & McAuley, J. (2012) · neural information processing systems · Cited by 2,492
Self-citationCommunity detection algorithms: A comparative analysis
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.056117 · Cited by 2,177
Hierarchical organization in complex networks
Ravasz, E., & Barabási, A.-L. (2003) · Physical Review E · doi:10.1103/physreve.67.026112 · Cited by 2,160
Detecting community structure in networks
Newman, M. E. J. (2004) · The European Physical Journal B - Condensed Matter · doi:10.1140/epjb/e2004-00124-y · Cited by 2,028
Link communities reveal multiscale complexity in networks
Ahn, Y.-Y., Bagrow, J. P., & Lehmann, S. (2010) · Nature · doi:10.1038/nature09182 · Cited by 1,949
Detecting the overlapping and hierarchical community structure in complex networks
Lancichinetti, A., Fortunato, S., & Kertész, J. (2009) · New Journal of Physics · doi:10.1088/1367-2630/11/3/033015 · Cited by 1,941
The Focused Organization of Social Ties
Feld, S. L. (1981) · American Journal of Sociology · doi:10.1086/227352 · Cited by 1,931
Latent Space Approaches to Social Network Analysis
Hoff, P. D., Raftery, A. E., & Handcock, M. S. (2002) · Journal of the American Statistical Association · doi:10.1198/016214502388618906 · Cited by 1,917
Conflict and the Web of Group-Affiliations
Illing, H. A., & Simmel, G. (1955) · The Journal of Criminal Law, Criminology, and Police Science · doi:10.2307/1139856 · Cited by 1,742
Schaeffer, S. E. (2007) · Computer Science Review · doi:10.1016/j.cosrev.2007.05.001 · Cited by 1,639
Convolution kernels on discrete structures
Haussler, D. H. (1999) · Cited by 1,089
Lancichinetti, A., & Fortunato, S. (2009) · Physical Review E · doi:10.1103/physreve.80.016118 · Cited by 1,009
Combining SVMs with Various Feature Selection Strategies
Chen, Y.-W., & Lin, C.-J. (2008) · Studies in Fuzziness and Soft Computing · doi:10.1007/978-3-540-35488-8_13 · Cited by 980
Who says what to whom on twitter
Wu, S., Hofman, J. M., Mason, W. A., & Watts, D. J. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963504 · Cited by 957
Empirical comparison of algorithms for network community detection
Leskovec, J., Lang, K. J., & Mahoney, M. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772755 · Cited by 918
Self-citationBoros, E., & Hammer, P. L. (2002) · Discrete Applied Mathematics · doi:10.1016/s0166-218x(01)00341-9 · Cited by 827
The Anatomy of the Facebook Social Graph
Ugander, J., Karrer, B., Backstrom, L., & Marlow, C. (2011) · arXiv · doi:10.48550/arxiv.1111.4503 · Cited by 819
Finding overlapping communities in networks by label propagation
Gregory, S. (2010) · New Journal of Physics · doi:10.1088/1367-2630/12/10/103018 · Cited by 806
Mixed membership stochastic blockmodels
Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2007) · arXiv (Cornell University) · doi:10.48550/arxiv.0705.4485 · Cited by 781
Model-Based Clustering for Social Networks
Handcock, M. S., Raftery, A. E., & Tantrum, J. M. (2007) · Journal of the Royal Statistical Society Series A: Statistics in Society · doi:10.1111/j.1467-985x.2007.00471.x · Cited by 779
You are who you know: inferring user profiles in online social networks
Mislove, A., Viswanath, B., Gummadi, K. P., & Druschel, P. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718519 · Cited by 668
McPherson, M. (1983) · American Sociological Review · doi:10.2307/2117719 · Cited by 541
Link Prediction via Matrix Factorization
Menon, A. K., & Elkan, C. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-23783-6_28 · Cited by 520
Relational Topic Models for Document Networks
Chang, J., & Blei, D. M. (2009) · Cited by 507
Optimizing Binary MRFs via Extended Roof Duality
Rother, C., Kolmogorov, V., Lempitsky, V., & Szummer, M. (2007) · 2007 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2007.383203 · Cited by 427
Minimizing Nonsubmodular Functions with Graph Cuts-A Review
Kolmogorov, V., & Rother, C. (2007) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2007.1031 · Cited by 362
Less is more: probabilistic models for retrieving fewer relevant documents
Chen, H., & Karger, D. R. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148245 · Cited by 319
Roof duality, complementation and persistency in quadratic 0–1 optimization
Hammer, P. L., Hansen, P., & Simeone, B. (1984) · Mathematical Programming · doi:10.1007/bf02612354 · Cited by 316
Fast Kernels for String and Tree Matching
Vishwanathan, S. V. N., & Smola, A. J. (2004) · Kernel Methods in Computational Biology · doi:10.7551/mitpress/4057.003.0008 · Cited by 294
Community-Affiliation Graph Model for Overlapping Network Community Detection
Yang, J., & Leskovec, J. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.139 · Cited by 293
Self-citationTopic-link LDA: joint models of topic and author community
Liu, Y., Niculescu-Mizil, A., & Gryc, W. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553460 · Cited by 288
Krivitsky, P. N., Handcock, M. S., Raftery, A. E., & Hoff, P. D. (2009) · Social Networks · doi:10.1016/j.socnet.2009.04.001 · Cited by 284
Bayesian Information Criterion for Censored Survival Models
Volinsky, C. T., & Raftery, A. E. (2000) · Biometrics · doi:10.1111/j.0006-341x.2000.00256.x · Cited by 278
Community detection as an inference problem
Hastings, M. B. (2006) · Physical Review E · doi:10.1103/physreve.74.035102 · Cited by 213
Efficiently solving dynamic Markov random fields using graph cuts
Kohli, P., & Torr, P. H. S. (2005) · Tenth IEEE International Conference on Computer Vision (ICCV'05) Volume 1 · doi:10.1109/iccv.2005.81 · Cited by 173
Turning down the noise in the blogosphere
El-Arini, K., Veda, G., Shahaf, D., & Guestrin, C. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557056 · Cited by 136
Connections between the lines: augmenting social networks with text
Chang, J., Boyd-Graber, J. L., & Blei, D. M. (2009) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1557019.1557044 · Cited by 136
Mixed Membership Trajectory Models
Manrique‐Vallier, D. (2014) · Chapman & Hall/CRC eBooks · doi:10.1201/b17520-17 · Cited by 110
Online Models for Content Optimization
Agarwal, D., Chen, B.-C., Elango, P., Motgi, N., Park, S.-T., Ramakrishnan, R., Roy, S., & Zachariah, J. (2008) · Cited by 97
Analysis of Twitter Lists as a Potential Source for Discovering Latent Characteristics of Users
Kim, D., Jo, Y., Moon, I., & Oh, A. H. (2010) · Cited by 87
Multiassignment clustering for Boolean data
Frank, M., Streich, A. P., & Buhmann, J. M. (2009) · Cited by 82
A Log-Linear Model with Latent Features for Dyadic Prediction
Menon, A., & Elkan, C. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.148 · Cited by 74
Vanschoren, J., & Duivesteijn, W. (2012) · Cited by 73
Dynamic Egocentric Models for Citation Networks
Hunter, D. R., Smyth, P., Vu, D. Q., & Asuncion, A. (2011) · International Conference on Machine Learning · Cited by 67
Examining the evolution of networks based on lists in Twitter
Zhao, J., & Ram, S. (2011) · IEEE International Conference on Internet Multimedia Services Architecture and Applications (IMSAA) · doi:10.1109/imsaa.2011.6156363 · Cited by 10
Cited by
SNAP: A General-Purpose Network Analysis and Graph-Mining Library
Leskovec, J., & Sosič, R. (2017) · ACM Transactions on Intelligent Systems and Technology · doi:10.1145/2898361 · Cited by 870
Self-citationCommunity detection in node-attributed social networks: A survey
Chunaev, P. (2020) · Computer Science Review · doi:10.1016/j.cosrev.2020.100286 · Cited by 300
A Hybrid Approach for Fake News Detection in Twitter Based on User Features and Graph Embedding
Hamdi, T., Slimi, H., Bounhas, I., & Slimani, Y. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-36987-3_17 · Cited by 70
Metadata
- Authors
- Mcauley, J., & Leskovec, J.
- Venue
- ACM Transactions on Knowledge Discovery from Data
- Published
- 2014-02
- Volume
- 8
- Issue
- 1
- Pages
- 1-28
- ISSN
- 1556-4681 (ISSN-L)
- 1556-472X
- OpenAlex
- W2158908968
- Cited by
- 366
- References
- 54
- FWCI
- 28.13
- Type
- journal article
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.