Tamás Horváth

Publication Activity (10 Years)

Years Active: 1988-2024
Publications (10 Years): 21

Top Topics

Top Venues

Publications

Harish Naik, Jan Polster, Raj Shekhar, Tamás Horváth, György Turán
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations. CoRR (2024)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
Maximal closed set and half-space separations in finite closure systems. Theor. Comput. Sci. 973 (2023)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
A Fast Heuristic for Computing Geodesic Cores in Large Networks. CoRR (2022)
Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel
A generalized Weisfeiler-Lehman graph kernel. Mach. Learn. 111 (7) (2022)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining. LWDA (2022)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
A Fast Heuristic for Computing Geodesic Closures in Large Networks. DS (2022)
Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel
A Generalized Weisfeiler-Lehman Graph Kernel. CoRR (2021)
Eike Stadtländer, Tamás Horváth, Stefan Wrobel
Learning Weakly Convex Sets in Metric Spaces. ECML/PKDD (2) (2021)
Eike Stadtländer, Tamás Horváth, Stefan Wrobel
Learning Weakly Convex Sets in Metric Spaces. CoRR (2021)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
Maximal Closed Set and Half-Space Separations in Finite Closure Systems. CoRR (2020)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
Maximum Margin Separations in Finite Closure Systems. ECML/PKDD (1) (2020)
Daniel Trabold, Tamás Horváth, Stefan Wrobel
Effective approximation of parametrized closure systems over transactional data streams. Mach. Learn. 109 (6) (2020)
Annika Pick, Tamás Horváth, Stefan Wrobel
Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing. LWDA (2019)
Pascal Welke, Tamás Horváth, Stefan Wrobel
Probabilistic and exact frequent subtree mining in graphs beyond forests. Mach. Learn. 108 (7) (2019)
Florian Seiffarth, Tamás Horváth, Stefan Wrobel
Maximal Closed Set and Half-Space Separations in Finite Closure Systems. ECML/PKDD (1) (2019)
Pascal Welke, Tamás Horváth, Stefan Wrobel
Probabilistic frequent subtrees for efficient graph classification and retrieval. Mach. Learn. 107 (11) (2018)
Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel
Mining Tree Patterns with Partially Injective Homomorphisms. ECML/PKDD (2) (2018)
Daniel Trabold, Tamás Horváth
Mining Strongly Closed Itemsets from Data Streams. DS (2017)
Daniel Trabold, Tamás Horváth
Mining Data Streams with Dynamic Confidence Intervals. DaWaK (2016)
Sebastian Bothe, Tamás Horváth
The Partial Weighted Set Cover Problem with Applications to Outlier Detection and Clustering. LWDA (2016)
Pascal Welke, Tamás Horváth, Stefan Wrobel
Min-Hashing for Probabilistic Frequent Subtree Feature Spaces. DS (2016)
Pascal Welke, Tamás Horváth, Stefan Wrobel
Probabilistic Frequent Subtree Kernels. NFMCP (2015)
Daniel Trabold, Mario Boley, Michael Mock, Tamás Horváth
In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint. LWA (2015)
Pascal Welke, Tamás Horváth, Stefan Wrobel
On the Complexity of Frequent Subtree Mining in Very Simple Structures. ILP (2014)
Laszlo B. Kish, Claes-Goran Granqvist, Tamás Horváth, Andreas Klappenecker, He Wen, Sergey M. Bezrukov
Bird's-eye view on Noise-Based Logic. CoRR (2014)
Laszlo B. Kish, Claes-Goran Granqvist, Sergey M. Bezrukov, Tamás Horváth
Brain: Biological noise-based logic. CoRR (2014)
Tamás Horváth, Keisuke Otaki, Jan Ramon
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width. ECML/PKDD (1) (2013)
Tanya Y. Berger-Wolf, Tamás Horváth
Guest editors' foreword: special section on local pattern mining in graph-structured data. Ann. Math. Artif. Intell. 69 (4) (2013)
Tamás Horváth, Laszlo B. Kish, Jacob Scheuer
Effective Privacy Amplification for Secure Classical Communications CoRR (2011)
Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth
Noise-based Deterministic Logic and Computing: a Brief Survey. Int. J. Unconv. Comput. 7 (1-2) (2011)
Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth
Noise-based information processing: Noise-based logic and computing: what do we have so far? CoRR (2011)
Tamás Horváth, Jan Ramon
Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411 (31-33) (2010)
Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth
Noise-based deterministic logic and computing: a brief survey CoRR (2010)
Tamás Horváth, Jan Ramon
Efficient frequent connected subgraph mining in graphs of bounded tree-width. LWA (2010)
Tamás Horváth, Jan Ramon, Stefan Wrobel
Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21 (3) (2010)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Listing closed sets of strongly accessible set systems with applications to data. LWA (2010)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Listing closed sets of strongly accessible set systems with applications to data mining. Theor. Comput. Sci. 411 (3) (2010)
Laszlo B. Kish, Sunil P. Khatri, Tamás Horváth
Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel CoRR (2010)
Tamás Horváth, Gerhard Paass, Frank Reichartz, Stefan Wrobel
A Logic-Based Approach to Relation Extraction from Texts. ILP (2009)
Mario Boley, Tamás Horváth, Stefan Wrobel
Efficient Discovery of Interesting Patterns Based on Strong Closedness. SDM (2009)
Mario Boley, Tamás Horváth, Stefan Wrobel
Efficient discovery of interesting patterns based on strong closedness. Stat. Anal. Data Min. 2 (5-6) (2009)
Laszlo B. Kish, Tamás Horváth
Notes on Recent Approaches Concerning the Kirchhoff-Law-Johnson-Noise-based Secure Key Exchange. CoRR (2009)
Hanna Geppert, Tamás Horváth, Thomas Gärtner, Stefan Wrobel, Jürgen Bajorath
Support-Vector-Machine-Based Ranking Significantly Improves the Effectiveness of Similarity Searching Using 2D Fingerprints and Multiple Reference Compounds. J. Chem. Inf. Model. 48 (4) (2008)
Tamás Horváth, Jan Ramon
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ECML/PKDD (1) (2008)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG (2007)
Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). PKDD (2007)
Tamás Horváth, Akihiro Yamamoto
Foreword. Mach. Learn. 64 (1-3) (2006)
Tamás Horváth, Jan Ramon, Stefan Wrobel
Frequent Subgraph Mining in Outerplanar Graphs. LWA (2006)
Tamás Horváth, Björn Bringmann, Luc De Raedt
Frequent Hypergraph Mining. ILP (2006)
Tamás Horváth, Susanne Hoche, Stefan Wrobel
Effective rule induction from labeled graphs. SAC (2006)
Tamás Horváth, Jan Ramon, Stefan Wrobel
Frequent subgraph mining in outerplanar graphs. KDD (2006)
Stefan Wrobel, Thomas Gärtner, Tamás Horváth
Kernels for Predictive Graph Mining. GfKl (2005)
Tamás Horváth
Cyclic Pattern Kernels Revisited. PAKDD (2005)
Tamás Horváth, Thomas Gärtner, Stefan Wrobel
Cyclic pattern kernels for predictive graph mining. KDD (2004)
Tamás Horváth, Stefan Wrobel, Uta Bohnebeck
Relational Instance-Based Learning with Lists and Terms. Mach. Learn. 43 (1/2) (2001)
Tamás Horváth, György Turán
Learning logic programs with structured background knowledge. Artif. Intell. 128 (1-2) (2001)
Tamás Horváth, Stefan Wrobel
Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity. Discovery Science (2001)
Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Stefan Wrobel
Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. ILP (1999)
Uta Bohnebeck, Werner Sälter, Tamás Horváth, Stefan Wrobel, Dietmar Blohm
Measuring similarity of RNA structures by relational instance-based learning: A first step toward detecting RNA signal structures in silico. German Conference on Bioinformatics (1998)
Uta Bohnebeck, Tamás Horváth, Stefan Wrobel
Term Comparisons in First-Order Similarity Measures. ILP (1998)
Tibor Gyimóthy, Tamás Horváth
Learning Semantic Functions of Attribute Grammars. Nord. J. Comput. 4 (2) (1997)
Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs by Using the Product Homomorphism Method. COLT (1997)
Tamás Horváth, Robert H. Sloan, György Turán
Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop (1996)
Bern Martens, Danny De Schreye, Tamás Horváth
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Theor. Comput. Sci. 122 (1&2) (1994)
Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth, Károly Fábricz
Attribute Grammar Specification for a Natural Language Understanding Interface. WAGA (1990)
Károly Fábricz, Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth
THALES: a Software Package for Plane Geometry Constructions with a Natural Language Interface. COLING (1990)
Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Károly Fábricz
Towards a Multilingual Natural Language Understanding Interface (Extended Abstract). CC (1990)
Tibor Gyimóthy, Tamás Horváth, Ferenc Kocsis, János Toczki
Incremental Algorithms in Prof-LP. CC (1988)