Local reducts and jumping emerging patterns in relational databases

Authors:
Pawel Terlecki;Krzysztof Walczak
Affiliations:
Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland;Institute of Computer Science, Warsaw University of Technology, Warsaw, Poland
Venue:
RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing
Year:
2006

Citing 5
Cited 4

Rough set algorithms in classification problem

Rough set methods and applications
An Incremental Learning Algorithm for Constructing Decision Rules

RSKD '93 Proceedings of the International Workshop on Rough Sets and Knowledge Discovery: Rough Sets, Fuzzy Sets and Knowledge Discovery
DeEPs: A New Instance-Based Lazy Discovery and Classification System

Machine Learning
Mining border descriptions of emerging patterns from dataset pairs

Knowledge and Information Systems
Attribute set dependence in apriori-like reduct computation

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology

Jumping emerging patterns with negation in transaction databases - Classification and discovery

Information Sciences: an International Journal
Jumping Emerging Pattern Induction by Means of Graph Coloring and Local Reducts in Transaction Databases

RSFDGrC '07 Proceedings of the 11th International Conference on Rough Sets, Fuzzy Sets, Data Mining and Granular Computing
Local projection in jumping emerging patterns discovery in transaction databases

PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
On the relation between jumping emerging patterns and rough set theory with application to data classification

Transactions on rough sets XII

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper refers to the notion of minimal pattern in relational databases. We study the analogy between two concepts: a local reduct, from the rough set theory, and a jumping emerging pattern, originally defined for transactional data. Their equivalence within a positive region and similarities between eager and lazy classification methods based on both ideas are demonstrated. Since pattern discovery approaches vary significantly, efficiency tests have been performed in order to decide, which solution provides a better tool for the analysis of real relational datasets.