Ordinal, Continuous and Heterogeneous k-Anonymity Through Microaggregation

Author： Domingo-Ferrer Josep Torra Vicenç

ISSN： 1384-5810

Source： Data Mining and Knowledge Discovery, Vol.11, Iss.2, 2005-09, pp. : 195-212

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Mining top-K frequent itemsets through progressive sampling

By Pietracaprina Andrea Riondato Matteo Upfal Eli Vandin Fabio

Data Mining and Knowledge Discovery, Vol. 21, Iss. 2, 2010-09 ,pp. : 310-326

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Solution of A, x ^(k) = b ^(k) Using A ⁻¹

By Ditkowski Adi Fibich Gadi Gavish Nir

Journal of Scientific Computing, Vol. 32, Iss. 1, 2007-07 ,pp. : 29-44

Springer Publishing Company

Access to resources Recommend Favorite

A secure distributed framework for achieving k -anonymity

By Jiang Wei

The VLDB Journal, Vol. 15, Iss. 4, 2006-11 ,pp. : 316-333

Springer Publishing Company

Access to resources Recommend Favorite

K-Optimal Rule Discovery

By Webb Geoffrey I. Zhang Songmao

Data Mining and Knowledge Discovery, Vol. 10, Iss. 1, 2005-01 ,pp. : 39-79

Springer Publishing Company

Access to resources Recommend Favorite

A genetic k-medoids clustering algorithm

By Sheng Weiguo Liu Xiaohui

Journal of Heuristics, Vol. 12, Iss. 6, 2006-12 ,pp. : 447-466

Springer Publishing Company

Access to resources Recommend Favorite