2024
Iterative Graph Neural Network Enhancement via Frequent Subgraph Mining of Explanations.
CoRR, 2024
2023
Maximal closed set and half-space separations in finite closure systems.
Theor. Comput. Sci., September, 2023
2022
A generalized Weisfeiler-Lehman graph kernel.
Mach. Learn., 2022
A Fast Heuristic for Computing Geodesic Cores in Large Networks.
CoRR, 2022
A Simple Heuristic for the Graph Tukey Depth Problem with Potential Applications to Graph Mining.
Proceedings of the LWDA 2022 Workshops: FGWM, 2022
A Fast Heuristic for Computing Geodesic Closures in Large Networks.
Proceedings of the Discovery Science - 25th International Conference, 2022
2021
Learning Weakly Convex Sets in Metric Spaces.
Proceedings of the Machine Learning and Knowledge Discovery in Databases. Research Track, 2021
2020
Effective approximation of parametrized closure systems over transactional data streams.
Mach. Learn., 2020
Maximum Margin Separations in Finite Closure Systems.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2020
2019
Probabilistic and exact frequent subtree mining in graphs beyond forests.
Mach. Learn., 2019
Support Estimation in Frequent Itemset Mining by Locality Sensitive Hashing.
Proceedings of the Conference on "Lernen, Wissen, Daten, Analysen", Berlin, Germany, September 30, 2019
2018
Probabilistic frequent subtrees for efficient graph classification and retrieval.
Mach. Learn., 2018
Mining Tree Patterns with Partially Injective Homomorphisms.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2018
2017
Learning from Structured Data.
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017
Proceedings of the Encyclopedia of Machine Learning and Data Mining, 2017
Mining Strongly Closed Itemsets from Data Streams.
Proceedings of the Discovery Science - 20th International Conference, 2017
2016
The Partial Weighted Set Cover Problem with Applications to Outlier Detection and Clustering.
Proceedings of the Conference "Lernen, 2016
Min-Hashing for Probabilistic Frequent Subtree Feature Spaces.
Proceedings of the Discovery Science - 19th International Conference, 2016
Mining Data Streams with Dynamic Confidence Intervals.
Proceedings of the Big Data Analytics and Knowledge Discovery, 2016
2015
Probabilistic Frequent Subtree Kernels.
Proceedings of the New Frontiers in Mining Complex Patterns - 4th International Workshop, 2015
In-Stream Frequent Itemset Mining With Output Proportional Memory Footprint.
Proceedings of the LWA 2015 Workshops: KDML, 2015
2014
Bird's-eye view on Noise-Based Logic.
CoRR, 2014
Brain: Biological noise-based logic.
CoRR, 2014
On the Complexity of Frequent Subtree Mining in Very Simple Structures.
Proceedings of the Inductive Logic Programming - 24th International Conference, 2014
2013
Guest editors' foreword: special section on local pattern mining in graph-structured data.
Ann. Math. Artif. Intell., 2013
Efficient Frequent Connected Induced Subgraph Mining in Graphs of Bounded Tree-Width.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2013
2011
Noise-based Deterministic Logic and Computing: a Brief Survey.
Int. J. Unconv. Comput., 2011
Noise-based information processing: Noise-based logic and computing: what do we have so far?
CoRR, 2011
Effective Privacy Amplification for Secure Classical Communications
CoRR, 2011
2010
Learning from Structured Data.
Proceedings of the Encyclopedia of Machine Learning, 2010
Proceedings of the Encyclopedia of Machine Learning, 2010
Efficient frequent connected subgraph mining in graphs of bounded tree-width.
Theor. Comput. Sci., 2010
Listing closed sets of strongly accessible set systems with applications to data mining.
Theor. Comput. Sci., 2010
Frequent subgraph mining in outerplanar graphs.
Data Min. Knowl. Discov., 2010
Computation using Noise-based Logic: Efficient String Verification over a Slow Communication Channel
CoRR, 2010
Listing closed sets of strongly accessible set systems with applications to data.
Proceedings of the LWA 2010, 2010
2009
Efficient discovery of interesting patterns based on strong closedness.
Stat. Anal. Data Min., 2009
Notes on Recent Approaches Concerning the Kirchhoff-Law-Johnson-Noise-based Secure Key Exchange.
CoRR, 2009
A Logic-Based Approach to Relation Extraction from Texts.
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.
J. Chem. Inf. Model., 2008
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth.
Proceedings of the Machine Learning and Knowledge Discovery in Databases, 2008
2007
Efficient Closed Pattern Mining in Strongly Accessible Set Systems (Extended Abstract).
Proceedings of the Knowledge Discovery in Databases: PKDD 2007, 2007
Efficient Closed Pattern Mining in Strongly Accessible Set Systems.
Proceedings of the Mining and Learning with Graphs, 2007
2006
Effective rule induction from labeled graphs.
Proceedings of the 2006 ACM Symposium on Applied Computing (SAC), 2006
Frequent Hypergraph Mining.
Proceedings of the Inductive Logic Programming, 16th International Conference, 2006
2005
Cyclic Pattern Kernels Revisited.
Proceedings of the Advances in Knowledge Discovery and Data Mining, 2005
Kernels for Predictive Graph Mining.
Proceedings of the From Data and Information Analysis to Knowledge Engineering, 2005
2004
Cyclic pattern kernels for predictive graph mining.
Proceedings of the Tenth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2004
2001
Relational Instance-Based Learning with Lists and Terms.
Mach. Learn., 2001
Learning logic programs with structured background knowledge.
Artif. Intell., 2001
Towards Discovery of Deep and Wide First-Order Structures: A Case Study in the Domain of Mutagenicity.
Proceedings of the Discovery Science, 4th International Conference, DS 2001, Washington, 2001
1999
Application of Different Learning Methods to Hungarian Part-of-Speech Tagging.
Proceedings of the Inductive Logic Programming, 9th International Workshop, 1999
1998
Term Comparisons in First-Order Similarity Measures.
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.
Proceedings of the German Conference on Bioinformatics, 1998
1997
Learning Semantic Functions of Attribute Grammars.
Nord. J. Comput., 1997
Learning Logic Programs by Using the Product Homomorphism Method.
Proceedings of the Tenth Annual Conference on Computational Learning Theory, 1997
1996
Learning Logic Programs with Random Classification Noise.
Proceedings of the Inductive Logic Programming, 6th International Workshop, 1996
1994
Sound and Complete Partial Deduction with Unfolding Based on Well-Founded Measures.
Theor. Comput. Sci., 1994
1990
Attribute Grammar Specification for a Natural Language Understanding Interface.
Proceedings of the Attribute Grammars and their Applications, 1990
THALES: a Software Package for Plane Geometry Constructions with a Natural Language Interface.
Proceedings of the 13th International Conference on Computational Linguistics, 1990
Towards a Multilingual Natural Language Understanding Interface (Extended Abstract).
Proceedings of the Compiler Compilers, 1990
1988
Incremental Algorithms in Prof-LP.
Proceedings of the Compiler Compilers and High Speed Compilation, 1988