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

Authors:
Pawel Terlecki;Krzysztof Walczak
Affiliations:
Institute of Computer Science, Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland;Institute of Computer Science, Faculty of Electronics and Information Technology, Warsaw University of Technology, Nowowiejska 15/19, 00-665 Warsaw, Poland
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 17
Cited 2

Small is beautiful: discovering the minimal set of unexpected patterns

Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining
Rough set algorithms in classification problem

Rough set methods and applications
Rough Sets: Theoretical Aspects of Reasoning about Data

Rough Sets: Theoretical Aspects of Reasoning about Data
Making use of the most expressive jumping emerging patterns for classification

Knowledge and Information Systems
Beyond Market Baskets: Generalizing Association Rules to Dependence Rules

Data Mining and Knowledge Discovery
Mining for Strong Negative Associations in a Large Database of Customer Transactions

ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
An Efficient Single-Scan Algorithm for Mining Essential Jumping Emerging Patterns for Classification

PAKDD '02 Proceedings of the 6th Pacific-Asia Conference on Advances in Knowledge Discovery and Data Mining
Bounding Negative Information in Frequent Sets Algorithms

DS '01 Proceedings of the 4th International Conference on Discovery Science
Fast Algorithms for Mining Emerging Patterns

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Mining Negative Association Rules

ISCC '02 Proceedings of the Seventh International Symposium on Computers and Communications (ISCC'02)
Efficient mining of both positive and negative association rules

ACM Transactions on Information Systems (TOIS)
Mining positive and negative association rules: an approach for confined rules

PKDD '04 Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases
Mining border descriptions of emerging patterns from dataset pairs

Knowledge and Information Systems
Fast Discovery and the Generalization of Strong Jumping Emerging Patterns for Building Compact and Accurate Classifiers

IEEE Transactions on Knowledge and Data Engineering
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
Support oriented discovery of generalized disjunction-free representation of frequent patterns with negation

PAKDD'05 Proceedings of the 9th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining

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.07

Visualization

Abstract

This paper examines jumping emerging patterns with negation (JEPNs), i.e. JEPs that can contain negated items. We analyze the basic relations between these patterns and classical JEPs in transaction databases and local reducts from the rough set theory. JEPNs provide an interesting type of knowledge and can be successfully used for classification purposes. By analogy to JEP-Classifier, we consider negJEP-Classifier and JEPN-Classifier and compare their accuracy. The results are contrasted with changes in rule set complexity. In connection with the problem of JEPN discovery, JEP-Producer and rough set methods are examined.