Name
Abstract | ||
|---|---|---|
Estimating set similarity and detecting highly similar sets are fundamental problems in areas such as databases and machine learning. MinHash is a well-known technique for approximating Jaccard similarity of sets and has been successfully used for many applications. Its two compressed versions, $b$<mml:math xmlns:mml="http://www.w... |
Year | DOI | Venue |
|---|---|---|
2021 | 10.1109/TKDE.2020.2969423 | IEEE Transactions on Knowledge and Data Engineering |
Keywords | DocType | Volume |
Registers,Estimation error,Time complexity,Trajectory,Databases,Machine learning | Journal | 33 |
Issue | ISSN | Citations |
10 | 1041-4347 | 0 |
PageRank | References | Authors |
0.34 | 0 | 8 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yiyan Qi | 1 | 14 | 3.24 |
| Ping-Hui Wang | 2 | 236 | 33.39 |
| Yuanming Zhang | 3 | 5 | 4.48 |
| Qiaozhu Zhai | 4 | 12 | 3.75 |
| Chenxu Wang | 5 | 10 | 6.22 |
| Guangjian Tian | 6 | 14 | 4.56 |
| John C.S. Lui | 7 | 3680 | 279.85 |
| X. Guan | 8 | 1169 | 137.97 |