earticle

논문검색

[Section발표], 좌장 : 광주대 전웅렬교수

Trajectory Privacy for Publishing Big Data

초록

영어

Trajectory data is widely collected and utilized for scientific research and business purpose, publishing trajectory it without proper privacy policy leads to an acute threat to individual data. Recently, several methods, i.e., k-anonymity, l-diversity, t-closeness, have been studied, though they tend to protect by reducing data depends on a feature of each method. When it requires strong privacy protection, these methods have excessively reduced data utility that may affect the result of scientific research. In this research, for the first time, we suggest a novel approach to tackle this existing dilemma via an adding noise trajectory on a vector-based grid environment. Afterward, we propose an efficient algorithm to expand trajectories adding the minimum amount of noise. Compared to other methods, our experiment shows the proposed algorithm maintains excellent performance with respect to data utility and time complexity.

목차

Abstract
1. INTRODUCTION
2. RELATED WORKS
3. PRIVACY ANONYMIZATION ALGORITHM
4. CONCLUSIONS
REFERENCES

저자정보

  • Rashid Tojiboev Dept. of Industrial Engineering Inha University Incheon, South Korea
  • Chris Soo-Hyun Eom Dept. of Industrial Engineering Inha University Incheon, South Korea
  • Wookey Lee Dept. of Industrial Engineering Inha University Incheon, South Korea

참고문헌

자료제공 : 네이버학술정보

    함께 이용한 논문

      ※ 기관로그인 시 무료 이용이 가능합니다.
      ※ 학술발표대회집, 워크숍 자료집 중 4페이지 이내 논문은 '요약'만 제공되는 경우가 있으니, 구매 전에 간행물명, 페이지 수 확인 부탁 드립니다.

      • 3,000원

      0개의 논문이 장바구니에 담겼습니다.