Edge Computing by Taheri Javid;Deng Shuiguang;

Author:Taheri, Javid;Deng, Shuiguang;
Language: eng
Format: epub
Publisher: Institution of Engineering & Technology
Published: 2020-12-05T00:00:00+00:00

10.4.3 Similarity function

We examined five token-based similarity functions: Hamming Distance [16], Dice's Coefficient [17], Damerau-Levenshtein (DL) [18], Jaccard [18], and Jaro-Winkler [18].

In this experiment, we started with two identical 128-bit strings. We had 128 iterations to alter one of them, each flipping one random bit that was not previously flipped. At the end of each iteration, we compared the two strings using the functions mentioned above. Figure 10.9(a) depicts the string comparison at each iteration. Although Hamming distance and Jaccard were consistent with key changes, we chose Hamming distance for its throughput superiority as shown in Figure 10.9(b).

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.