Linking Users Across Domains with Location Data: Theory and Validation
The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
Linking accounts of the same user across datasets -- even when personally identifying information is removed or unavailable -- is an important open problem studied in many contexts. Beyond many practical applications, (such as cross domain analysis, recommendation, and link prediction), understanding this problem more generally informs us on the privacy implications of data disclosure. Previous work has typically addressed this question using either different portions of the same dataset or observing the same behavior across thematically similar domains. In contrast, the general cross-domain case where users have different profiles independently generated from a common but unknown pattern raises new challenges, including difficulties in validation, and remains under-explored.
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
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571 · cited 2×
“This property follows a tradition of work specifying the risk of releasing even anonymized datasets [21].”
BackgroundRobust De-anonymization of Large Sparse Datasets
Narayanan, A., & Shmatikov, V. (2008) · 2008 IEEE Symposium on Security and Privacy (sp 2008) · doi:10.1109/sp.2008.33 · Cited by 2,372 · cited 3×
“Finally, identification of nearest neighbors using similarity metrics [15, 9] generalizes the first method to leverage non-identifying features and imperfect matches.”
BackgroundMethodUnique in the Crowd: The privacy bounds of human mobility
de Montjoye, Y.-A., Hidalgo, C. A., Verleysen, M., & Blondel, V. D. (2013) · Scientific Reports · doi:10.1038/srep01376 · Cited by 1,645 · cited 2×
“Recently, even a small amount of location information was shown sufficient to either render most users distinguishable [7, 25], or infer multiple sociological traits such as race [18], friendship [4, 6], gender, or marital status when combined with domain semantic information [27].”
BackgroundUnique in the shopping mall: On the reidentifiability of credit card metadata
de Montjoye, Y.-A., Radaelli, L., Singh, V. K., & Pentland, A. “. (2015) · Science · doi:10.1126/science.1256297 · Cited by 570
Cited by
User Identity Linkage across Online Social Networks: A Review
Shu, K., Wang, S., Tang, J., Zafarani, R., & Liu, H. (2017) · ACM SIGKDD Explorations Newsletter · doi:10.1145/3068777.3068781 · Cited by 267
Metadata
- Authors
- Riederer, C., Kim, Y., Chaintreau, A., Korula, N., & Lattanzi, S.
- Venue
- Proceedings of the 25th International Conference on World Wide Web
- Published
- 2016-04-11
- Pages
- 707-719
- OpenAlex
- W2339803498
- Cited by
- 161
- References
- 4
- FWCI
- 30.98
- Type
- conference paper
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Linking Users Across Domains with Location Data: Theory and Validation. https://app.cochat.ai/papers/10.1145/2872427.2883002
- The paper
- Riederer, C., Kim, Y., Chaintreau, A., Korula, N., & Lattanzi, S. (2016). Linking Users Across Domains with Location Data: Theory and Validation. Proceedings of the 25th International Conference on World Wide Web. https://doi.org/10.1145/2872427.2883002
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.