A Framework for an Ontology-Based Data- Gleaning and Agent Based Intelligent Decision Support PPDM System Employing Generalization Technique for Health Care
Journal Title: International Journal on Computer Science and Engineering - Year 2010, Vol 2, Issue 5
Abstract
The obligatory to anticipate the privacy benefits of heavy ownpour of monsoon rain from the firmament clouds of Privacy Preserving Data Mining (PPDM) Techniques have recently grown leaps and bounds. The desiccated users & miners look for the petite clemency from these little heavens in the form of a framework with PPDM Techniques. In this paper we have developed two things namely, the ontology based data leaning system, the gleaned data is sent to a PPDM system which has an in-built generalization privacy technique and the gent-based intelligent decision support system. The primary report is on the implementation of existing generalized ramework with alternate technology (i.e. implementation using Natural language processing instead of heuristic based ethod). Our Data Gleaning system will also allow new algorithms and ideas to be incorporated into a data extraction system. xtraction of information from semistructured or unstructured documents is a useful yet complex task. Ontologies can chieve a high degree of accuracy in data extraction system while maintaining resiliency in the face of document changes. ntologies do not, however, diminish the complexity of a dataextraction system. As research in the field progress, the need for a modular data-extraction system that decouples the associated processes continues to grow. We also propose a generalization conceptual framework in this paper, where we guide the extracted data from the data Gleaning system to the generalization framework. The QI Generalization technique in the generalized framework is used to visor sensitive nformation and then publishes the privacy preserved data for knowledge discovery.
Authors and Affiliations
K. Murugesan , J. Indumathi , D. Manjula
Keywords
Related Articles
- EP ID EP85424
- DOI -
- Views 143
- Downloads 0
Improved Optimal Competitive Hopfield Network for the Maximum Stable Set Problem
A large number of problems in artificial intelligence and other areas of computer science can be viewed as special cases of the Maximum Stable Set Problem (MSSP). In this paper, we propose a new approach to solve the MSS...
Analysis of Dependencies of Checkpoint Cost and Checkpoint Interval of Fault Tolerant MPI Applications
In this paper, we have analysed i) the relationship between the checkpoint cost and the optimal checkpoint interval and ii) the relationship between the checkpoint cost and the number of processors (processes) and we hav...
An Efficient Algorithm for Reliability Upper Bound of Distributed Systems with Unreliable Nodes
Abstract— The reliability of distributed systems in which the communication links are considered reliable while the computing nodes may fail with certain probabilities have been modeled by a probabilistic network or a gr...
Eigenvalues of tridiagonal matrix using Strum Sequence and Gerschgorin theorem
In this paper, computational efficient technique is proposed to calculate the eigenvalues of a tridiagonal system matrix using Strum sequence and Gerschgorin theorem. The proposed technique is applicable in various contr...
Web Services Security Architectures Composition and Contract Design using RBAC
Service Oriented Architecture’s Web Services authorization traditionally is done using common access control models like Role-Based Access Control. In thinking of a composite application that stitches together the capabi...