메뉴 건너뛰기




Volumn , Issue , 2014, Pages 498-505

D-Mash: A framework for privacy-preserving data-as-a-service mashups

Author keywords

anonymization; data mashup; data mining; data privacy; web services

Indexed keywords

DATA INTEGRATION; DATA MINING; DATA PRIVACY; LARGE DATASET; WEB SERVICES;

EID: 84919799137     PISSN: 21596182     EISSN: 21596190     Source Type: Conference Proceeding    
DOI: 10.1109/CLOUD.2014.73     Document Type: Conference Paper
Times cited : (15)

References (21)
  • 11
    • 0000301097 scopus 로고
    • A greedy heuristic for the set-covering problem
    • V. Chvatal, "A greedy heuristic for the set-covering problem," Mathematics of Operations Research, vol. 4, no. 3, pp. 233-235, 1979.
    • (1979) Mathematics of Operations Research , vol.4 , Issue.3 , pp. 233-235
    • Chvatal, V.1
  • 12
    • 84886567160 scopus 로고    scopus 로고
    • University of California, Irvine, School of Information and Computer Sciences
    • K. Bache and M. Lichman, UCI Machine Learning Repository. University of California, Irvine, School of Information and Computer Sciences, 2013.
    • (2013) UCI Machine Learning Repository
    • Bache, K.1    Lichman, M.2
  • 15
    • 78049357399 scopus 로고    scopus 로고
    • Secure multiparty computation for privacy-preserving data mining
    • Y. Lindell and B. Pinkas, "Secure multiparty computation for privacy-preserving data mining," Journal of Privacy and Confidentialityl., vol. 4, no. 1, pp. 59-98, 2009.
    • (2009) Journal of Privacy and Confidentialityl , vol.4 , Issue.1 , pp. 59-98
    • Lindell, Y.1    Pinkas, B.2


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