scispace - formally typeset
L

Laszlo Szathmary

Researcher at University of Debrecen

Publications -  56
Citations -  884

Laszlo Szathmary is an academic researcher from University of Debrecen. The author has contributed to research in topics: Association rule learning & Knowledge extraction. The author has an hindex of 16, co-authored 56 publications receiving 794 citations. Previous affiliations of Laszlo Szathmary include French Institute for Research in Computer Science and Automation & Université du Québec à Montréal.

Papers
More filters
Proceedings ArticleDOI

Towards Rare Itemset Mining

TL;DR: This work proposes two algorithms for frequent itemset part traversal, a naive and an optimized one, respectively, and another algorithm for step two, and provides some empirical evidence about the performance gains due to the optimized traversal.
Proceedings Article

Case base mining for adaptation knowledge acquisition

TL;DR: An approach to AKA based on the principles and techniques of knowledge discovery from databases and data-mining is presented, implemented in CABAMAKA, a system that explores the variations within the case base to elicit adaptation knowledge.
Journal ArticleDOI

Performance Analysis of Different Types of Machine Learning Classifiers for Non-Technical Loss Detection

TL;DR: It is concluded that including more features beyond this threshold does not improve performance and thus limiting to the selected feature set reduces the computation time required by the classifiers, which has opened a new area of research in NTL detection.
Proceedings Article

ZART: A Multifunctional Itemset Mining Algorithm

TL;DR: Zart shows a number of additional features and performs the following, usually independent, tasks: identify frequent closed itemsets and associate generators to their closures, which makes Zart a complete algorithm for computing classes of itemsets including generators and closed itemset.
Proceedings Article

CORON: A Framework for Levelwise Itemset Mining Algorithms

TL;DR: CORON is a framework for levelwise algorithms that are designed to find frequent and/or frequent closed itemsets in binary contexts to give a possibility for users to try different algorithms and choose the one that best suits their needs.