Anonymizing trajectory data for passenger flow analysis
Open accessThe DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Abstract
The increasing use of location-aware devices provides many opportunities for analyzing and mining human mobility. The trajectory of a person can be represented as a sequence of visited locations with different timestamps. Storing, sharing, and analyzing personal trajectories may pose new privacy threats. Previous studies have shown that employing traditional privacy models and anonymization methods often leads to low information quality in the resulting data. In this paper we propose a method for achieving anonymity in a trajectory database while preserving the information to support effective passenger flow analysis. Specifically, we first extract the passenger flowgraph, which is a commonly employed representation for modeling uncertain moving objects, from the raw trajectory data. We then anonymize the data with the goal of minimizing the impact on the flowgraph. Extensive experimental results on both synthetic and real-life data sets suggest that the framework is effective to overcome the special challenges in trajectory data anonymization, namely, high dimensionality, sparseness, and sequentiality.
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
L -diversity: Privacy beyond k -anonymity
Machanavajjhala, A., Kifer, D., Gehrke, J., & Venkitasubramaniam, M. (2007) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/1217299.1217302 · Cited by 3,617 · cited 3×
“K-anonymity (Samarati and Sweeney, 1998), ‘ -diversity (Machanavajjhala et al., 2007), and confidence bounding (Wang et al., 2007) are common models that prevent privacy attacks on relational data.”
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451 · cited 2×
“…companies in order to perform a comprehensive analysis of passenger flows in an area, with the goal of supporting trajectory data mining (Giannotti et al., 2007; Lee et al., 2008, 2007; Tang et al., 2012; Zheng et al., 2013) and traffic management (Burger et al., 2013; Li et al., 2007a).”
Privacy-preserving data publishing: A survey of recent developments
Fung, B. C. M., Wang, K., Chen, R., & Yu, P. S. (2010) · ACM Computing Surveys · doi:10.1145/1749603.1749605 · Cited by 1,704 · cited 1×
“Moreover, Fung et al. (2010) indicate that the taxonomy tree of trajectory data tends to be flat and fans out; thus, employing generalization leads to more information loss than does employing suppression.”
Self-citationAnonymizing transaction databases for publication
Xu, Y., Wang, K., Fu, A. W.-C., & Yu, P. S. (2008) · Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1401890.1401982 · Cited by 187
Cited by
Information Security in Big Data: Privacy and Data Mining
Xu, L., Jiang, C., Wang, J., Yuan, J., & Ren, Y. (2014) · IEEE Access · doi:10.1109/access.2014.2362522 · Cited by 631
Security and privacy challenges in smart cities
Braun, T., Fung, B. C. M., Iqbal, F., & Shah, B. (2018) · Sustainable Cities and Society · doi:10.1016/j.scs.2018.02.039 · Cited by 352
Self-citationSafePath: Differentially-private publishing of passenger trajectories in transportation systems
Al-Hussaeni, K., Fung, B. C. M., Iqbal, F., Dagher, G. G., & Park, E. G. (2018) · Computer Networks · doi:10.1016/j.comnet.2018.07.007 · Cited by 52
Self-citationImprovement in the Detection of Passengers in Public Transport Systems by Using UHF RFID
Cardoso, D. T., Manfroi, D., & de Freitas, E. P. (2020) · International Journal of Wireless Information Networks · doi:10.1007/s10776-019-00457-4 · Cited by 7
Private Location Sharing for Decentralized Routing Services
Tsao, M., Yang, K., Gopalakrishnan, K., & Pavone, M. (2022) · 2022 IEEE 25th International Conference on Intelligent Transportation Systems (ITSC) · doi:10.1109/itsc55140.2022.9922387 · Cited by 7
“) so that each class contains at least k records [6], [7].”
Background
Metadata
- Authors
- Ghasemzadeh, M., Fung, B. C. M., Chen, R., & Awasthi, A.
- Venue
- Transportation Research Part C: Emerging Technologies
- Publisher
- Elsevier BV
- Published
- 2014-02
- Volume
- 39
- Pages
- 63-79
- ISSN
- 0968-090X (ISSN-L)
- OpenAlex
- W2085526468
- Cited by
- 50
- References
- 4
- FWCI
- 4.62
- Type
- journal article
- Language
- en
- Open access
- green
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.