Research article · 2021
Research articlePublished 2011
A Rough Set Based Efficient l-diversity Algorithm
Abstract
Select any words in the title or abstract, or press this and choose a sentence.
Most of the organizations publish micro data for a variety of purposes including demographic and public health research. To protect the anonymity of the entities, data holders often remove or encrypt explicit identifiers. But, released information often contains quasi identifiers, which leak valuable information. Samarati and Sweeney introduced the concept of k-anonymity to handle this problem and several algorithms have been introduced by different authors in recent times. Lin et al put forth a new clustering-based method known as OKA for k-anonymization. But, k-anonymity can create groups that leak information due to homogeneity attack. This problem is tackled by the notion of l- diversity introduced by Machanavajjhala et al. Recently, the OKA algorithm is improved by Tripathy et al by making some modifications in the adjustment stage and introducing distinct l-diversity into it. But, in most of the modern databases impreciseness has become a common characteristic, which is not handled by any of the above algorithms. The primary purpose of this paper is to use MMeR, an algorithm introduced by Tripathy et al, in developing a suitable anonymisation algorithm which is applicable to any database having precise or imprecise heterogeneous data and satisfies both k-anonymity as well as l-diversity properties.
Subjects
Computer Science & ITAsk about this article
Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.
Similar by topic
Research article · 2011
SSDR: An Algorithm for Clustering Categorical Data Using Rough Set Theory
Research article · Mar 2014
Proposing a Novel Synergized K-Degree L-Diversity TCloseness Model for Graph Based Data Anonymization
Editorial · 2019
Data Mining 2016: Application of rough sets and Dempster-Shafer s evidence theory in spatial data mining- Iftikhar U Sikder - Cleveland State University
Conference abstract · 26 Sep 2016
Application of Rough Sets and Dempster-Shafer's Evidence Theory in Spatial Data Mining
More from this journal
The newest in Advances in Applied Science Research.
Article · 30 Jan 2025
Exploring the Depths of Biological Sciences
Article · 21 Jan 2025
Enhancing Home Security through an Android-based Door Security System Using IoT Technology
Article · 21 Jan 2025
Systematical Method for Zero-Energy Efficiency Buildings
Follow
New articles from what you follow go into your email digest, once you agree to alert emails.
- JournalAdvances in Applied Science Research
- SubjectComputer Science & IT
- BylineArticles whose byline prints “B. K. Tripathy”
- BylineArticles whose byline prints “G. K. Panda”
- BylineArticles whose byline prints “K. Kumaran”
