Tree edit distance: Robust and memory-efficient

M Pawlik, N Augsten - Information Systems, 2016 - Elsevier
Hierarchical data are often modelled as trees. An interesting query identifies pairs of similar
trees. The standard approach to tree similarity is the tree edit distance, which has …

RTED: a robust algorithm for the tree edit distance

M Pawlik, N Augsten - arxiv preprint arxiv:1201.0230, 2011 - arxiv.org
We consider the classical tree edit distance between ordered labeled trees, which is defined
as the minimum-cost sequence of node edit operations that transform one tree into another …

Efficient computation of the tree edit distance

M Pawlik, N Augsten - ACM Transactions on Database Systems (TODS), 2015 - dl.acm.org
We consider the classical tree edit distance between ordered labelled trees, which is
defined as the minimum-cost sequence of node edit operations that transform one tree into …

A context-aware recommendation system for improving manufacturing process modeling

J Wang, S Gao, Z Tang, D Tan, B Cao, J Fan - Journal of Intelligent …, 2023 - Springer
Process recommendation is an essential technique to help process modeler effectively and
efficiently model a manufacturing process from scratch. However, the current process …

Next-step suggestions for modern interactive data analysis platforms

T Milo, A Somech - Proceedings of the 24th ACM SIGKDD International …, 2018 - dl.acm.org
Modern Interactive Data Analysis (IDA) platforms, such as Kibana, Splunk, and Tableau, are
gradually replacing traditional OLAP/SQL tools, as they allow for easy-to-use data …

Set similarity joins on mapreduce: An experimental survey

F Fier, N Augsten, P Bouros, U Leser… - Proceedings of the VLDB …, 2018 - dl.acm.org
Set similarity joins, which compute pairs of similar sets, constitute an important operator
primitive in a variety of applications, including applications that must process large amounts …

The continuous hint factory-providing hints in vast and sparsely populated edit distance spaces

B Paaßen, B Hammer, TW Price, T Barnes… - arxiv preprint arxiv …, 2017 - arxiv.org
Intelligent tutoring systems can support students in solving multi-step tasks by providing
hints regarding what to do next. However, engineering such next-step hints manually or via …

[PDF][PDF] Clustering by authorship within and across documents

E Stamatatos, M Tschnuggnall… - … Notes Papers of …, 2016 - repository.uantwerpen.be
The vast majority of previous studies in authorship attribution assume the existence of
documents (or parts of documents) labeled by authorship to be used as training instances in …

Efficient processing of graph similarity queries with edit distance constraints

X Zhao, C **ao, X Lin, W Wang, Y Ishikawa - The VLDB Journal, 2013 - Springer
Graphs are widely used to model complicated data semantics in many applications in
bioinformatics, chemistry, social networks, pattern recognition, etc. A recent trend is to …

Toward Data-Driven Example Feedback for Novice Programming.

R Zhi, S Marwan, Y Dong, N Lytle, TW Price… - … Educational Data Mining …, 2019 - ERIC
Viewing worked examples before problem solving has been shown to improve learning
efficiency in novice programming. Example-based feedback seeks to present smaller …