A crucial privacy-driven issue nowadays is re-identifying anonymized social networks by mapping them to correlated cross-domain auxiliary networks. Prior works are typically based on modeling social networks as random graphs representing users and their relations, and subsequently quantify the quality of mappings through cost functions that are proposed without sufficient rationale. Also, it re...

Abstract We present a novel benchmark and associated evaluation metrics for assessing the performance of text anonymization methods. Text anonymization, defined as task editing document to prevent disclosure personal information, currently suffers from shortage privacy-oriented annotated resources, making it difficult properly evaluate level privacy protection offered by various This paper pres...

In the present scenario, due to regulations of data privacy, sharing with other organization for research or any medical purpose becomes a big hindrance different healthcare organizations. To preserve privacy patients seems like crucial challenge Healthcare Centre. Numerous techniques are used such as perturbation, anonymization, cryptography, etc. Anonymization is well known practical solution...

In privacy preserving data mining, anonymization based approaches have been used to preserve the privacy of an individual. Existing literature addresses various anonymization based approaches for preserving the sensitive private information of an individual. The k-anonymity model is one of the widely used anonymization based approach. However, the anonymization based approaches suffer from the ...

It appears that everybody observes with special attention, the occurrence of big data and its practice. There is no disbelief that the big data uprising has instigated. Though the practices of big data propose favorable business paybacks, there are substantial privacy implications. Multidimensional generalization anonymization scheme is an actual method for data privacy preservation. Top-Down S...

Skeleton-based action recognition attracts practitioners and researchers due to the lightweight, compact nature of datasets. Compared with RGB-video-based recognition, skeleton-based is a safer way protect privacy subjects while having competitive performance. However, improvements in skeleton algorithms as well motion depth sensors, more details characteristics can be preserved dataset, leadin...

The Min Anonymous-Edge-Rotation problem asks for an input graph G and a positive integer k to find minimum number of edge rotations that transform into such each vertex there are at least k−1 other vertices the same degree (a k-degree-anonymous graph). In this paper, we prove is NP-hard even k=n/q, where n order q any integer, q≥3. We argue under some constrains on edges in k, polynomial-time 2...

Motivated by a strongly growing interest in graph anonymization in the data mining and databases communities over the last five years, we study the NP-hard problem of making a graph k-anonymous by adding as few edges as possible. Herein, a graph is k-anonymous if for every vertex in the graph there are at least k − 1 other vertices of the same degree. Our algorithmic results shed light on the p...