Efficient algorithms for discovering frequent and maximal substructures from large semistructured data

DOI10.1007/978-90-481-9794-1_66MaRDI QIDQ4932736zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• scientific article; zbMATH DE number 1934539
• scientific article; zbMATH DE number 1699985
• Frequent subtree mining -- an overview
• scientific article; zbMATH DE number 1966525
• scientific article; zbMATH DE number 2088105

Cites work

• A decision-theoretic generalization of on-line learning and an application to boosting
• Algorithms and Computation
• An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
• Complete mining of frequent patterns from graphs: Mining graph data
• Discovery Science
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• Inductive Logic Programming
• Reverse search for enumeration

Cited in

(6)

• scientific article; zbMATH DE number 1699985 (Why is no real title available?)
• Fast mining frequent patterns in semi-structured data stream
• scientific article; zbMATH DE number 1934539 (Why is no real title available?)
• scientific article; zbMATH DE number 1953859 (Why is no real title available?)
• scientific article; zbMATH DE number 1966525 (Why is no real title available?)
• scientific article; zbMATH DE number 2087039 (Why is no real title available?)

This page was built for publication: Efficient algorithms for discovering frequent and maximal substructures from large semistructured data

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