Sciweavers

901 search results - page 33 / 181
» On Anonymization of String Data
Sort
View
CBMS
2006
IEEE
15 years 3 months ago
Automatic Extraction of Bibliographic Information from Biomedical Online Journal Articles Using a String Matching Algorithm
A system has been developed to extract bibliographic data (grant numbers and databank accession numbers) from online biomedical journal articles for the National Library of Medici...
Jongwoo Kim, Daniel X. Le, George R. Thoma
VLDB
2005
ACM
136views Database» more  VLDB 2005»
15 years 5 months ago
On k-Anonymity and the Curse of Dimensionality
In recent years, the wide availability of personal data has made the problem of privacy preserving data mining an important one. A number of methods have recently been proposed fo...
Charu C. Aggarwal
DAWAK
2006
Springer
15 years 3 months ago
Priority-Based k-Anonymity Accomplished by Weighted Generalisation Structures
Abstract. Biobanks are gaining in importance by storing large collections of patient's clinical data (e.g. disease history, laboratory parameters, diagnosis, life style) toget...
Konrad Stark, Johann Eder, Kurt Zatloukal
ETRICS
2006
15 years 3 months ago
Revocable Anonymity
Anonymity services in the EU may be forced by the new EU data retention directive to collect connection data and deanonymise some of their users in case of serious crimes. For this...
Stefan Köpsell, Rolf Wendolsky, Hannes Federr...
CPM
2006
Springer
175views Combinatorics» more  CPM 2006»
15 years 3 months ago
On-Line Linear-Time Construction of Word Suffix Trees
Abstract. Suffix trees are the key data structure for text string matching, and are used in wide application areas such as bioinformatics and data compression. Sparse suffix trees ...
Shunsuke Inenaga, Masayuki Takeda