On the relation between rough set reducts and jumping emerging patterns
From MaRDI portal
Publication:867599
DOI10.1016/j.ins.2006.04.002zbMath1142.68554OpenAlexW2073586779MaRDI QIDQ867599
Krzysztof Walczak, Pawel Terlecki
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
Related Items (5)
Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification ⋮ Efficient Discovery of Top-K Minimal Jumping Emerging Patterns ⋮ Jumping emerging patterns with negation in transaction databases -- classification and discovery ⋮ Attribute reduction based on evidence theory in incomplete decision systems ⋮ On the relation between rough set reducts and typical testors
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- DeEPs: A new instance-based lazy discovery and classification system
- Making use of the most expressive jumping emerging patterns for classification
- Rough sets and intelligent data analysis
- Rough set methods in feature selection and recognition
- AI 2003: Advances in Artificial Intelligence
- Modeling Decisions for Artificial Intelligence
This page was built for publication: On the relation between rough set reducts and jumping emerging patterns