Publication:4405997
From MaRDI portal
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
Related Items
Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data, Improving constrained pattern mining with first-fail-based heuristics, Using trees to mine multirelational databases, Efficiently mining \(\delta \)-tolerance closed frequent subgraphs, An efficient algorithm for solving pseudo clique enumeration problem, Bottom-up mining of XML query patterns to improve XML querying, Mining frequent closed itemsets from a landmark window over online data streams, Mining rooted ordered trees under subtree homeomorphism, Ordered subtree mining via transactional mapping using a structure-preserving tree database schema, Fast support vector machines for convolution tree kernels, Learning block-preserving graph patterns and its application to data mining, Mining frequent closed rooted trees, XRules: an effective algorithm for structural classification of XML data, Computational aspects of mining maximal frequent patterns, Pattern Mining for Historical Data Analysis by Using MOEA
