Probabilistic frequent subtrees for efficient graph classification and retrieval (Q1631835): Difference between revisions

@@ Property / author @@
-Tamás L. Horváth
@@ Property / author: Tamás L. Horváth / rank @@
-Normal rank
@@ Property / author @@
+Tamás L. Horváth
@@ Property / author: Tamás L. Horváth / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+LIBSVM
@@ Property / describes a project that uses: LIBSVM / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10994-017-5688-7
+Normal rank
@@ Property / OpenAlex ID @@
+W2768237932
@@ Property / OpenAlex ID: W2768237932 / rank @@
+Normal rank
@@ Property / cites work @@
+Min-wise independent permutations
@@ Property / cites work: Min-wise independent permutations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5472871
@@ Property / cites work: Q5472871 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3267900
@@ Property / cites work: Q3267900 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Learning Theory and Kernel Machines
@@ Property / cites work: Learning Theory and Kernel Machines / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient frequent connected subgraph mining in graphs of bounded tree-width
+Normal rank
@@ Property / cites work @@
+Frequent Hypergraph Mining
@@ Property / cites work: Frequent Hypergraph Mining / rank @@
+Normal rank
@@ Property / cites work @@
+Faster Subtree Isomorphism
@@ Property / cites work: Faster Subtree Isomorphism / rank @@
+Normal rank
@@ Property / cites work @@
+Q2880988
@@ Property / cites work: Q2880988 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228482
@@ Property / cites work: Q4228482 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:1631835