메뉴 건너뛰기




Volumn , Issue , 2007, Pages 693-698

Hiding sensitive trajectory patterns

Author keywords

[No Author keywords available]

Indexed keywords

ADMINISTRATIVE DATA PROCESSING; CANNING; DATA MINING; DATA PRIVACY; DATABASE SYSTEMS; DECISION SUPPORT SYSTEMS; HEURISTIC PROGRAMMING; INFORMATION MANAGEMENT; KNOWLEDGE MANAGEMENT; MINING; MOTOR TRANSPORTATION; NUCLEAR PROPULSION; SEARCH ENGINES; TRACKING (POSITION); TRAFFIC CONTROL; TRAJECTORIES;

EID: 49549100210     PISSN: 15504786     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDMW.2007.93     Document Type: Conference Paper
Times cited : (20)

References (19)
  • 3
    • 0041783510 scopus 로고    scopus 로고
    • Privacy-preserving data mining
    • R. Agrawal and R. Srikant. Privacy-preserving data mining. In SIGMOD 2000, pages 439-450, 2000.
    • (2000) SIGMOD 2000 , pp. 439-450
    • Agrawal, R.1    Srikant, R.2
  • 5
    • 27144456207 scopus 로고    scopus 로고
    • Generating traffic data
    • T. Brinkhoff. Generating traffic data. IEEE Data Eng. Bull., 26(2):19-25, 2003.
    • (2003) IEEE Data Eng. Bull , vol.26 , Issue.2 , pp. 19-25
    • Brinkhoff, T.1
  • 6
    • 0003504808 scopus 로고    scopus 로고
    • Security and privacy implications of data mining
    • Feb
    • C. Clifton and D. Marks. Security and privacy implications of data mining. In SIGMOD'96, pages 15-19, Feb. 1996.
    • (1996) SIGMOD'96 , pp. 15-19
    • Clifton, C.1    Marks, D.2
  • 8
    • 0032108018 scopus 로고    scopus 로고
    • Finding the k shortest paths
    • D. Eppstein. Finding the k shortest paths. SIAM J. Computing, 28(2):652-673, 1997.
    • (1997) SIAM J. Computing , vol.28 , Issue.2 , pp. 652-673
    • Eppstein, D.1
  • 10
    • 18744393736 scopus 로고    scopus 로고
    • Hiding sensitive patterns in association rules mining
    • G. Lee, C.-Y. Chang, and A. L. P. Chen. Hiding sensitive patterns in association rules mining. In COMPSAC 2004, pages 424-429, 2004.
    • (2004) COMPSAC 2004 , pp. 424-429
    • Lee, G.1    Chang, C.-Y.2    Chen, A.L.P.3
  • 11
    • 25844456648 scopus 로고    scopus 로고
    • Maximizing accuracy of shared databases when concealing sensitive patterns
    • S. Menon, S. Sarkar, and S. Mukherjee. Maximizing accuracy of shared databases when concealing sensitive patterns. Information Systems Research, 16(3):256-270, 2005.
    • (2005) Information Systems Research , vol.16 , Issue.3 , pp. 256-270
    • Menon, S.1    Sarkar, S.2    Mukherjee, S.3
  • 12
    • 0040871512 scopus 로고
    • Knowledge discovery as a threat to database security
    • G. Piatetsky-Shapiro and W. J. Frawley, editors, AAAI/MIT Press
    • D. E. O'Leary. Knowledge discovery as a threat to database security. In G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, pages 507-516. AAAI/MIT Press, 1991.
    • (1991) Knowledge Discovery in Databases , pp. 507-516
    • O'Leary, D.E.1
  • 13
    • 49549095928 scopus 로고    scopus 로고
    • Protecting sensitive knowledge by data sanitization
    • S. R. M. Oliveira and O. R. Zaïane. Protecting sensitive knowledge by data sanitization. In ICDM 2003, pages 211-218, 2003.
    • (2003) ICDM 2003 , pp. 211-218
    • Oliveira, S.R.M.1    Zaïane, O.R.2
  • 15
    • 0344990562 scopus 로고    scopus 로고
    • Using unknowns to prevent discovery of association rules
    • Y. Saygin, V. S. Verykios, and C. Clifton. Using unknowns to prevent discovery of association rules. ACM SIGMOD Record, 30(4):45-54, 2001.
    • (2001) ACM SIGMOD Record , vol.30 , Issue.4 , pp. 45-54
    • Saygin, Y.1    Verykios, V.S.2    Clifton, C.3
  • 17
    • 34548591826 scopus 로고    scopus 로고
    • A border-based approach for hiding sensitive frequent itemsets
    • X. Sun and P. S. Yu. A border-based approach for hiding sensitive frequent itemsets. In ICDM 2005, pages 426-433, 2005.
    • (2005) ICDM 2005 , pp. 426-433
    • Sun, X.1    Yu, P.S.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.