Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Preprint |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2004.12821 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866917706170630144 |
|---|---|
| author | Brisset, Sacha Rouvoy, Romain Pawlak, Renaud Seinturier, Lionel |
| author_facet | Brisset, Sacha Rouvoy, Romain Pawlak, Renaud Seinturier, Lionel |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2004_12821 |
| institution | arXiv |
| publishDate | 2020 |
| record_format | arxiv |
| spellingShingle | SFTM: Fast Comparison of Web Documents using Similarity-based Flexible Tree Matching Brisset, Sacha Rouvoy, Romain Pawlak, Renaud Seinturier, Lionel Databases Software Engineering D.2 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. |
| title | SFTM: Fast Comparison of Web Documents using Similarity-based Flexible Tree Matching |
| topic | Databases Software Engineering D.2 |
| url | https://arxiv.org/abs/2004.12821 |