Sciweavers

91 search results - page 9 / 19
» A supertree method for rooted trees
Sort
View
98
Voted
EUSFLAT
2001
15 years 1 months ago
Similarity measurement on leaf-labelled trees
We outline a method for measuring in an efficient way an overall degree of similarity between different leaf-labelled trees. In particular, we consider rooted trees, either unorde...
Hans De Meyer, Bernard De Baets, Saskia Janssens
96
Voted
BDA
2006
15 years 1 months ago
Integrating Correction into Incremental Validation
Many data on the Web are XML documents. An XML document is an unranked labelled tree. A schema for XML documents (for instance a DTD) is the specification of their internal structu...
Béatrice Bouchou, Ahmed Cheriat, Mirian Hal...
162
Voted
RIVF
2008
15 years 1 months ago
Unsupervised learning for image classification based on distribution of hierarchical feature tree
The classification image into one of several categories is a problem arisen naturally under a wide range of circumstances. In this paper, we present a novel unsupervised model for ...
Thach-Thao Duong, Joo-Hwee Lim, Hai-Quan Vu, Jean-...
ECML
2003
Springer
15 years 5 months ago
Improving the AUC of Probabilistic Estimation Trees
Abstract. In this work we investigate several issues in order to improve the performance of probabilistic estimation trees (PETs). First, we derive a new probability smoothing that...
César Ferri, Peter A. Flach, José He...
100
Voted
DSSCV
2005
Springer
15 years 5 months ago
Exploiting Deep Structure
Abstract. Blurring an image with a Gaussian of width σ and considering σ as an extra dimension, extends the image to an Gaussian scale space (GSS) image. In this GSS-image the is...
Arjan Kuijper