k-Anonymity Algorithm of Multi-Branch-Tree Forest Based on Recognition Rate

Chen Xianlai, Luo Xiao, Liu Li, Li Zhongmin, An Ying

Data Analysis and Knowledge Discovery ›› 2020, Vol. 4 ›› Issue (12) : 14-25.

PDF(1175 KB)
PDF(1175 KB)
Data Analysis and Knowledge Discovery ›› 2020, Vol. 4 ›› Issue (12) : 14-25. DOI: 10.11925/infotech.2096-3467.2020.0952

k-Anonymity Algorithm of Multi-Branch-Tree Forest Based on Recognition Rate

    {{javascript:window.custom_author_en_index=0;}}
  • {{article.zuoZhe_EN}}
Author information +
History +

HeighLight

{{article.keyPoints_en}}

Abstract

{{article.zhaiyao_en}}

Key words

QR code of this article

Cite this article

EndNote

Ris (Procite)

Bibtex

Download Citations
{{article.zuoZheEn_L}}. {{article.title_en}}[J]. {{journal.qiKanMingCheng_EN}}, 2020, 4(12): 14-25 https://doi.org/10.11925/infotech.2096-3467.2020.0952

References

List( Publishing order | Descend order by publishing year | Descend order by cited within ) Chart analysis

References

{{article.reference}}

Funding

RIGHTS & PERMISSIONS

{{article.copyrightStatement_en}}
{{article.copyrightLicense_en}}
PDF(1175 KB)

Accesses

Citation

Detail
Sections
Recommended
Copyright © Data Analysis and Knowledge Discovery, All Rights Reserved.
Tel: (010)82626611-6626，82624938　
E-mail：jishu@mail.las.ac.cn
Total visitors:   Visitors of today:   Now online:
Powered by Beijing Magtech Co. Ltd.

/

〈 〉