Efficient clustering technique for k-anonymisation with aid of optimal KFCM Online publication date: Tue, 08-Oct-2019
by G. Chitra Ganabathi; P. Uma Maheswari
International Journal of Business Intelligence and Data Mining (IJBIDM), Vol. 15, No. 4, 2019
Abstract: The k-anonymity model is a simple and practical approach for data privacy preservation. To minimise the information loss due to anonymisation, it is crucial to group similar data together and then anonymises each group individually. So that in this paper proposes a novel clustering method for conducting the k-anonymity model effectively. The clustering will be done by an optimal kernel based fuzzy c-means clustering algorithm (KFCM). In KFCM, the original Euclidean distance in the FCM is replaced by a kernel-induced distance. Here the objective function of the kernel fuzzy c-means clustering algorithm is optimised with the help of modified grey wolf optimisation algorithm (MGWO). Based on that, the collected data is grouped in an effective manner. The performance of the proposed technique is evaluated by means of information loss, time taken to group the available data. The proposed technique will be implemented in the working platform of MATLAB.
Online publication date: Tue, 08-Oct-2019
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Business Intelligence and Data Mining (IJBIDM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email firstname.lastname@example.org