Sciweavers

160 search results - page 12 / 32
» Efficient Kernel-based Learning for Trees
Sort
View
ICML
2010
IEEE
14 years 10 months ago
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
Seyoung Kim, Eric P. Xing
ML
2006
ACM
163views Machine Learning» more  ML 2006»
14 years 9 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
NPL
2006
130views more  NPL 2006»
14 years 9 months ago
A Fast Feature-based Dimension Reduction Algorithm for Kernel Classifiers
This paper presents a novel dimension reduction algorithm for kernel based classification. In the feature space, the proposed algorithm maximizes the ratio of the squared between-c...
Senjian An, Wanquan Liu, Svetha Venkatesh, Ronny T...
DIS
2004
Springer
15 years 1 months ago
Maximum a Posteriori Tree Augmented Naive Bayes Classifiers
Bayesian classifiers such as Naive Bayes or Tree Augmented Naive Bayes (TAN) have shown excellent performance given their simplicity and heavy underlying independence assumptions....
Jesús Cerquides, Ramon López de M&aa...
IJISEC
2002
86views more  IJISEC 2002»
14 years 9 months ago
Using AVL trees for fault-tolerant group key management
In this paper we describe an efficient algorithm for the management of group-keys for Group Communication Systems. Our algorithm is based on the notion of key-graphs, previously u...
Ohad Rodeh, Kenneth P. Birman, Danny Dolev