Sciweavers

520 search results - page 41 / 104
» Subset Counting in Trees
Sort
View
ADC
2003
Springer
182views Database» more  ADC 2003»
14 years 1 months ago
CT-ITL : Efficient Frequent Item Set Mining Using a Compressed Prefix Tree with Pattern Growth
Discovering association rules that identify relationships among sets of items is an important problem in data mining. Finding frequent item sets is computationally the most expens...
Yudho Giri Sucahyo, Raj P. Gopalan
ICMLA
2007
13 years 9 months ago
Estimating class probabilities in random forests
For both single probability estimation trees (PETs) and ensembles of such trees, commonly employed class probability estimates correct the observed relative class frequencies in e...
Henrik Boström
CSREAPSC
2006
13 years 9 months ago
An Inexact Matching Method Based on Ontology and Semantic Distance for Resource Discovery and Interaction
- To overcome shortcomings of Exact Matching Method (EMM) and Substitute Description Method (SDM), an Inexact Matching Method Based on Ontology and Semantic Distance (OSDIMM) is in...
Tang Shancheng, Qian Yi, Wang Wei
JOIN
2007
91views more  JOIN 2007»
13 years 7 months ago
An Optimal Rebuilding Strategy for an Incremental Tree Problem
This paper is devoted to the following incremental problem. Initially, a graph and a distinguished subset of vertices, called initial group, are given. This group is connected by ...
Nicolas Thibault, Christian Laforest
ACL
1994
13 years 9 months ago
Multiset-Valued Linear Index Grammars: Imposing Dominance Constraints on Derivations
This paper defines multiset-valued linear index grammar and unordered vector grammar with dominance links. The former models certain uses of multisetvalued feature structures in u...
Owen Rambow