Tamás Horváth

84 papers A* 3A 1B 18Misc 1Journal 34Unranked 23

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