Welcome to the InfoSci Platform
Reference Hub4
A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining

Pawan R. Bhaladhare, Devesh C. Jinwala
Copyright: © 2016 |Volume: 10 |Issue: 1 |Pages: 21
ISSN: 1930-1650|EISSN: 1930-1669|EISBN13: 9781466689688|DOI: 10.4018/IJISP.2016010103
Cite Article Cite Article

MLA

Bhaladhare, Pawan R., and Devesh C. Jinwala. "A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining." IJISP vol.10, no.1 2016: pp.45-65. http://doi.org/10.4018/IJISP.2016010103

APA

Bhaladhare, P. R. & Jinwala, D. C. (2016). A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining. International Journal of Information Security and Privacy (IJISP), 10(1), 45-65. http://doi.org/10.4018/IJISP.2016010103

Chicago

Bhaladhare, Pawan R., and Devesh C. Jinwala. "A Clustering Approach Using Fractional Calculus-Bacterial Foraging Optimization Algorithm for k-Anonymization in Privacy Preserving Data Mining," International Journal of Information Security and Privacy (IJISP) 10, no.1: 45-65. http://doi.org/10.4018/IJISP.2016010103

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

A tremendous amount of personal data of an individual is being collected and analyzed using data mining techniques. Such collected data, however, may also contain sensitive data about an individual. Thus, when analyzing such data, individual privacy can be breached. Therefore, to preserve individual privacy, one can find numerous approaches proposed for the same in the literature. One of the solutions proposed in the literature is k-anonymity which is used along with the clustering approach. During the investigation, the authors observed that the k-anonymization based clustering approaches all the times result in the loss of information. This paper presents a fractional calculus-based bacterial foraging optimization algorithm (FC-BFO) to generate an optimal cluster. In addition to this, the authors utilize the concept of fractional calculus (FC) in the chemotaxis step of a bacterial foraging optimization (BFO) algorithm. The main objective is to improve the optimization ability of the BFO algorithm. The authors also evaluate their proposed FC-BFO algorithm, empirically, focusing on information loss and execution time as a vital metric. The experimental evaluations show that our proposed FC-BFO algorithm generates an optimal cluster with lesser information loss as compared with the existing clustering approaches.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.