Tamás Horváth

According to our database, Tamás Horváth authored at least 63 papers between 1988 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2024

Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations.

Harish Naik, Jan Polster, Raj Shekhar, Tamás Horváth, György Turán

CoRR, 2024

2023

Maximal closed set and half-space separations in finite closure systems.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Theor. Comput. Sci., September, 2023

2022

A generalized Weisfeiler-Lehman graph kernel.

Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel

Mach. Learn., 2022

A Fast Heuristic for Computing Geodesic Cores in Large Networks.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

CoRR, 2022

A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the LWDA 2022 Workshops: FGWM, 2022

A Fast Heuristic for Computing Geodesic Closures in Large Networks.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the Discovery Science - 25th International Conference, 2022

2021

Learning Weakly Convex Sets in Metric Spaces.

Eike Stadtländer, Tamás Horváth, Stefan Wrobel

Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021

2020

Effective approximation of parametrized closure systems over transactional data streams.

Daniel Trabold, Tamás Horváth, Stefan Wrobel

Mach. Learn., 2020

Maximum Margin Separations in Finite Closure Systems.

Florian Seiffarth, Tamás Horváth, Stefan Wrobel

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020

2019

Probabilistic and exact frequent subtree mining in graphs beyond forests.

Pascal Welke, Tamás Horváth, Stefan Wrobel

Mach. Learn., 2019

Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing.

Annika Pick, Tamás Horváth, Stefan Wrobel

Proceedings of the Conference on "Lernen, Wissen, Daten, Analysen", Berlin, Germany, September 30, 2019

2018

Probabilistic frequent subtrees for efficient graph classification and retrieval.

Pascal Welke, Tamás Horváth, Stefan Wrobel

Mach. Learn., 2018

Mining Tree Patterns with Partially Injective Homomorphisms.

Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018

2017

Learning from Structured Data.

Tamás Horváth, Stefan Wrobel

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Graph Kernels.

Thomas Gärtner, Tamás Horváth, Stefan Wrobel

Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017

Mining Strongly Closed Itemsets from Data Streams.

Daniel Trabold, Tamás Horváth

Proceedings of the Discovery Science - 20th International Conference, 2017

2016

The Partial Weighted Set Cover Problem with Applications to Outlier Detection and Clustering.

Sebastian Bothe, Tamás Horváth

Proceedings of the Conference "Lernen, 2016

Min-Hashing for Probabilistic Frequent Subtree Feature Spaces.

Pascal Welke, Tamás Horváth, Stefan Wrobel

Proceedings of the Discovery Science - 19th International Conference, 2016

Mining Data Streams with Dynamic Confidence Intervals.

Daniel Trabold, Tamás Horváth

Proceedings of the Big Data Analytics and Knowledge Discovery, 2016

2015

Probabilistic Frequent Subtree Kernels.

Pascal Welke, Tamás Horváth, Stefan Wrobel

Proceedings of the New Frontiers in Mining Complex Patterns - 4th International Workshop, 2015

In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint.

Daniel Trabold, Mario Boley, Michael Mock, Tamás Horváth

Proceedings of the LWA 2015 Workshops: KDML, 2015

2014

Bird's-eye view on Noise-Based Logic.

Laszlo B. Kish, Claes-Goran Granqvist, Tamás Horváth, Andreas Klappenecker, He Wen, Sergey M. Bezrukov

CoRR, 2014

Brain: Biological noise-based logic.

Laszlo B. Kish, Claes-Goran Granqvist, Sergey M. Bezrukov, Tamás Horváth

CoRR, 2014

On the Complexity of Frequent Subtree Mining in Very Simple Structures.

Pascal Welke, Tamás Horváth, Stefan Wrobel

Proceedings of the Inductive Logic Programming - 24th International Conference, 2014

2013

Guest editors' foreword: special section on local pattern mining in graph-structured data.

Tanya Y. Berger-Wolf, Tamás Horváth

Ann. Math. Artif. Intell., 2013

Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width.

Tamás Horváth, Keisuke Otaki, Jan Ramon

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013

2011

Noise-based Deterministic Logic and Computing: a Brief Survey.

Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth

Int. J. Unconv. Comput., 2011

Noise-based information processing: Noise-based logic and computing: what do we have so far?

Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth

CoRR, 2011

Effective Privacy Amplification for Secure Classical Communications

Tamás Horváth, Laszlo B. Kish, Jacob Scheuer

CoRR, 2011

2010

Learning from Structured Data.

Tamás Horváth, Stefan Wrobel

Proceedings of the Encyclopedia of Machine Learning, 2010

Graph Kernels.

Thomas Gärtner, Tamás Horváth, Stefan Wrobel

Proceedings of the Encyclopedia of Machine Learning, 2010

Efficient frequent connected subgraph mining in graphs of bounded tree-width.

Tamás Horváth, Jan Ramon

