Sciweavers

901 search results - page 32 / 181
» On Anonymization of String Data
Sort
View
SPIRE
2010
Springer
14 years 10 months ago
Succinct Representations of Dynamic Strings
The rank and select operations over a string of length n from an alphabet of size σ have been used widely in the design of succinct data structures. In many applications, the stri...
Meng He, J. Ian Munro
NDSS
2007
IEEE
15 years 6 months ago
Playing Devil's Advocate: Inferring Sensitive Information from Anonymized Network Traces
Encouraging the release of network data is central to promoting sound network research practices, though the publication of this data can leak sensitive information about the publ...
Scott E. Coull, Charles V. Wright, Fabian Monrose,...
PKDD
2005
Springer
110views Data Mining» more  PKDD 2005»
15 years 5 months ago
k-Anonymous Patterns
It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in orde...
Maurizio Atzori, Francesco Bonchi, Fosca Giannotti...
IPPS
2003
IEEE
15 years 5 months ago
Approximate Search Engine Optimization for Directory Service
Today, in many practical E-Commerce systems, the real stored data usually are short strings, such as names, addresses, or other information. Searching data within these short stri...
Kai-Hsiang Yang, Chi-Chien Pan, Tzao-Lin Lee
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
16 years 5 days ago
Adaptive duplicate detection using learnable string similarity measures
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
Mikhail Bilenko, Raymond J. Mooney