Instruct: Identify the main and secondary category of Arxiv papers based on the titles and abstracts
Query: SFTM: Fast Comparison of Web Documents using Similarity-based Flexible
  Tree Matching   Tree matching techniques have been investigated in many fields, including web
data mining and extraction, as a key component to analyze the content of web
documents, existing tree matching approaches, like Tree-Edit Distance (TED) or
Flexible Tree Matching (FTM), fail to scale beyond a few hundreds of nodes,
which is far below the average complexity of existing web online documents and
applications. In this paper, we therefore propose a novel Similarity-based
Flexible Tree Matching algorithm (SFTM), which is the first algorithm to enable
tree matching on real-life web documents with practical computation times. In
particular, we approach tree matching as an optimisation problem and we
leverage node labels and local topology similarity in order to avoid any
combinatorial explosion. Our practical evaluation demonstrates that our
approach compares to the reference implementation of TED qualitatively, while
improving the computation times by two orders of magnitude.

18
The categories of this paper are: econ
28
The categories of this paper are: alg-geom
26
The categories of this paper are: bayes-an
7
The categories of this paper are: hep-th
23
The categories of this paper are: solv-int
35
The categories of this paper are: mtrl-th
4
The categories of this paper are: cond-mat
15
The categories of this paper are: nucl-ex
21
The categories of this paper are: adap-org
29
The categories of this paper are: funct-an
31
The categories of this paper are: ao-sci
34
The categories of this paper are: chem-ph
32
The categories of this paper are: atom-ph
25
The categories of this paper are: patt-sol
13
The categories of this paper are: quant-ph
5
The categories of this paper are: gr-qc