Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data

DOI10.1007/978-90-481-9794-1_66zbMath1198.68121OpenAlexW259085469MaRDI QIDQ4932736

Hiroki Arimura

Publication date: 6 October 2010

Published in: Lecture Notes in Electrical Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-90-481-9794-1_66

zbMATH Keywords

pattern miningPPC-extensionrightmost expansion

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Cites Work

• Unnamed Item
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• A decision-theoretic generalization of on-line learning and an application to boosting
• Complete mining of frequent patterns from graphs: Mining graph data
• Reverse search for enumeration
• Inductive Logic Programming
• Discovery Science
• Algorithms and Computation

This page was built for publication: Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data