Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification

DOI10.1007/978-3-540-88425-5_43MaRDI QIDQ3541062zbMATH OpenOpenAlexFDO

Authors Łukasz Kobyliński, Krzysztof Walczak

Publication date 25 November 2008

Published in Rough Sets and Current Trends in Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-88425-5_43

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10)

Recommendations

• Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
• Making use of the most expressive jumping emerging patterns for classification
• scientific article; zbMATH DE number 2088115
• scientific article; zbMATH DE number 1934542
• AI 2003: Advances in Artificial Intelligence

Cites work

• scientific article; zbMATH DE number 2200689 (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

(6)

• Making use of the most expressive jumping emerging patterns for classification
• A tree-based contrast set-mining approach to detecting group differences
• Efficient Discovery of Top-K Minimal Jumping Emerging Patterns
• 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?)
• A novel approach of mining strong jumping emerging patterns based on BSC-tree

This page was built for publication: Efficient Mining of Jumping Emerging Patterns with Occurrence Counts for Classification

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3541062)