High Impact Factor : 4.396 icon | Submit Manuscript Online icon |

Sheltered Information Distribution Publish with Detachment Base Pulling Out

Author(s):

Naveen Kumar. P , PANIMALAR ENGINEERING COLLEGE ; M. K. Raahul Kumar, PANIMALAR ENGINEERING COLLEGE

Keywords:

Nearest Neighbors (NN), Minimum Spanning Tree (MST)

Abstract

The algorithms also preserve important properties of the dataset, which are important for mining operations, and so guarantee both right protection and utility preservation. Watermarking may distort the original distance graph. The Proposed watermarking methodology preserves important distance relationships, such as: the Nearest Neighbors (NN) of each object and the Minimum Spanning Tree (MST) of the original dataset to unreadable file. The System proves fundamental lower and upper bounds on the distance between objects post-watermarking file. In particular, establish are striated isometry property, i.e., tight bounds on the contraction/expansion of the original distances. This analysis is used to design fast algorithms for NN-preserving and MST-preserving watermarking that drastically prunes the vast search space.

Other Details

Paper ID: IJSRDV3I40317
Published in: Volume : 3, Issue : 4
Publication Date: 01/07/2015
Page(s): 598-600

Article Preview

Download Article