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 …

Short and long-term pattern discovery over large-scale geo-spatiotemporal data

S Moosavi, MH Samavatian, A Nandi… - Proceedings of the 25th …, 2019 - dl.acm.org
Pattern discovery in geo-spatiotemporal data (such as traffic and weather data) is about
finding patterns of collocation, co-occurrence, cascading, or cause and effect between …

Frequent subtree mining on the automata processor: challenges and opportunities

E Sadredini, R Rahimi, K Wang… - Proceedings of the …, 2017 - dl.acm.org
Frequency counting of complex patterns such as subtrees is more challenging than for
simple itemsets and sequences, as the number of possible candidate patterns in a tree is …

Frequent tree pattern mining: A survey

A Jiménez, F Berzal, JC Cubero - Intelligent Data Analysis, 2010 - content.iospress.com
The use of non-linear data structures is becoming more and more common in many data
mining scenarios. Trees, in particular, have drawn the attention of researchers as the …

Mining frequent infix patterns from concurrency-aware process execution variants

M Martini, D Schuster, WMP van der Aalst - Proceedings of the VLDB …, 2023 - dl.acm.org
Event logs, as considered in process mining, document a large number of individual process
executions. Moreover, each process execution consists of various executed activities. To …

Tree model guided candidate generation for mining frequent subtrees from XML documents

H Tan, F Hadzic, TS Dillon, E Chang… - ACM Transactions on …, 2008 - dl.acm.org
Due to the inherent flexibilities in both structure and semantics, XML association rules
mining faces few challenges, such as: a more complicated hierarchical data structure and …

Mining tree-structured data on multicore systems

S Tatikonda, S Parthasarathy - Proceedings of VLDB, 2009, 2008 - books.google.com
Mining frequent subtrees in a database of rooted and labeled trees is an important problem
in many domains, ranging from phylogenetic analysis to biochemistry and from linguistic …

Mining rooted ordered trees under subtree homeomorphism

M Haghir Chehreghani, M Bruynooghe - Data Mining and Knowledge …, 2016 - Springer
Mining frequent tree patterns has many applications in different areas such as XML data,
bioinformatics and World Wide Web. The crucial step in frequent pattern mining is frequency …

OInduced: an efficient algorithm for mining induced patterns from rooted ordered trees

MH Chehreghani, MH Chehreghani… - … on Systems, Man …, 2011 - ieeexplore.ieee.org
Frequent tree patterns have many practical applications in different domains, such as
Extensible Markup Language mining, Web usage analysis, etc. In this paper, we present …

POTMiner: mining ordered, unordered, and partially-ordered trees

A Jiménez, F Berzal, JC Cubero - Knowledge and information systems, 2010 - Springer
Non-linear data structures are becoming more and more common in data mining problems.
Trees, in particular, are amenable to efficient mining techniques. In this paper, we introduce …