Mining maximal frequent rectangles

DOI10.1007/S11634-021-00451-WMaRDI QIDQ2103852zbMATH OpenOpenAlexFDO

Authors Irani Hazarika, Anjana Kakoti Mahanta

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

empty rectanglefrequent rectangleinterval datamaximal frequent rectanglesymbolic data

Mathematics Subject Classification ID

Computing methodologies and applications (68U99)

Cites work

• A sequential tree approach for incremental sequential pattern mining
• Clustering of modal-valued symbolic data
• Efficient indexing of interval time sequences
• Far beyond the classical data models: symbolic data analysis
• scientific article; zbMATH DE number 1674002 (Why is no real title available?)
• scientific article; zbMATH DE number 2080472 (Why is no real title available?)
• Maintaining knowledge about temporal intervals
• On the maximum empty rectangle problem

This page was built for publication: Mining maximal frequent rectangles

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