메뉴 건너뛰기




Volumn , Issue , 2009, Pages 218-227

The union-split algorithm and cluster-based anonymization of social networks

Author keywords

Clustering algorithms; Graph anonymization; Social networks; Social role

Indexed keywords

ANONYMIZATION; ATTACK MODEL; CLUSTER-BASED; CLUSTERING METHODS; DATA TYPE; GENERAL PUBLICS; GRAPH VERTEX; KNOWLEDGE DISCOVERY; MATCHING METHODS; PRIOR KNOWLEDGE; PRIVACY MODELS; RELATIONAL DATA; SIZE CONSTRAINT; SOCIAL NETWORKS; SOCIAL TREND; SPLIT ALGORITHMS; UNDIRECTED GRAPH;

EID: 70350402281     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1533057.1533088     Document Type: Conference Paper
Times cited : (74)

References (21)
  • 3
    • 77952412889 scopus 로고    scopus 로고
    • Cambridge English Dictionary
    • Cambridge English Dictionary. http://dictionary.cambridge.org/define.asp? key=68410&dict=CALD.
  • 4
    • 84859246670 scopus 로고    scopus 로고
    • R-MAT: A recursive model for graph mining
    • and, In M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, editors
    • D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In M. W. Berry, U. Dayal, C. Kamath, and D. B. Skillicorn, editors, SDM. SIAM, 2004.
    • (2004) SDM. SIAM
    • Chakrabarti, D.1    Zhan, Y.2    Faloutsos, C.3
  • 8
    • 57149126815 scopus 로고    scopus 로고
    • Towards identity anonymization on graphs
    • J. T.-L. Wang, editor, pages, ACM
    • K. Liu and E. Terzi. Towards identity anonymization on graphs. In J. T.-L. Wang, editor, SIGMOD Conference, pages 93-106. ACM, 2008.
    • (2008) SIGMOD Conference , pp. 93-106
    • Liu, K.1    Terzi, E.2
  • 10
    • 0002687371 scopus 로고
    • The small world problem
    • May
    • S. Milgram. The small world problem. Psychology Today, 1 (1):60-67, May 1967.
    • (1967) Psychology Today , vol.1 , Issue.1 , pp. 60-67
    • Milgram, S.1
  • 12
    • 50249142450 scopus 로고    scopus 로고
    • Robust de-anonymization of large sparse datasets
    • pages, IEEE Computer Society
    • A. Narayanan and V. Shmatikov. Robust de-anonymization of large sparse datasets. In IEEE Symposium on Security and Privacy, pages 111-125. IEEE Computer Society, 2008.
    • (2008) IEEE Symposium on Security and Privacy , pp. 111-125
    • Narayanan, A.1    Shmatikov, V.2
  • 13
    • 34548689125 scopus 로고    scopus 로고
    • Thoughts on k-anonymization
    • M. E. Nergiz and C. Clifton. Thoughts on k-anonymization. Data Knowl. Eng., 63 (3):622-645, 2007.
    • (2007) Data Knowl. Eng. , vol.63 , Issue.3 , pp. 622-645
    • Nergiz, M.E.1    Clifton, C.2
  • 15
    • 77952380530 scopus 로고    scopus 로고
    • Netflix Prize
    • Netflix Prize. http://www.netflixprize.com.
  • 16
    • 0031632776 scopus 로고    scopus 로고
    • Generalizing data to provide anonymity when disclosing information (abstract)
    • ACM Press
    • P. Samarati and L. Sweeney. Generalizing data to provide anonymity when disclosing information (abstract). In PODS, page 188. ACM Press, 1998.
    • (1998) PODS , pp. 188
    • Samarati, P.1    Sweeney, L.2
  • 19
    • 33749571958 scopus 로고    scopus 로고
    • (α, K)-anonymity: An enhanced k-anonymity model for privacy preserving data publishing
    • and, In T. Eliassi-Rad, L. H. Ungar, M. Craven, and D. Gunopulos, editors, pages, ACM
    • R. C.-W. Wong, J. Li, A. W.-C. Fu, and K. Wang. (α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing. In T. Eliassi-Rad, L. H. Ungar, M. Craven, and D. Gunopulos, editors, KDD, pages 754-759. ACM, 2006.
    • (2006) KDD , pp. 754-759
    • Wong, R.C.-W.1    Li, J.2    Fu, A.W.-C.3    Wang, K.4


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