Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1934542
- AI 2003: Advances in Artificial Intelligence
- scientific article; zbMATH DE number 2088115
- Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification
- Making use of the most expressive jumping emerging patterns for classification
Cites work
- Attribute Set Dependence in Apriori-Like Reduct Computation
- scientific article; zbMATH DE number 1696694 (Why is no real title available?)
- scientific article; zbMATH DE number 2088115 (Why is no real title available?)
- Making use of the most expressive jumping emerging patterns for classification
- On the relation between rough set reducts and jumping emerging patterns
Cited in
(9)- LCMine: An efficient algorithm for mining discriminative regularities and its application in supervised classification
- Jumping emerging patterns with negation in transaction databases -- classification and discovery
- scientific article; zbMATH DE number 1696426 (Why is no real title available?)
- Local Reducts and Jumping Emerging Patterns in Relational Databases
- Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification
- On the relation between jumping emerging patterns and rough set theory with application to data classification
- scientific article; zbMATH DE number 1934542 (Why is no real title available?)
- scientific article; zbMATH DE number 2088115 (Why is no real title available?)
- A novel approach of mining strong jumping emerging patterns based on BSC-tree
This page was built for publication: Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541065)