Local projection in jumping emerging patterns discovery in transaction 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:
PAKDD'08 Proceedings of the 12th Pacific-Asia conference on Advances in knowledge discovery and data mining
Year:
2008

Citing 8
Cited 2

Rough set algorithms in classification problem

Rough set methods and applications
Making use of the most expressive jumping emerging patterns for classification

Knowledge and Information Systems
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Mining border descriptions of emerging patterns from dataset pairs

Knowledge and Information Systems
Mining statistically important equivalence classes and delta-discriminative emerging patterns

Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining
Jumping emerging patterns with negation in transaction databases - Classification and discovery

Information Sciences: an International Journal
Attribute set dependence in apriori-like reduct computation

RSKT'06 Proceedings of the First international conference on Rough Sets and Knowledge Technology
Local reducts and jumping emerging patterns in relational databases

RSCTC'06 Proceedings of the 5th international conference on Rough Sets and Current Trends in Computing

Efficient Discovery of Top-K Minimal Jumping Emerging Patterns

RSCTC '08 Proceedings of the 6th International Conference on Rough Sets and Current Trends in Computing
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 considers a rough set approach for the problem of finding minimal jumping emerging patterns (JEPs) in classified transactional datasets. The discovery is transformed into a series of transactionwise local reduct computations. In order to decrease average subproblem dimensionality, we introduce local projection of a database. The novel algorithm is compared to the table condensation method and JEP-Producer for sparse and dense, originally relational data. For a more complete picture, in our experiments, different implementations of basic structures are considered.