Sciweavers

2355 search results - page 12 / 471
» Anonymizing Temporal Data
Sort
View
SDM
2008
SIAM
164views Data Mining» more  SDM 2008»
13 years 9 months ago
Randomizing Social Networks: a Spectrum Preserving Approach
Understanding the general properties of real social networks has gained much attention due to the proliferation of networked data. The nodes in the network are the individuals and...
Xiaowei Ying, Xintao Wu
CACM
1999
138views more  CACM 1999»
13 years 7 months ago
Onion Routing
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...
David M. Goldschlag, Michael G. Reed, Paul F. Syve...
VLDB
2008
ACM
147views Database» more  VLDB 2008»
14 years 7 months ago
Providing k-anonymity in data mining
In this paper we present extended definitions of k-anonymity and use them to prove that a given data mining model does not violate the k-anonymity of the individuals represented in...
Arik Friedman, Ran Wolff, Assaf Schuster
DEXA
2004
Springer
106views Database» more  DEXA 2004»
14 years 28 days ago
A Graph-Based Data Model to Represent Transaction Time in Semistructured Data
Abstract. In this paper we propose the Graphical sEmistructured teMporal data model (GEM), which is based on labeled graphs and allows one to represent in a uniform way semistructu...
Carlo Combi, Barbara Oliboni, Elisa Quintarelli