Frequent subtree mining–an overview
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 …
many practical applications in areas such as computer networks, Web mining …
A survey of frequent subgraph mining algorithms
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 …
study concentrates on the identification of frequent subgraphs within graph data sets. The …
Machine Learning Methods for Property Prediction in Chemoinformatics: Quo Vadis?
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 …
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 …
solve data‐related problems that are infeasible for “unaugmented” humans. Tools need …
Mining closed and maximal frequent subtrees from databases of labeled rooted trees
Tree structures are used extensively in domains such as computational biology, pattern
recognition, XML databases, computer networks, and so on. One important problem in …
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
As business environments become more competitive, organizations strive to improve their
business processes to reduce costs and increase quality and productivity. As process …
business processes to reduce costs and increase quality and productivity. As process …
DLLMiner: structural mining for malware detection
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 …
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
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 …
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
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 …
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
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 …
This algorithm uses a relaxed tree inclusion definition, making the problem more complex …