Efficient Discovery of Top-K Minimal Jumping Emerging Patterns

DOI10.1007/978-3-540-88425-5_45zbMath1185.68576OpenAlexW1764270414MaRDI QIDQ3541065

Krzysztof Walczak, Pawel Terlecki

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_45

zbMATH Keywords

rough setsjumping emerging patternattribute set dependenceCP-Treestrong jumping emerging patterntop-\(k\) most interesting pattern

Mathematics Subject Classification ID

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

Related Items (2)

LCMine: An efficient algorithm for mining discriminative regularities and its application in supervised classification ⋮ A novel approach of mining strong jumping emerging patterns based on BSC-tree

Cites Work

• On the relation between rough set reducts and jumping emerging patterns
• Making use of the most expressive jumping emerging patterns for classification
• Attribute Set Dependence in Apriori-Like Reduct Computation
• Unnamed Item
• Unnamed Item

This page was built for publication: Efficient Discovery of Top-K Minimal Jumping Emerging Patterns