메뉴 건너뛰기




Volumn , Issue , 2008, Pages 112-119

A new scheme for distributed density estimation based privacy-preserving clustering

Author keywords

[No Author keywords available]

Indexed keywords

CANNING; CLUSTER ANALYSIS; CLUSTERING ALGORITHMS; DATA MINING; DECISION SUPPORT SYSTEMS; ESTIMATION; FLOW OF SOLIDS; INFORMATION MANAGEMENT; INFORMATION SERVICES; MOBILE TELECOMMUNICATION SYSTEMS; PERTURBATION TECHNIQUES; RISK ASSESSMENT; RISK PERCEPTION; SEARCH ENGINES;

EID: 49049096374     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ARES.2008.129     Document Type: Conference Paper
Times cited : (7)

References (12)
  • 2
    • 0022199386 scopus 로고    scopus 로고
    • B. Chor, S. Goldwasser. S. Micali and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in The Presence of Faults. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 383-395, 1985,
    • B. Chor, S. Goldwasser. S. Micali and B. Awerbuch. Verifiable Secret Sharing and Achieving Simultaneity in The Presence of Faults. In Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 383-395, 1985,
  • 7
    • 49049116826 scopus 로고    scopus 로고
    • C. Dwork, Krishnaram Kenthapadi, F. McSherry, I. Mironov and M. Naor. Our Data, Ourselves: Privacy via Distributed Noise Generation. EURO-CRYPT 2006, Russia, 2006.
    • C. Dwork, Krishnaram Kenthapadi, F. McSherry, I. Mironov and M. Naor. Our Data, Ourselves: Privacy via Distributed Noise Generation. EURO-CRYPT 2006, Russia, 2006.
  • 8
    • 0033207750 scopus 로고    scopus 로고
    • A General Additive Data Perturbation Method for Database Security
    • K. Muralidhar, R. Parsa and R. Sarathy. A General Additive Data Perturbation Method for Database Security. Management Science, 45(10), pp. 1399-1415, 1999.
    • (1999) Management Science , vol.45 , Issue.10 , pp. 1399-1415
    • Muralidhar, K.1    Parsa, R.2    Sarathy, R.3
  • 9
    • 49049092932 scopus 로고    scopus 로고
    • S. R. M. Oliveira and O. R. Zaiane. Privacy Preserving Clustering By Data Transformation. In Proc. of the 18th Brazilian Symposium on Databases, pp. 304-318, Manaus, Brazil, 2003.
    • S. R. M. Oliveira and O. R. Zaiane. Privacy Preserving Clustering By Data Transformation. In Proc. of the 18th Brazilian Symposium on Databases, pp. 304-318, Manaus, Brazil, 2003.
  • 12
    • 84898817460 scopus 로고    scopus 로고
    • Grid-clustering: An Efficient Hierarchical Clustering Method for Very Large Data Sets
    • Las Alamitos, CA, USA
    • E. Schikuta. Grid-clustering: An Efficient Hierarchical Clustering Method for Very Large Data Sets. In Proceedings of the 13th International Conference on Pattern Recognition, pp. 101-105, Las Alamitos, CA, USA, 1996.
    • (1996) Proceedings of the 13th International Conference on Pattern Recognition , pp. 101-105
    • Schikuta, E.1


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