Attribute set dependence in reduct computation

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:
Transactions on computational science II
Year:
2008

Citing 10
Cited 1

Mining frequent patterns without candidate generation

SIGMOD '00 Proceedings of the 2000 ACM SIGMOD international conference on Management of data
Rough set algorithms in classification problem

Rough set methods and applications
Rough set methods in feature selection and recognition

Pattern Recognition Letters - Special issue: Rough sets, pattern recognition and data mining
Fast Algorithms for Mining Association Rules in Large Databases

VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
On Cognitive Informatics

ICCI '02 Proceedings of the 1st IEEE International Conference on Cognitive Informatics
Fast Algorithms for Mining Emerging Patterns

PKDD '02 Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery
Multiknowledge for decision making

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
A new rough sets model based on database systems

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular computing
Conjugate information systems: learning cognitive concepts in rough set theory

RSFDGrC'03 Proceedings of the 9th international conference on Rough sets, fuzzy sets, data mining, and granular 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

In the paper we propose a novel approach to finding roughset reducts in information systems. Our method combines an apriorilikescheme of space traversing with an efficient pruning condition basedon attribute set dependence. Moreover, we discuss theoretical and implementationalaspects of our pruning procedure, including adopting abst and a trie tree for storing set collections. Operation number andexecution time tests have been performed in order to demonstrate theefficiency of our approach.