Please use this identifier to cite or link to this item: http://172.22.28.37:8080/xmlui/handle/1/421
Full metadata record
DC FieldValueLanguage
dc.contributor.authorValake, Tejashri Pandurang-
dc.date.accessioned2018-10-30T09:37:23Z-
dc.date.available2018-10-30T09:37:23Z-
dc.date.issued2014-
dc.identifier.urihttp://localhost:8080/xmlui/handle/1/421-
dc.descriptionUnder the Guidance of Prof. S. S. Patilen_US
dc.description.abstractRapid growth of internet technology have made possible to utilize remote communication in every aspects of life. As well as technology is exceeded, the need of privacy and security in electronic communications became hot issues. The main goal of this research is to develop and implement data privacy appropriate technique. Privacy preserving data is to develop methods without increasing the risk of misuse of the data used to generate those methods. A number of effective methods for privacy preserving data mining have been proposed. A previously studied perturbation-based PPDM approach introduces random perturbation to individual values to preserve privacy before data are published. Previous solutions of this approach are limited in their tacit assumption of single-level trust on data miners. In this work, by considering assumption and expanding the scope of perturbation-based PPDM to Multilevel Trust (MLT-PPDM). Results the more trusted a data miner is, the less perturbed copy of the data it can access.en_US
dc.language.isoenen_US
dc.publisherRajarambapu Institute of Technology, Rajaramnagaren_US
dc.subjectPrivacyen_US
dc.subjectPrivacy Preserving Data Miningen_US
dc.subjectmultilevel trusten_US
dc.titleMultilevel Trust in Privacy Preserving Data Mining using Random Rotation Based Data Perturbationen_US
dc.typeThesisen_US
Appears in Collections:M.Tech Computer Science & Engineering

Files in This Item:
File Description SizeFormat 
Multilevel Trust in Privacy Preserving Data Mining using Random Rotation Based Data Perturbation .PDF
  Restricted Access
877.01 kBAdobe PDFView/Open Request a copy


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.