On the relation between rough set reducts and jumping emerging patterns
From MaRDI portal
Publication:867599
DOI10.1016/J.INS.2006.04.002zbMATH Open1142.68554OpenAlexW2073586779MaRDI QIDQ867599FDOQ867599
Authors: Pawel Terlecki, Krzysztof Walczak 
Publication date: 16 February 2007
Published in: Information Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ins.2006.04.002
Recommendations
- Local Reducts and Jumping Emerging Patterns in Relational Databases
- On the relation between rough set reducts and typical testors
- On the relation between jumping emerging patterns and rough set theory with application to data classification
- A systematic study on attribute reduction with rough sets based on general binary relations
- scientific article; zbMATH DE number 2111986
Cites Work
- Title not available (Why is that?)
- Rough set methods in feature selection and recognition
- Rough sets and intelligent data analysis
- Rough sets methods in feature reduction and classification
- Making use of the most expressive jumping emerging patterns for classification
- DeEPs: A new instance-based lazy discovery and classification system
- Title not available (Why is that?)
- AI 2003: Advances in Artificial Intelligence
- Modeling Decisions for Artificial Intelligence
Cited In (6)
- Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
- Jumping emerging patterns with negation in transaction databases -- classification and discovery
- Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification
- Local Reducts and Jumping Emerging Patterns in Relational Databases
- Attribute reduction based on evidence theory in incomplete decision systems
- On the relation between rough set reducts and typical testors
This page was built for publication: On the relation between rough set reducts and jumping emerging patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q867599)
