Frequent subtree mining–an overview

Y Chi, RR Muntz, S Nijssen… - Fundamenta Informaticae, 2005 - content.iospress.com
Mining frequent subtrees from databases of labeled trees is a new research field that has
many practical applications in areas such as computer networks, Web mining …

A survey of frequent subgraph mining algorithms

C Jiang, F Coenen, M Zito - The Knowledge Engineering Review, 2013 - cambridge.org
Graph mining is an important research area within the domain of data mining. The field of
study concentrates on the identification of frequent subgraphs within graph data sets. The …

Machine Learning Methods for Property Prediction in Chemoinformatics: Quo Vadis?

A Varnek, I Baskin - Journal of chemical information and modeling, 2012 - ACS Publications
This paper is focused on modern approaches to machine learning, most of which are as yet
used infrequently or not at all in chemoinformatics. Machine learning methods are …

Method evaluation, parameterization, and result validation in unsupervised data mining: A critical survey

A Zimmermann - Wiley Interdisciplinary Reviews: Data Mining …, 2020 - Wiley Online Library
Abstract Machine Learning (ML) and Data Mining (DM) build tools intended to help users
solve data‐related problems that are infeasible for “unaugmented” humans. Tools need …

Mining closed and maximal frequent subtrees from databases of labeled rooted trees

Y Chi, Y Xia, Y Yang, RR Muntz - IEEE Transactions on …, 2005 - ieeexplore.ieee.org
Tree structures are used extensively in domains such as computational biology, pattern
recognition, XML databases, computer networks, and so on. One important problem in …

Pattern-based action engine: Generating process management actions using temporal patterns of process-centric problems

G Park, D Schuster, WMP van der Aalst - Computers in Industry, 2023 - Elsevier
As business environments become more competitive, organizations strive to improve their
business processes to reduce costs and increase quality and productivity. As process …

DLLMiner: structural mining for malware detection

M Narouei, M Ahmadi, G Giacinto… - Security and …, 2015 - Wiley Online Library
Existing anti‐malware products usually use signature‐based techniques as their main
detection engine. Although these methods are very fast, they are unable to provide effective …

Canonical forms for labelled trees and their applications in frequent subtree mining

Y Chi, Y Yang, RR Muntz - Knowledge and information systems, 2005 - Springer
Tree structures are used extensively in domains such as computational biology, pattern
recognition, XML databases, computer networks, and so on. In this paper, we first present …

Clan: An algorithm for mining closed cliques from large dense graph databases

J Wang, Z Zeng, L Zhou - 22nd International Conference on …, 2006 - ieeexplore.ieee.org
Most previously proposed frequent graph mining algorithms are intended to find the
complete set of all frequent, closed subgraphs. However, in many cases only a subset of the …

DRYADE: a new approach for discovering closed frequent trees in heterogeneous tree databases

A Termier, MC Rousset, M Sebag - Fourth IEEE International …, 2004 - ieeexplore.ieee.org
In this paper we present a novel algorithm for discovering tree patterns in a tree database.
This algorithm uses a relaxed tree inclusion definition, making the problem more complex …