( en | de | ru )

 

Disambiguation of "Horvath, Tamas"

Author of the publication

copydeleteadd this publication to your clipboard
Efficient frequent connected subgraph mining in graphs of bounded tree-width

, and . Proceedings of LWA2010 - Workshop-Woche: Lernen, Wissen & Adaptivitaet, Kassel, Germany, (2010)

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.

Tamás Horváth

Tamás Horváth

Andreas Tamas

Christine Tamásy

M'Barek Tamasloukht

 

Other publications of authors with the same name

Probabilistic and exact frequent subtree mining in graphs beyond forests., , and . Mach. Learn., 108 (7): 1137-1164 (2019)A Logic-Based Approach to Relation Extraction from Texts, , , and . Inductive Logic Programming, 19th International Conference, ILP 2009, Leuven, Belgium, (2009)Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures., , and . Theor. Comput. Sci., 122 (1&2): 97-117 (1994)Cyclic pattern kernels for predictive graph mining, , and . Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), page 158--167. (2004)Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing., , and . LWDA, volume 2454 of CEUR Workshop Proceedings, page 156-160. CEUR-WS.org, (2019)A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining., , and . LWDA, volume 3341 of CEUR Workshop Proceedings, page 21-32. CEUR-WS.org, (2022)Maximal Closed Set and Half-Space Separations in Finite Closure Systems, , and . (2019)Mining Tree Patterns with Partially Injective Homomorphisms., , , and . ECML/PKDD (2), volume 11052 of Lecture Notes in Computer Science, page 585-601. Springer, (2018)Maximum Margin Separations in Finite Closure Systems., , and . ECML/PKDD (1), volume 12457 of Lecture Notes in Computer Science, page 3-18. Springer, (2020)Learning Weakly Convex Sets in Metric Spaces., , and . ECML/PKDD (2), volume 12976 of Lecture Notes in Computer Science, page 200-216. Springer, (2021)