Search NASA⌕ Search

Engineering topics

Larimer, Curtis

Publications and source records attributed to Larimer, Curtis.

At least 1,135 records · Page 63

Bloom filter de-identifier

A bloom filter is a binary data structure that is designed to be memory efficient and able to determine whether an element is present in a set. The bloom filter is a probabilistic data structure. It can tell you whether an element, or set of elements, is likely to exist within a set. It can also tell you whether an element, or set of elements, does not exist within a set. So false positives are probable, but false negatives are not. Our novel approach utilizes the bloom filter to determine how many bigrams (two letter sequence) each value has in common. The resulting metric approximates the relative similarity of two text values.

Bleeker, Amelia↗

K-anonymization

New algorithms to de-identify geolocations. A unique feature of our algorithms is the ability to compare de-identified values that are similar but not the same

Bleeker, Amelia↗

Name Normalizer

Our name normalizer and enrichment micro-service address the shortcomings of standard text normalization. Initially the text input is split into tokens. This process takes into account some conventions of formatting. Any dashes present between two tokens preserves the relationship of those two tokens. Conversely a comma between two tokens ensures that the separation between the two tokens is maintained. The order of tokens is also preserved. Standard text normalization (conversion to lowercase, trimming extra white space, and canonicalization) is then applied to the tokens. Once normalized every unique and sequence of tokens is given confidence values by comparing the normalized values to publicly available data.

Bleeker, Amelia↗