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.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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-citation
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.