Jumping emerging patterns with negation in transaction databases -- classification and discovery
From MaRDI portal
Recommendations
- On the relation between jumping emerging patterns and rough set theory with application to data classification
- Making use of the most expressive jumping emerging patterns for classification
- Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
- scientific article; zbMATH DE number 1696426
- scientific article; zbMATH DE number 2088115
Cites work
- scientific article; zbMATH DE number 53312 (Why is no real title available?)
- scientific article; zbMATH DE number 1934542 (Why is no real title available?)
- scientific article; zbMATH DE number 2084826 (Why is no real title available?)
- scientific article; zbMATH DE number 2088115 (Why is no real title available?)
- Attribute Set Dependence in Apriori-Like Reduct Computation
- Local Reducts and Jumping Emerging Patterns in Relational Databases
- Making use of the most expressive jumping emerging patterns for classification
- On the relation between rough set reducts and jumping emerging patterns
- Rough set algorithms in classification problem
- Rough sets
- Rough sets: some extensions
- Rudiments of rough sets
Cited in
(2)
This page was built for publication: Jumping emerging patterns with negation in transaction databases -- classification and discovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2465339)