A Clustering Approach for the l-Diversity Model in Privacy Preserving Data Mining Using Fractional Calculus-Bacterial Foraging Optimization Algorithm. (16th September 2014)

• Record Type: Journal Article
• Authors: Bhaladhare, Pawan R.; Jinwala, Devesh C.
• Other Names: Li Lijie Academic Editor.
• Is Part Of: Advances in computer engineering. Volume 2014(2014)
• Publication Date: 2014-09-16
• Subjects: Computer engineering -- Periodicals; Computer engineering; Periodicals; 621.39
• DOI: 10.1155/2014/396529
• Languages: English
• ISSNs: 2356-6620

Abstract

Abstract : In privacy preserving data mining, thel -diversity andk -anonymity models are the most widely used for preserving the sensitive private information of an individual. Out of these two, l -diversity model gives better privacy and lesser information loss as compared to thek -anonymity model. In addition, we observe that numerous clustering algorithms have been proposed in data mining, namely, k -means, PSO, ACO, and BFO. Amongst them, the BFO algorithm is more stable and faster as compared to all others exceptk -means. However, BFO algorithm suffers from poor convergence behavior as compared to other optimization algorithms. We also observed that the current literature lacks any approaches that apply BFO withl -diversity model to realize privacy preservation in data mining. Motivated by this observation, we propose here an approach that uses fractional calculus (FC) in the chemotaxis step of the BFO algorithm. The FC is used to boost the computational performance of the algorithm. We also evaluate our proposed FC-BFO and BFO algorithms empirically, focusing on information loss and execution time as vital metrics. The experimental evaluation shows that our proposed FC-BFO algorithm derives an optimal cluster as compared to the original BFO algorithm and existing clustering algorithms.