Review Paper-Social networking with protecting sensitive labels in data Anonymization

Abstract

The use of social network sites goes on increasing such as facebook, twitter, linkedin, live journal social network and wiki vote network. By using this, users find that they can obtain more and more useful information such as the user performance, private growth, dispersal of disease etc. It is also important that users private information should not get disclose. Thus, Now a days it is important to protect users privacy and utilization of social network data are challenging. Most of developer developed privacy models such as K-anonymity for protecting node or vertex reidentification in structure information. Users privacy models get forced by other user, if a group of node largely share the same sensitive labels then other users easily find out one’s data ,so that structure anonymization method is not purely protected. There are some previous approaches such as edge editing or node clustering .Here structural information as well as sensitive labels of individuals get considered using K-degree l-deversityanonymity model. The new approach in anonymization methodology is adding noise nodes. By considering the least distortion to graph properties,the development of new algorithm using noise nodes into original graph. Most important it will provide an analysis of no.of noise nodes added and their impact on important graph property.