您当前的位置:
首页 >
文章列表页 >
Achieving (α,k)-Anonymity via Clustering in Data Publishing
更新时间:2025-07-16
    • Achieving (α,k)-Anonymity via Clustering in Data Publishing

    • Acta Electronica Sinica   Vol. 39, Issue 8, Pages: 1941-1946(2011)
    • CLC: TP309.2
    • Published:2011

    移动端阅览

  • YANG Gao-ming, YANG Jing, ZHANG Jian-pei. Achieving (α,k)-Anonymity via Clustering in Data Publishing[J]. Acta Electronica Sinica, 2011, 39(8): 1941-1946. DOI:

  •  
  •  
icon
试读结束,您可以激活您的VIP账号继续阅读。
去激活 >
icon
试读结束,您可以通过登录账户,到个人中心,购买VIP会员阅读全文。
已是VIP会员?
去登录 >

0

Views

1499

下载量

11

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Relations Between Several Classical Privacy Notions
Individuation Privacy Preservation Oriented to Sensitive Values
A Privacy Preserving Approach Based on Attributes Correlation Partition for Multiple Sensitive Attributes
A Temporal-Pulse Amplitude Clustering-Based Unknown Radar Emitter Signal Sorting Method
Continuous Relation Extraction Technique Based on Dynamic Relational Prototypes

Related Author

ZHENG Zhi-run
HUANG Cheng
WANG Ping
LI Cheng-xin
XU Wen
LI Zhe-tao
FONT face
Verdana

Related Institution

Department of Artificial Intelligence, Ajou University, Suwon 16499, South Korea
School of Coputer Science, Fudan University
School of Computer Science and Artificial Intelligence, Lanzhou University of Technology
School of Mathematics and Computational Science, Xiangtan University
College of Information Science and Technology, Jinan University
0