scientific article; zbMATH DE number 1934539
From MaRDI portal
Publication:4405997
zbMath1020.68521MaRDI QIDQ4405997
Shinji Kawasoe, Kenji Abe, Hiroki Arimura, Tatsuya Asai, Setsuo Arikawa
Publication date: 25 June 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2431/24310001.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (15)
An efficient algorithm for solving pseudo clique enumeration problem ⋮ Improving constrained pattern mining with first-fail-based heuristics ⋮ Using trees to mine multirelational databases ⋮ Efficiently mining \(\delta \)-tolerance closed frequent subgraphs ⋮ Fast support vector machines for convolution tree kernels ⋮ Learning block-preserving graph patterns and its application to data mining ⋮ Mining frequent closed rooted trees ⋮ Bottom-up mining of XML query patterns to improve XML querying ⋮ Mining rooted ordered trees under subtree homeomorphism ⋮ Ordered subtree mining via transactional mapping using a structure-preserving tree database schema ⋮ Mining frequent closed itemsets from a landmark window over online data streams ⋮ XRules: an effective algorithm for structural classification of XML data ⋮ Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data ⋮ Computational aspects of mining maximal frequent patterns ⋮ Pattern Mining for Historical Data Analysis by Using MOEA
This page was built for publication:
