Privacy-Preserving Data Publishing
An Overview
Article
Optimal location query in road networks is a basic operation in the location intelligence applications. Given a set of clients and servers on a road network, the purpose of optimal location query is to obtain ...
Chapter and Conference Paper
The notion of node similarity is useful in many real-world applications. Many existing similarity measurements such as SimRank and its variants have been proposed. Among these measurements, most capture the st...
Reference Work Entry In depth
Chapter and Conference Paper
Online social network (OSN) analysis has attracted much attention in recent years. Edge and triangle counts are both fundamental properties in OSNs. However, for many OSNs, one can only access parts of the net...
Living Reference Work Entry In depth
Chapter and Conference Paper
Given a social network, we study the problem of finding \(k\) seeds that maximize the dissemination of information. B...
Article
Bichromatic reverse nearest neighbor (BRNN) has been extensively studied in spatial database literature. In this paper, we study a related problem called MaxBRNN: find an optimal region that maximizes the size...
Article
Nowadays “live” content, such as weblog, wikipedia, and news, is ubiquitous in the Internet. Providing users with relevant content in a timely manner becomes a challenging problem. Differing from Web search te...
Article
This paper studies the problem of processing supergraph queries, that is, given a database containing a set of graphs, find all the graphs in the database of which the query graph is a supergraph. Existing works ...
Chapter
In addition to relational tables and graphs, there are other kinds of data such as spatial and transactional data. In this chapter, we describe privacy models and anonymization techniques over theses data types.
Chapter
Privacy preservation has become a major issue in many data mining applications. When a data set is released to other parties for data mining, privacy-preserving techniques are often required to reduce the poss...
Chapter and Conference Paper
Previous methods on mining association rules require users to input a minimum support threshold. However, there can be too many or too few resulting rules if the threshold is set inappropriately. It is difficu...
Chapter
In previous chapters, we studied the privacy issues of publishing relational tables. In this chapter, we consider the same issues in publishing graph data. Graph data has emerged as a significant topic in rece...
Chapter
Privacy-preserving data publishing is a promising research area since individual privacy has become a major concern. In this book, we first discussed a variety of anonymization techniques over traditional rela...
Chapter
In this chapter, we discuss some fundamental concepts used in anonymizing data. In order to better describe the concepts, we illustrate them using the relational model of data.
Chapter
In the previous chapter, we studied how to anonymize data when they are published only once. However, in practice, a data owner typically publishes data repeatedly over time. One straightforward method to addr...
Book
Chapter
In Chapter 2, we discussed some fundamental concepts of data publishing. In this chapter, we describe the details of one-time data publishing based on these concepts.
Reference Work Entry In depth
Chapter and Conference Paper
International Workshop on Privacy-Preserving Data Analysis (PPDA) 2009 took place at Brisbane, Australia on 21st April, 2009. There were two sessions for this workshop with 2 paper presentations in the first s...