Sciweavers

520 search results - page 31 / 104
» Subset Counting in Trees
Sort
View
DIS
2008
Springer
13 years 9 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel
EDBT
2006
ACM
106views Database» more  EDBT 2006»
14 years 8 months ago
DPTree: A Distributed Pattern Tree Index for Partial-Match Queries in Peer-to-Peer Networks
Abstract. Partial-match queries return data items that contain a subset of the query keywords and order the results based on the statistical properties of the matched keywords. The...
Dyce Jing Zhao, Dik Lun Lee, Qiong Luo
ESA
2007
Springer
125views Algorithms» more  ESA 2007»
14 years 1 months ago
Pricing Tree Access Networks with Connected Backbones
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
Vineet Goyal, Anupam Gupta, Stefano Leonardi, R. R...
BMCBI
2004
181views more  BMCBI 2004»
13 years 7 months ago
Iterative class discovery and feature selection using Minimal Spanning Trees
Background: Clustering is one of the most commonly used methods for discovering hidden structure in microarray gene expression data. Most current methods for clustering samples ar...
Sudhir Varma, Richard Simon
ICASSP
2010
IEEE
13 years 8 months ago
Language model adaptation using Random Forests
In this paper we investigate random forest based language model adaptation. Large amounts of out-of-domain data are used to grow the decision trees while very small amounts of in-...
Anoop Deoras, Frederick Jelinek, Yi Su