Improved Univariate Microaggregation for Integer Values

Q: How can I download an article?

To download an article from SID, first log in to the site, search for the article title, and click on the 'Download Article' option.

Q: How can I download an ISI article?

To download an ISI article on SID, enter the keyword or article title in the search bar, view the relevant results, click on the desired article, and select the 'Download Article' option.

Q: How can I access the SID database?

To access the SID database, visit SID.ir, create an account, and log in to access scientific resources.

Q: Is downloading articles from SID free?

Some articles on SID are available for free, while others require payment. Details are specified on the article's page.

MORTAZAVI REZA

مرکز اطلاعات علمی Scientific Information Database (SID) - Trusted Source for Research and Academic Resources

Journal Paper

Paper Information

Journal: THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY Year:2020 | Volume:12 | Issue:1 Page(s): 35-43

Download Full-Text

Persian Verion

View:

301

Download:

154

Cites:

Information Journal Paper

Title

Improved Univariate Microaggregation for Integer Values

Author(s)

MORTAZAVI REZA | Issue Writer Certificate

Keywords

Data PrivacyQ1

Statistical DatabasesQ1

Microdata ProtectionQ1

MicroaggregationQ1

Integer OptimizationQ1

Abstract

Privacy issues during data publishing is an increasing concern of involved entities. The problem is addressed in the field of statistical disclosure control with the aim of producing protected datasets that are also useful for interested end users such as government agencies and research communities. The problem of producing useful protected datasets is addressed in multiple computational privacy models such as k-anonymity in which data is clustered into groups of at least k members. Microaggregation is a mechanism to realize k-anonymity. The objective is to assign records of a dataset to clusters and replace the original values with their associated cluster centers which are the average of assigned values to minimize information loss in terms of the sum of within group squared errors (SSE). While the problem is shown to be NP-hard in general, there is an optimal polynomial-time algorithm for univariate datasets. This paper shows that the assignment of the univariate Microaggregation algorithm cannot produce optimal partitions for integer observations where the computed centroids have to be integer values. In other words, the integrality constraint on published quantities has to be addressed within the algorithm steps and the optimal partition cannot be attained using only the results of the general solution. Then, an effective method that considers the constraint is proposed and analyzed which can handle very large numerical volumes. Experimental evaluations confirm that the developed algorithm not only produces more useful datasets but also is more efficient in comparison with the general optimal univariate algorithm.

Cites

No record.

References

No record.

Cite

APA: Copy

MORTAZAVI, REZA. (2020). Improved Univariate Microaggregation for Integer Values. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, 12(1 ), 35-43. SID. https://sid.ir/paper/392238/en

Vancouver: Copy

MORTAZAVI REZA. Improved Univariate Microaggregation for Integer Values. THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY[Internet]. 2020;12(1 ):35-43. Available from: https://sid.ir/paper/392238/en

IEEE: Copy

REZA MORTAZAVI, “Improved Univariate Microaggregation for Integer Values,” THE ISC INTERNATIONAL JOURNAL OF INFORMATION SECURITY, vol. 12, no. 1 , pp. 35–43, 2020, [Online]. Available: https://sid.ir/paper/392238/en

Related Journal Papers