Our hypothesis is that graph fingerprints based on min-hash values provide a good trade-off among accuracy, efficiency, and compression in real settings. The ...
A graph fingerprinting technique based on the min-hashing scheme, which is a powerful strategy for computing the similarity between large sets of items ...
May 30, 2018 · In this section we evaluate the performance of our approach in terms of precision for retrieving similar molecules for a given active compound ...
Return to Article Details Min-Hash Fingerprints for Graph Kernels: A Trade-off among Accuracy, Efficiency, and Compression Download Download PDF. Thumbnails
Teixeira, C.H.C., Silva, A. and Meira Jr., W. 2012. Min-Hash Fingerprints for Graph Kernels: A Trade-off among Accuracy, Efficiency, and Compression.
Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. CHC Teixeira, A Silva, W Meira Jr. Journal of Information and ...
Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. CHC Teixeira, A Silva, W Meira Jr. Journal of Information and ...
People also ask
What is the most efficient hashing method?
What is fingerprint hash value?
Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. Carlos HC Teixeira, Arlei Silva, Wagner Meira Jr Journal of ...
May 25, 2016 · Min-hash fingerprints for graph kernels: A trade-off among accuracy, efficiency, and compression. Journal of Information and Data Management ...
In this paper, we propose a kernel for graph nodes based on MinHash. The ... Graph Kernels: A Trade-off among Accuracy, Efficiency, and Compression.