91 search results - page 7 / 19 » A supertree method for rooted trees |
95
Voted
KDD
2002
ACM
16 years 23 days ago
2002
ACM
Mining frequent trees is very useful in domains like bioinformatics, web mining, mining semi-structured data, and so on. We formulate the problem of mining (embedded) subtrees in ...
109
Voted
ICML
2003
IEEE
15 years 5 months ago
2003
IEEE
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
CG
2006
Springer
15 years 4 months ago
2006
Springer
Monte-Carlo evaluation consists in estimating a position by averaging the outcome of several random continuations, and can serve as an evaluation function at the leaves of a min-ma...
BROADBAND
1998
15 years 1 months ago
1998
In this paper, a method for calculating blocking experienced by dynamic multicast connections in a single link is presented. A service center at the root of a tree-type network pr...
104
Voted
SETN
2004
Springer
15 years 5 months ago
2004
Springer
This work explores the application of clustering methods for grouping structurally similar XML documents. Modeling the XML documents as rooted ordered labeled trees, we apply clust...