Theor. Comput. Sci., 2010

Listing closed sets of strongly accessible set systems with applications to data mining.

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel

Theor. Comput. Sci., 2010

Frequent subgraph mining in outerplanar graphs.

Tamás Horváth, Jan Ramon, Stefan Wrobel

Data Min. Knowl. Discov., 2010

Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel

Laszlo B. Kish, Sunil P. Khatri, Tamás Horváth

CoRR, 2010

Listing closed sets of strongly accessible set systems with applications to data.

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel

Proceedings of the LWA 2010, 2010

2009

Efficient discovery of interesting patterns based on strong closedness.

Mario Boley, Tamás Horváth, Stefan Wrobel

Stat. Anal. Data Min., 2009

Notes on Recent Approaches Concerning the Kirchhoff-Law-Johnson-Noise-based Secure Key Exchange.

Laszlo B. Kish, Tamás Horváth

CoRR, 2009

A Logic-Based Approach to Relation Extraction from Texts.

Tamás Horváth, Gerhard Paass, Frank Reichartz, Stefan Wrobel

Proceedings of the Inductive Logic Programming, 19th International Conference, 2009

2008

Support-Vector-Machine-Based Ranking Significantly Improves the Effectiveness of Similarity Searching Using 2D Fingerprints and Multiple Reference Compounds.

Hanna Geppert, Tamás Horváth, Thomas Gärtner, Stefan Wrobel, Jürgen Bajorath

J. Chem. Inf. Model., 2008

Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.

Tamás Horváth, Jan Ramon

Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008

2007

Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel

Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007

Efficient Closed Pattern Mining in Strongly Accessible Set Systems.

Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel

Proceedings of the Mining and Learning with Graphs, 2007

2006

Foreword.

Tamás Horváth, Akihiro Yamamoto

Mach. Learn., 2006

Effective rule induction from labeled graphs.

Tamás Horváth, Susanne Hoche, Stefan Wrobel

Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006

Frequent Hypergraph Mining.

Tamás Horváth, Björn Bringmann, Luc De Raedt

Proceedings of the Inductive Logic Programming, 16th International Conference, 2006

2005

Cyclic Pattern Kernels Revisited.

Tamás Horváth

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005

Kernels for Predictive Graph Mining.

Stefan Wrobel, Thomas Gärtner, Tamás Horváth

Proceedings of the From Data and Information Analysis to Knowledge Engineering, 2005

2004

Cyclic pattern kernels for predictive graph mining.

Tamás Horváth, Thomas Gärtner, Stefan Wrobel

Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004

2001

Relational Instance-Based Learning with Lists and Terms.

Tamás Horváth, Stefan Wrobel, Uta Bohnebeck

Mach. Learn., 2001

Learning logic programs with structured background knowledge.

Tamás Horváth, György Turán

Artif. Intell., 2001

Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity.

Tamás Horváth, Stefan Wrobel

Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001

1999

Application of Different Learning Methods to Hungarian Part-of-Speech Tagging.

Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Stefan Wrobel

Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999

1998

Term Comparisons in First-Order Similarity Measures.

Uta Bohnebeck, Tamás Horváth, Stefan Wrobel

Proceedings of the Inductive Logic Programming, 8th International Workshop, 1998

Measuring similarity of RNA structures by relational instance-based learning: A first step toward detecting RNA signal structures in silico.

Uta Bohnebeck, Werner Sälter, Tamás Horváth, Stefan Wrobel, Dietmar Blohm

Proceedings of the German Conference on Bioinformatics, 1998

1997

Learning Semantic Functions of Attribute Grammars.

Tibor Gyimóthy, Tamás Horváth

Nord. J. Comput., 1997

Learning Logic Programs by Using the Product Homomorphism Method.

Tamás Horváth, Robert H. Sloan, György Turán

Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997

1996

Learning Logic Programs with Random Classification Noise.

Tamás Horváth, Robert H. Sloan, György Turán

Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996

1994

Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures.

Bern Martens, Danny De Schreye, Tamás Horváth

Theor. Comput. Sci., 1994

1990

Attribute Grammar Specification for a Natural Language Understanding Interface.

Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth, Károly Fábricz

Proceedings of the Attribute Grammars and their Applications, 1990

THALES: a Software Package for Plane Geometry Constructions with a Natural Language Interface.

Károly Fábricz, Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth

Proceedings of the 13th International Conference on Computational Linguistics, 1990

Towards a Multilingual Natural Language Understanding Interface (Extended Abstract).

Tamás Horváth, Zoltán Alexin, Tibor Gyimóthy, Károly Fábricz

Proceedings of the Compiler Compilers, 1990

1988

Incremental Algorithms in Prof-LP.

Tibor Gyimóthy, Tamás Horváth, Ferenc Kocsis, János Toczki

Proceedings of the Compiler Compilers and High Speed Compilation, 1988