The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Tamás Horváth 0001" ( http://dblp.L3S.de/Authors/Tamás_Horváth_0001 )

URL (Homepage):  https://orcid.org/0000-0001-6852-6939  Author page on DBLP  Author page in RDF  Community of Tamás Horváth 0001 in ASPL-2

Publication years (Num. hits)
1988-2003 (15) 2004-2009 (17) 2010-2014 (17) 2015-2019 (12)
Publication types (Num. hits)
article(21) incollection(4) inproceedings(34) proceedings(2)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
The graphs summarize 11 occurrences of 7 keywords

Results
Found 62 publication records. Showing 61 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Pascal Welke, Tamás Horváth 0001, Stefan Wrobel Probabilistic and exact frequent subtree mining in graphs beyond forests. Search on Bibsonomy Machine Learning The full citation details ... 2019 DBLP  DOI  BibTeX  RDF
1Annika Pick, Tamás Horváth 0001, Stefan Wrobel Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing. Search on Bibsonomy LWDA The full citation details ... 2019 DBLP  BibTeX  RDF
1Pascal Welke, Tamás Horváth 0001, Stefan Wrobel Probabilistic frequent subtrees for efficient graph classification and retrieval. Search on Bibsonomy Machine Learning The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Till Hendrik Schulz, Tamás Horváth 0001, Pascal Welke, Stefan Wrobel Mining Tree Patterns with Partially Injective Homomorphisms. Search on Bibsonomy ECML/PKDD (2) The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Thomas Gärtner, Tamás Horváth 0001, Stefan Wrobel Graph Kernels. Search on Bibsonomy Encyclopedia of Machine Learning and Data Mining The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Stefan Wrobel Learning from Structured Data. Search on Bibsonomy Encyclopedia of Machine Learning and Data Mining The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Daniel Trabold, Tamás Horváth 0001 Mining Strongly Closed Itemsets from Data Streams. Search on Bibsonomy DS The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Pascal Welke, Tamás Horváth 0001, Stefan Wrobel Min-Hashing for Probabilistic Frequent Subtree Feature Spaces. Search on Bibsonomy DS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Daniel Trabold, Tamás Horváth 0001 Mining Data Streams with Dynamic Confidence Intervals. Search on Bibsonomy DaWaK The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Sebastian Bothe, Tamás Horváth 0001 The Partial Weighted Set Cover Problem with Applications to Outlier Detection and Clustering. Search on Bibsonomy LWDA The full citation details ... 2016 DBLP  BibTeX  RDF
1Pascal Welke, Tamás Horváth 0001, Stefan Wrobel Probabilistic Frequent Subtree Kernels. Search on Bibsonomy NFMCP The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Daniel Trabold, Mario Boley, Michael Mock, Tamás Horváth 0001 In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint. Search on Bibsonomy LWA The full citation details ... 2015 DBLP  BibTeX  RDF
1Laszlo B. Kish, Claes-Goran Granqvist, Sergey M. Bezrukov, Tamás Horváth 0001 Brain: Biological noise-based logic. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Laszlo B. Kish, Claes-Goran Granqvist, Tamás Horváth 0001, Andreas Klappenecker, He Wen, Sergey M. Bezrukov Bird's-eye view on Noise-Based Logic. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Pascal Welke, Tamás Horváth 0001, Stefan Wrobel On the Complexity of Frequent Subtree Mining in Very Simple Structures. Search on Bibsonomy ILP The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Tanya Y. Berger-Wolf, Tamás Horváth 0001 Guest editors' foreword: special section on local pattern mining in graph-structured data. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Keisuke Otaki, Jan Ramon Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth 0001 Noise-based Deterministic Logic and Computing: a Brief Survey. Search on Bibsonomy IJUC The full citation details ... 2011 DBLP  BibTeX  RDF
1Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth 0001 Noise-based information processing: Noise-based logic and computing: what do we have so far? Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Tamás Horváth 0001, Laszlo B. Kish, Jacob Scheuer Effective Privacy Amplification for Secure Classical Communications Search on Bibsonomy CoRR The full citation details ... 2011 DBLP  BibTeX  RDF
1Thomas Gärtner, Tamás Horváth 0001, Stefan Wrobel Graph Kernels. Search on Bibsonomy Encyclopedia of Machine Learning The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Stefan Wrobel Learning from Structured Data. Search on Bibsonomy Encyclopedia of Machine Learning The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Jan Ramon, Stefan Wrobel Frequent subgraph mining in outerplanar graphs. Search on Bibsonomy Data Min. Knowl. Discov. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Axel Poigné, Stefan Wrobel Listing closed sets of strongly accessible set systems with applications to data mining. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Jan Ramon Efficient frequent connected subgraph mining in graphs of bounded tree-width. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 2010 DBLP  DOI  BibTeX  RDF
1Laszlo B. Kish, Sunil P. Khatri, Tamás Horváth 0001 Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Laszlo B. Kish, Sunil P. Khatri, Sergey M. Bezrukov, Ferdinand Peper, Zoltan Gingl, Tamás Horváth 0001 Noise-based deterministic logic and computing: a brief survey Search on Bibsonomy CoRR The full citation details ... 2010 DBLP  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Axel Poigné, Stefan Wrobel Listing closed sets of strongly accessible set systems with applications to data. Search on Bibsonomy LWA The full citation details ... 2010 DBLP  BibTeX  RDF
1Tamás Horváth 0001, Jan Ramon Efficient frequent connected subgraph mining in graphs of bounded tree-width. Search on Bibsonomy LWA The full citation details ... 2010 DBLP  BibTeX  RDF
1Laszlo B. Kish, Tamás Horváth 0001 Notes on Recent Approaches Concerning the Kirchhoff-Law-Johnson-Noise-based Secure Key Exchange. Search on Bibsonomy CoRR The full citation details ... 2009 DBLP  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Stefan Wrobel Efficient discovery of interesting patterns based on strong closedness. Search on Bibsonomy Statistical Analysis and Data Mining The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Stefan Wrobel Efficient Discovery of Interesting Patterns Based on Strong Closedness. Search on Bibsonomy SDM The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Gerhard Paass, Frank Reichartz, Stefan Wrobel A Logic-Based Approach to Relation Extraction from Texts. Search on Bibsonomy ILP The full citation details ... 2009 DBLP  DOI  BibTeX  RDF
1Hanna Geppert, Tamás Horváth 0001, 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. Search on Bibsonomy Journal of Chemical Information and Modeling The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Jan Ramon Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth. Search on Bibsonomy ECML/PKDD (1) The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Jean-François Boulicaut, Michael R. Berthold, Tamás Horváth 0001 (eds.) Discovery Science, 11th International Conference, DS 2008, Budapest, Hungary, October 13-16, 2008. Proceedings Search on Bibsonomy Discovery Science The full citation details ... 2008 DBLP  DOI  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Axel Poigné, Stefan Wrobel Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract). Search on Bibsonomy PKDD The full citation details ... 2007 DBLP  DOI  BibTeX  RDF
1Mario Boley, Tamás Horváth 0001, Axel Poigné, Stefan Wrobel Efficient Closed Pattern Mining in Strongly Accessible Set Systems. Search on Bibsonomy MLG The full citation details ... 2007 DBLP  BibTeX  RDF
1Tamás Horváth 0001, Akihiro Yamamoto Foreword. Search on Bibsonomy Machine Learning The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Susanne Hoche, Stefan Wrobel Effective rule induction from labeled graphs. Search on Bibsonomy SAC The full citation details ... 2006 DBLP  DOI  BibTeX  RDF graph mining, computational chemistry
1Tamás Horváth 0001, Jan Ramon, Stefan Wrobel Frequent subgraph mining in outerplanar graphs. Search on Bibsonomy KDD The full citation details ... 2006 DBLP  DOI  BibTeX  RDF graph mining, computational chemistry, frequent pattern discovery
1Tamás Horváth 0001, Jan Ramon, Stefan Wrobel Frequent Subgraph Mining in Outerplanar Graphs. Search on Bibsonomy LWA The full citation details ... 2006 DBLP  BibTeX  RDF
1Tamás Horváth 0001, Björn Bringmann, Luc De Raedt Frequent Hypergraph Mining. Search on Bibsonomy ILP The full citation details ... 2006 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001 Cyclic Pattern Kernels Revisited. Search on Bibsonomy PAKDD The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Stefan Wrobel, Thomas Gärtner, Tamás Horváth 0001 Kernels for Predictive Graph Mining. Search on Bibsonomy GfKl The full citation details ... 2005 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Thomas Gärtner, Stefan Wrobel Cyclic pattern kernels for predictive graph mining. Search on Bibsonomy KDD The full citation details ... 2004 DBLP  DOI  BibTeX  RDF kernel methods, graph mining, computational chemistry
1Tamás Horváth 0001 (eds.) Inductive Logic Programming: 13th International Conference, ILP 2003, Szeged, Hungary, September 29-October 1, 2003, Proceedings Search on Bibsonomy ILP The full citation details ... 2003 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, György Turán Learning logic programs with structured background knowledge. Search on Bibsonomy Artif. Intell. The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Stefan Wrobel, Uta Bohnebeck Relational Instance-Based Learning with Lists and Terms. Search on Bibsonomy Machine Learning The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Stefan Wrobel Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity. Search on Bibsonomy Discovery Science The full citation details ... 2001 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Zoltán Alexin, Tibor Gyimóthy, Stefan Wrobel Application of Different Learning Methods to Hungarian Part-of-Speech Tagging. Search on Bibsonomy ILP The full citation details ... 1999 DBLP  DOI  BibTeX  RDF
1Uta Bohnebeck, Tamás Horváth 0001, Stefan Wrobel Term Comparisons in First-Order Similarity Measures. Search on Bibsonomy ILP The full citation details ... 1998 DBLP  DOI  BibTeX  RDF
1Uta Bohnebeck, Werner Sälter, Tamás Horváth 0001, Stefan Wrobel, Dietmar Blohm Measuring similarity of RNA structures by relational instance-based learning: A first step toward detecting RNA signal structures in silico. Search on Bibsonomy German Conference on Bioinformatics The full citation details ... 1998 DBLP  BibTeX  RDF
1Tibor Gyimóthy, Tamás Horváth 0001 Learning Semantic Functions of Attribute Grammars. Search on Bibsonomy Nord. J. Comput. The full citation details ... 1997 DBLP  BibTeX  RDF
1Tamás Horváth 0001, Robert H. Sloan, György Turán Learning Logic Programs by Using the Product Homomorphism Method. Search on Bibsonomy COLT The full citation details ... 1997 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Robert H. Sloan, György Turán Learning Logic Programs with Random Classification Noise. Search on Bibsonomy Inductive Logic Programming Workshop The full citation details ... 1996 DBLP  DOI  BibTeX  RDF
1Bern Martens, Danny De Schreye, Tamás Horváth 0001 Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures. Search on Bibsonomy Theor. Comput. Sci. The full citation details ... 1994 DBLP  DOI  BibTeX  RDF
1Tamás Horváth 0001, Zoltán Alexin, Tibor Gyimóthy, Károly Fábricz Towards a Multilingual Natural Language Understanding Interface (Extended Abstract). Search on Bibsonomy CC The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth 0001, Károly Fábricz Attribute Grammar Specification for a Natural Language Understanding Interface. Search on Bibsonomy WAGA The full citation details ... 1990 DBLP  DOI  BibTeX  RDF
1Károly Fábricz, Zoltán Alexin, Tibor Gyimóthy, Tamás Horváth 0001 THALES: a Software Package for Plane Geometry Constructions with a Natural Language Interface. Search on Bibsonomy COLING The full citation details ... 1990 DBLP  BibTeX  RDF
1Tibor Gyimóthy, Tamás Horváth 0001, Ferenc Kocsis, János Toczki Incremental Algorithms in Prof-LP. Search on Bibsonomy CC The full citation details ... 1988 DBLP  DOI  BibTeX  RDF attribute grammars, software generation, incremental parsing
Displaying result #1 - #61 of 61 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license