Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTamás Horváth 0001
Person information
- affiliation: University of Bonn, Germany
- affiliation: Fraunhofer IAIS, St. Augustin, Germany
Other persons with the same name
- Tamás Horváth 0002 — University of Duisburg-Essen, Germany
- Tamás Horváth 0003 — Otto-von-Guericke University Magdeburg, Germany
- Tamás Horváth 0004 — Technical University of Budapest, Department of Process Control, Hungary
- Tamás Horváth 0005 — Hungarian Academy of Sciences, Institute of Enzymology, Budapest, Hungary
- Tamás Horváth 0006 — University of Szeged, Centre of Cardiology, Hungary
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i12]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 abs/2403.07849 (2024)- 2023
- [j17]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
Maximal closed set and half-space separations in finite closure systems. Theor. Comput. Sci. 973: 114105 (2023) - 2022
- [j16]Till Hendrik Schulz
, Tamás Horváth, Pascal Welke, Stefan Wrobel:
A generalized Weisfeiler-Lehman graph kernel. Mach. Learn. 111(7): 2601-2629 (2022) - [c39]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
A Fast Heuristic for Computing Geodesic Closures in Large Networks. DS 2022: 476-490 - [c38]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: 21-32 - [i11]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
A Fast Heuristic for Computing Geodesic Cores in Large Networks. CoRR abs/2206.07350 (2022) - 2021
- [c37]Eike Stadtländer, Tamás Horváth, Stefan Wrobel:
Learning Weakly Convex Sets in Metric Spaces. ECML/PKDD (2) 2021: 200-216 - [i10]Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel:
A Generalized Weisfeiler-Lehman Graph Kernel. CoRR abs/2101.08104 (2021) - [i9]Eike Stadtländer, Tamás Horváth, Stefan Wrobel:
Learning Weakly Convex Sets in Metric Spaces. CoRR abs/2105.06251 (2021) - 2020
- [j15]Daniel Trabold, Tamás Horváth, Stefan Wrobel:
Effective approximation of parametrized closure systems over transactional data streams. Mach. Learn. 109(6): 1147-1177 (2020) - [c36]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
Maximum Margin Separations in Finite Closure Systems. ECML/PKDD (1) 2020: 3-18 - [i8]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
Maximal Closed Set and Half-Space Separations in Finite Closure Systems. CoRR abs/2001.04417 (2020)
2010 – 2019
- 2019
- [j14]Pascal Welke, Tamás Horváth, Stefan Wrobel:
Probabilistic and exact frequent subtree mining in graphs beyond forests. Mach. Learn. 108(7): 1137-1164 (2019) - [c35]Annika Pick, Tamás Horváth, Stefan Wrobel:
Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing. LWDA 2019: 156-160 - [c34]Florian Seiffarth, Tamás Horváth, Stefan Wrobel:
Maximal Closed Set and Half-Space Separations in Finite Closure Systems. ECML/PKDD (1) 2019: 21-37 - 2018
- [j13]Pascal Welke, Tamás Horváth, Stefan Wrobel:
Probabilistic frequent subtrees for efficient graph classification and retrieval. Mach. Learn. 107(11): 1847-1873 (2018) - [c33]Till Hendrik Schulz, Tamás Horváth, Pascal Welke, Stefan Wrobel:
Mining Tree Patterns with Partially Injective Homomorphisms. ECML/PKDD (2) 2018: 585-601 - 2017
- [c32]Daniel Trabold, Tamás Horváth:
Mining Strongly Closed Itemsets from Data Streams. DS 2017: 251-266 - [r4]Thomas Gärtner, Tamás Horváth, Stefan Wrobel:
Graph Kernels. Encyclopedia of Machine Learning and Data Mining 2017: 579-581 - [r3]Tamás Horváth, Stefan Wrobel:
Learning from Structured Data. Encyclopedia of Machine Learning and Data Mining 2017: 712-715 - 2016
- [c31]Daniel Trabold, Tamás Horváth:
Mining Data Streams with Dynamic Confidence Intervals. DaWaK 2016: 99-113 - [c30]Pascal Welke, Tamás Horváth, Stefan Wrobel:
Min-Hashing for Probabilistic Frequent Subtree Feature Spaces. DS 2016: 67-82 - [c29]Sebastian Bothe, Tamás Horváth:
The Partial Weighted Set Cover Problem with Applications to Outlier Detection and Clustering. LWDA 2016: 335-346 - 2015
- [c28]Daniel Trabold, Mario Boley, Michael Mock, Tamás Horváth:
In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint. LWA 2015: 93-104 - [c27]Pascal Welke, Tamás Horváth, Stefan Wrobel:
Probabilistic Frequent Subtree Kernels. NFMCP 2015: 179-193 - 2014
- [c26]Pascal Welke, Tamás Horváth, Stefan Wrobel:
On the Complexity of Frequent Subtree Mining in Very Simple Structures. ILP 2014: 194-209 - [i7]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 abs/1408.4076 (2014) - [i6]Laszlo B. Kish, Claes-Goran Granqvist, Sergey M. Bezrukov, Tamás Horváth:
Brain: Biological noise-based logic. CoRR abs/1408.4077 (2014) - 2013
- [j12]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): 313-314 (2013) - [c25]Tamás Horváth, Keisuke Otaki, Jan Ramon:
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width. ECML/PKDD (1) 2013: 622-637 - 2011
- [j11]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): 101-113 (2011) - [i5]Tamás Horváth, Laszlo B. Kish, Jacob Scheuer:
Effective Privacy Amplification for Secure Classical Communications. CoRR abs/1101.4264 (2011) - [i4]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 abs/1102.2256 (2011) - 2010
- [j10]Tamás Horváth, Jan Ramon, Stefan Wrobel:
Frequent subgraph mining in outerplanar graphs. Data Min. Knowl. Discov. 21(3): 472-508 (2010) - [j9]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): 691-700 (2010) - [j8]Tamás Horváth, Jan Ramon:
Efficient frequent connected subgraph mining in graphs of bounded tree-width. Theor. Comput. Sci. 411(31-33): 2784-2797 (2010) - [c24]Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel:
Listing closed sets of strongly accessible set systems with applications to data. LWA 2010: 33 - [c23]Tamás Horváth, Jan Ramon:
Efficient frequent connected subgraph mining in graphs of bounded tree-width. LWA 2010: 75 - [r2]Thomas Gärtner, Tamás Horváth, Stefan Wrobel:
Graph Kernels. Encyclopedia of Machine Learning 2010: 467-469 - [r1]Tamás Horváth, Stefan Wrobel:
Learning from Structured Data. Encyclopedia of Machine Learning 2010: 580-584 - [i3]Laszlo B. Kish, Sunil P. Khatri, Tamás Horváth:
Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel. CoRR abs/1005.1560 (2010) - [i2]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 abs/1007.5282 (2010)
2000 – 2009
- 2009
- [j7]Mario Boley, Tamás Horváth, Stefan Wrobel:
Efficient discovery of interesting patterns based on strong closedness. Stat. Anal. Data Min. 2(5-6): 346-360 (2009) - [c22]Tamás Horváth, Gerhard Paass, Frank Reichartz, Stefan Wrobel:
A Logic-Based Approach to Relation Extraction from Texts. ILP 2009: 34-48 - [c21]Mario Boley, Tamás Horváth, Stefan Wrobel:
Efficient Discovery of Interesting Patterns Based on Strong Closedness. SDM 2009: 1002-1013 - [i1]Laszlo B. Kish, Tamás Horváth:
Notes on Recent Approaches Concerning the Kirchhoff-Law-Johnson-Noise-based Secure Key Exchange. CoRR abs/0903.2071 (2009) - 2008
- [j6]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): 742-746 (2008) - [c20]Tamás Horváth, Jan Ramon:
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. ECML/PKDD (1) 2008: 520-535 - [e2]Jean-François Boulicaut, Michael R. Berthold, Tamás Horváth:
Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings. Lecture Notes in Computer Science 5255, Springer 2008, ISBN 978-3-540-88410-1 [contents] - 2007
- [c19]Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel:
Efficient Closed Pattern Mining in Strongly Accessible Set Systems. MLG 2007 - [c18]Mario Boley, Tamás Horváth, Axel Poigné, Stefan Wrobel:
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). PKDD 2007: 382-389 - 2006
- [j5]Tamás Horváth, Akihiro Yamamoto:
Foreword. Mach. Learn. 64(1-3): 3-4 (2006) - [c17]Tamás Horváth, Björn Bringmann, Luc De Raedt:
Frequent Hypergraph Mining. ILP 2006: 244-259 - [c16]Tamás Horváth, Jan Ramon, Stefan Wrobel:
Frequent subgraph mining in outerplanar graphs. KDD 2006: 197-206 - [c15]Tamás Horváth, Jan Ramon, Stefan Wrobel:
Frequent Subgraph Mining in Outerplanar Graphs. LWA 2006: 290-296 - [c14]Tamás Horváth, Susanne Hoche, Stefan Wrobel:
Effective rule induction from labeled graphs. SAC 2006: 611-616 - 2005
- [c13]Stefan Wrobel, Thomas Gärtner, Tamás Horváth:
Kernels for Predictive Graph Mining. GfKl 2005: 75-86 - [c12]Tamás Horváth:
Cyclic Pattern Kernels Revisited. PAKDD 2005: 791-801 - 2004
- [c11]Tamás Horváth, Thomas Gärtner, Stefan Wrobel:
Cyclic pattern kernels for predictive graph mining. KDD 2004: 158-167 - 2003
- [e1]Tamás Horváth:
Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings. Lecture Notes in Computer Science 2835, Springer 2003, ISBN 3-540-20144-0 [contents] - 2001
- [j4]Tamás Horváth, György Turán:
Learning logic programs with structured background knowledge. Artif. Intell. 128(1-2): 31-97 (2001) - [j3]Tamás Horváth, Stefan Wrobel, Uta Bohnebeck:
Relational Instance-Based Learning with Lists and Terms. Mach. Learn. 43(1/2): 53-80 (2001) - [c10]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: 100-112
1990 – 1999
- 1999
- [c9]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: 128-139 - 1998
- [c8]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 - [c7]Uta Bohnebeck, Tamás Horváth, Stefan Wrobel:
Term Comparisons in First-Order Similarity Measures. ILP 1998: 65-79 - 1997
- [j2]Tibor Gyimóthy, Tamás Horváth:
Learning Semantic Functions of Attribute Grammars. Nord. J. Comput. 4(2): 287-302 (1997) - [c6]Tamás Horváth, Robert H. Sloan, György Turán:
Learning Logic Programs by Using the Product Homomorphism Method. COLT 1997: 10-20 - 1996
- [c5]Tamás Horváth, Robert H. Sloan, György Turán:
Learning Logic Programs with Random Classification Noise. Inductive Logic Programming Workshop 1996: 315-336 - 1994
- [j1]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): 97-117 (1994) - 1990
- [c4]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: 217-218 - [c3]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: 44-46 - [c2]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: 313-326
1980 – 1989
- 1988
- [c1]Tibor Gyimóthy, Tamás Horváth, Ferenc Kocsis, János Toczki:
Incremental Algorithms in Prof-LP. CC 1988: 93-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 20:57 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
