Author of the publication

Min-Hashing for Probabilistic Frequent Subtree Feature Spaces.

, , and . DS, volume 9956 of Lecture Notes in Computer Science, page 67-82. (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Effective Privacy Amplification for Secure Classical Communications, , and . CoRR, (2011)Frequent subgraph mining in outerplanar graphs., , and . Data Min. Knowl. Discov., 21 (3): 472-508 (2010)Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract)., , , and . PKDD, volume 4702 of Lecture Notes in Computer Science, page 382-389. Springer, (2007)Incremental Algorithms in Prof-LP., , , and . CC, volume 371 of Lecture Notes in Computer Science, page 93-102. Springer, (1988)A Parallel Permutation Multiplier for a PGM Crypto-chip., , and . CRYPTO, volume 839 of Lecture Notes in Computer Science, page 108-113. Springer, (1994)Noise-based Deterministic Logic and Computing: a Brief Survey., , , , , and . IJUC, 7 (1-2): 101-113 (2011)Probabilistic and exact frequent subtree mining in graphs beyond forests., , and . Machine Learning, 108 (7): 1137-1164 (2019)Frequent Subgraph Mining in Outerplanar Graphs., , and . LWA, volume 1/2006 of Hildesheimer Informatik-Berichte, page 290-296. University of Hildesheim, Institute of Computer Science, (2006)Kernels for Predictive Graph Mining., , and . GfKl, page 75-86. Springer, (2005)Graph Kernels., , and . Encyclopedia of Machine Learning, Springer, (2010)