The DOI matches its Crossref record.
TreeFinder: a first step towards XML data mining
Abstract
In this paper we consider the problem of searching frequent trees from a collection of tree-structured data modeling XML data. The TreeFinder algorithm aims at finding trees, such that their exact or perturbed copies are frequent in a collection of labelled trees. To cope with complexity issues, TreeFinder is correct but not complete: it finds a subset of actually frequent trees. The default of completeness is experimentally investigated on artificial medium size datasets; it is shown that TreeFinder reaches completeness or falls short for a range of experimental settings.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Efficiently mining frequent trees in a forest: algorithms and applications
Zaki, M. J. (2005) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2005.125 · Cited by 306
Frequent Subtree Mining - An Overview
Chi, Y., Muntz, R. R., Nijssen, S., & Kok, J. N. (2004) · doi:10.5555/1227174.1227182 · Cited by 262
(2014) · doi:10.1145/2635868.2635901 · Cited by 159
A Method of Extracting The Semi-structured Data Implication Rules
Lin, Y., Jun, Z., Hongyan, M., Zhongwei, Z., & Zhanfang, F. (2018) · Procedia Computer Science · doi:10.1016/j.procs.2018.04.315 · Cited by 19
Metadata
- Authors
- Termier, A., Rousset, M.-C., & Sebag, M.
- Venue
- 2002 IEEE International Conference on Data Mining, 2002. Proceedings.
- Publisher
- IEEE Comput. Soc
- Published
- 2003-06-26
- Pages
- 450-457
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2122303450
- Cited by
- 183
- References
- 0
- FWCI
- 24.07
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: TreeFinder: a first step towards XML data mining. https://app.cochat.ai/papers/10.1109/icdm.2002.1183987
- The paper
- Termier, A., Rousset, M.-C., & Sebag, M. (2003). TreeFinder: a first step towards XML data mining. 2002 IEEE International Conference on Data Mining, 2002. Proceedings. https://doi.org/10.1109/icdm.2002.1183987
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.