Citace podle APA (7th ed.)

Ertl, O. (2022). ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity. IEEE transactions on knowledge and data engineering, 34(7), 3491-3506. https://doi.org/10.1109/TKDE.2020.3021176

Citace podle Chicago (17th ed.)

Ertl, Otmar. "ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity." IEEE Transactions on Knowledge and Data Engineering 34, no. 7 (2022): 3491-3506. https://doi.org/10.1109/TKDE.2020.3021176.

Citace podle MLA (9th ed.)

Ertl, Otmar. "ProbMinHash - A Class of Locality-Sensitive Hash Algorithms for the (Probability) Jaccard Similarity." IEEE Transactions on Knowledge and Data Engineering, vol. 34, no. 7, 2022, pp. 3491-3506, https://doi.org/10.1109/TKDE.2020.3021176.

Upozornění: Tyto citace jsou generovány automaticky. Nemusí být zcela správně podle citačních pravidel..