PRESERVING PRIVACY IN DATA MINING USING SEMMA METHODOLOGY
Journal Title: International Journal on Computer Science and Engineering - Year 2012, Vol 4, Issue 5
Abstract
The huge amount of data available means that it is possible to learn a lot of information about individuals from public data. Here, this open data need to be sheltered from unlawful contact. The privacy-preserving data mining (PPDM) has thus become a significant subject in most recent years. Generally privacy means “keep information about person from being available to others” but, the real worry is that their information not be mishandle. The data mining techniques enable users to extract the hidden patterns which may lead to leakage of sensitive data. So the main concern is to secure the data mining result with the help of PPDM. This paper provides a framework to preserve privacy in data mining results by manipulating SEMMA analysis cycle.
Authors and Affiliations
Vijaylaxmi , Gunjan Batra , Dr. M. Afshar Alam
Hybrid Particle Swarm Optimization for Regression Testing
Regression Testing ensures that any enhancement made to software will not affect specified functionality of software. The execution of all test cases can be long and complex to run; this makes it a costlier process. The...
On the Timing Analysis of Cluster based Communication Devices for Large Scale Computing Systems
Many parallel computing environments utilize cluster based architecture for large scale computing owing to the ease of their availability. As the cluster based approach may be used extensively, the interconnection mechan...
Improvement in Word Sense Disambiguation by introducing enhancements in English WordNet Structure
Word sense disambiguation (WSD) is an open problem of natural language processing, which governs the process of identifying the appropriate sense of a word (i.e. intended meaning) in a sentence, when the word has multipl...
An Analysis of Q-Learning Algorithms with Strategies of Reward Function
Q-Learning is a Reinforcement Learning technique that works by learning an action-value function that gives the expected utility of taking a given action in a given state and following a fixed policy thereafter. One of t...
A Novel Document Clustering Algorithm Using Squared Distance Optimization Through Genetic Algorithms
K-Means Algorithm is most widely used algorithms in document clustering. However, it still suffer some shortcomings like random initialization, solution converges to local minima, and empty cluster formation. Genetic alg...