The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
A Clustering Approach for the l-Diversity Model in Privacy Preserving Data Mining Using Fractional Calculus-Bacterial Foraging Optimization Algorithm
Open accessAbstract
In privacy preserving data mining, the l-diversity and k-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 the k-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 except k-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 with l-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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
(1967) · Cited by 23,719
k-ANONYMITY: A MODEL FOR PROTECTING PRIVACY
SWEENEY, L. (2002) · International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems · doi:10.1142/s0218488502001648 · Cited by 8,571
Ant colony system: a cooperative learning approach to the traveling salesman problem
Dorigo, M., & Gambardella, L. M. (1997) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.585892 · Cited by 8,081
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
t-Closeness: Privacy Beyond k-Anonymity and l-Diversity
Li, N., Li, T., & Venkatasubramanian, S. (2007) · 2007 IEEE 23rd International Conference on Data Engineering · doi:10.1109/icde.2007.367856 · Cited by 3,451
L-diversity: privacy beyond k-anonymity
Machanavajjhala, A., Gehrke, J., Kifer, D., & Venkitasubramaniam, M. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.1 · Cited by 2,362
Data Privacy through Optimal k-Anonymization
Bayardo, R. J., & Agrawal, R. (2005) · 21st International Conference on Data Engineering (ICDE'05) · doi:10.1109/icde.2005.42 · Cited by 1,131
Mondrian Multidimensional K-Anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2006) · 22nd International Conference on Data Engineering (ICDE'06) · doi:10.1109/icde.2006.101 · Cited by 1,124
Incognito: efficient full-domain K-anonymity
LeFevre, K., DeWitt, D. J., & Ramakrishnan, R. (2005) · Proceedings of the 2005 ACM SIGMOD international conference on Management of data · doi:10.1145/1066157.1066164 · Cited by 1,070
Privacy Preserving Data Mining
Lindell, & Pinkas (2002) · Journal of Cryptology · doi:10.1007/s00145-001-0019-2 · Cited by 668
Anatomy: simple and effective privacy preservation
Xiao, X., & Tao, Y. (2006) · Very Large Data Bases · doi:10.5555/1182635.1164141 · Cited by 642
(α, k)-anonymity: an enhanced k-anonymity model for privacy preserving data publishing
Wong, R. C.-W., Li, J., Fu, A. W.-C., & Wang, K. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150499 · Cited by 625
Bacterial Foraging Optimization Algorithm: Theoretical Foundations, Analysis, and Applications
Das, S., Biswas, A., Dasgupta, S., & Abraham, A. (2009) · Studies in Computational Intelligence · doi:10.1007/978-3-642-01085-9_2 · Cited by 452
Efficient k-Anonymization Using Clustering Techniques
Byun, J.-W., Kamra, A., Bertino, E., & Li, N. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71703-4_18 · Cited by 329
Particle swarm optimization with fractional-order velocity
Solteiro Pires, E. J., Tenreiro Machado, J. A., de Moura Oliveira, P. B., Boaventura Cunha, J., & Mendes, L. (2010) · Nonlinear Dynamics · doi:10.1007/s11071-009-9649-y · Cited by 248
Introducing the fractional-order Darwinian PSO
Couceiro, M. S., Rocha, R. P., Ferreira, N. M. F., & Machado, J. A. T. (2012) · Signal, Image and Video Processing · doi:10.1007/s11760-012-0316-2 · Cited by 170
An efficient clustering method for k-anonymization
Lin, J.-L., & Wei, M.-C. (2008) · doi:10.1145/1379287.1379297 · Cited by 96
Efficient systematic clustering method for k-anonymization
Kabir, E., Wang, H., & Bertino, E. (2011) · Acta Informatica · doi:10.1007/s00236-010-0131-6 · Cited by 80
Data clustering using bacterial foraging optimization
Wan, M., Li, L., Xiao, J., Wang, C., & Yang, Y. (2011) · Journal of Intelligent Information Systems · doi:10.1007/s10844-011-0158-3 · Cited by 65
Efficient Anonymizations with Enhanced Utility
Goldberger, J., & Tassa, T. (2010) · Cited by 41
Communication-Efficient Privacy-Preserving Clustering
Jagannathan, G., Pillaipakkamnatt, K., Wright, R. N., & Umano, D. (2010) · doi:10.5555/1747335.1747336 · Cited by 25
Cited by
Kaur, G., & Kakkar, D. (2025) · Cluster Computing · doi:10.1007/s10586-024-04772-1 · Cited by 14
Metadata
- Authors
- Bhaladhare, P. R., & Jinwala, D. C.
- Venue
- Advances in Computer Engineering
- Publisher
- Wiley
- Published
- 2014-09-16
- Volume
- 2014
- Pages
- 1-12
- ISSN
- 2314-7601 (ISSN-L)
- 2356-6620
- OpenAlex
- W2085180935
- Cited by
- 286
- References
- 21
- FWCI
- 1.65
- Type
- journal article
- Language
- en
- Open access
- hybrid
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.