NDLI: MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

Please wait, while we are loading the content...

Managing Sensor Data Streams: Lessons Learned from the WeBike Project

Measuring Fairness in Ranked Outputs

SGVCut: A Vertex-Cut Partitioning Tool for Random Walks-based Computations over Social Network graphs

Incremental Discovery of Inclusion Dependencies

How the Passengers Flow in Complex Metro Networks?

VISOR: Visualizing Summaries of Ordered Data

Generating What-If Scenarios for Time Series Data

DualDB: An Efficient LSM-based Publish/Subscribe Storage System

Skluma: A Statistical Learning Pipeline for Taming Unkempt Data Repositories

Computing Influence of a Product through Uncertain Reverse Skyline

DistriPlan: An Optimized Join Execution Framework for Geo-Distributed Scientific Data

DataSynthesizer: Privacy-Preserving Synthetic Datasets

FlatFIT: Accelerated Incremental Sliding-Window Aggregation For Real-Time Analytics

Fides: Towards a Platform for Responsible Data Science

A Benchmark for Betweenness Centrality Approximation Algorithms on Large Graphs

Challenges of Differentially Private Release of Data Under an Open-world Assumption

Incremental Temporal Pattern Mining Using Efficient Batch-Free Stream Clustering

Mining Persistent and Discriminative Communities in Graph Ensembles

Dot-Product Join: Scalable In-Database Linear Algebra for Big Model Analytics

High-Definition Digital Elevation Model System Vision Paper

On-line Versioned Schema Inference for Large Semantic Web Data Sources

Discovering Partial Periodic Itemsets in Temporal Databases

Bi-Level Online Aggregation on Raw Data

Detecting Global Hyperparaboloid Correlated Clusters Based on Hough Transform

Tiling Strategies for Distributed Point Cloud Databases

Edge Labeling Schemes for Graph Data

Computing Isochrones in Multimodal Spatial Networks using Tile Regions

Class-based Conditional MaxRS Query in Spatial Data Streams

Location and Processing Aware Datacube Caching

Active Learning with Density-Initialized Decision Tree for Record Matching

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

BLOCK: Efficient Execution of Spatial Range Queries in Main-Memory

PLI: Augmenting Live Databases with Custom Clustered Indexes

Multi-Hypothesis CSV Parsing

Improving Statistical Similarity Based Data Reduction for Non-Stationary Data

Fast Equi-Join Algorithms on GPUs: Design and Implementation

Dynamic Group Trip Planning Queries in Spatial Databases

Query Suggestion to allow Intuitive Interactive Search in Multidimensional Time Series

SHRec: Scalable Holistic Recommendation

A Unified Correlation-based Approach to Sampling Over Joins

Probabilistic k-Nearest Neighbor Monitoring of Moving Gaussians

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

Content Provider	ACM Digital Library
Author	Madria, Sanjay Lin, Dan Ward, Katrina
Abstract	With the proliferation of location-based services enabled by a large number of mobile devices and applications, the quantity of location data, such as trajectories collected by service providers, is gigantic. If these datasets could be published, they will be valuable assets to various service providers to explore business opportunities, to governments to research commuter behavior for better transport management, and could also greatly benefit the general public for day to day commute. However, there are two major concerns that considerably limit the availability and the usage of these trajectory datasets. The first is the threat to individual privacy as users' trajectories may be tracked by an adversary to discover sensitive information, such as home locations, their children's school locations, or social information like habits or relationships. The other concern is the ability to analyze the exabytes of location data in a timely manner. Although there have been trajectory anonymization approaches proposed in the past to mitigate privacy concerns, none of these prior works address the scalability issue since it is a newly occurring problem. In this paper, we conquer these two challenges by designing a novel trajectory anonymization algorithm using the MapReduce programming paradigm to provide scalability, strong privacy protection and high utility rate of the anonymized trajectory datasets. We have conducted extensive experiments using real maps with different topologies, and our results prove both effectiveness and efficiency when compared with the latest centralized approaches.
Starting Page	1
Ending Page	6
Page Count	6
File Format	PDF
ISBN	9781450352826
DOI	10.1145/3085504.3085581
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2017-06-27
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Efficient large-scale trace checking using mapreduce

MapReduce-based efficient algorithm for finding large patterns

Large scale pagerank with mapreduce.

An Efficient Mapreduce Approach Using on Cloud for Data Anonymization

Beyond MapReduce

VMR: volunteer MapReduce over the large scale internet

An Efficient Platform for Large-Scale MapReduce Processing

An efficient MapReduce algorighm for parallelizing large-scale graph clustering

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization

Similar Documents

Efficient large-scale trace checking using mapreduce

MapReduce-based efficient algorithm for finding large patterns

Large scale pagerank with mapreduce.

An Efficient Mapreduce Approach Using on Cloud for Data Anonymization

Beyond MapReduce

VMR: volunteer MapReduce over the large scale internet

An Efficient Platform for Large-Scale MapReduce Processing

An efficient MapReduce algorighm for parallelizing large-scale graph clustering

An Effective and Efficient MapReduce Algorithm for Computing BFS-Based Traversals of Large-Scale RDF Graphs

MELT: Mapreduce-based Efficient Large-scale Trajectory Anonymization