Mining maximal frequent rectangles

DOI10.1007/s11634-021-00451-wOpenAlexW3203172890MaRDI QIDQ2103852

Anjana Kakoti Mahanta, Irani Hazarika

Publication date: 9 December 2022

Published in: Advances in Data Analysis and Classification. ADAC (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11634-021-00451-w

zbMATH Keywords

interval datasymbolic dataempty rectanglefrequent rectanglemaximal frequent rectangle

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Cites Work

• Unnamed Item
• Unnamed Item
• Maintaining knowledge about temporal intervals
• On the maximum empty rectangle problem
• Efficient indexing of interval time sequences
• Clustering of modal-valued symbolic data
• A sequential tree approach for incremental sequential pattern mining
• Far beyond the classical data models: symbolic data analysis

This page was built for publication: Mining maximal frequent rectangles