Sciweavers

69 search results - page 1 / 14
» Knot selection by boosting techniques
Sort
View
CSDA
2007
66views more  CSDA 2007»
13 years 4 months ago
Knot selection by boosting techniques
Florian Leitenstorfer, Gerhard Tutz
CAE
2007
13 years 7 months ago
Celtic Knots Colorization based on Color Harmony Principles
This paper proposes two simple and powerful algorithms to automatically paint Celtic knots with aesthetic colors. The shape of the knot is generated from its dual graph as present...
Caroline Larboulette
ICDM
2009
IEEE
137views Data Mining» more  ICDM 2009»
13 years 11 months ago
Set-Based Boosting for Instance-Level Transfer
—The success of transfer to improve learning on a target task is highly dependent on the selected source data. Instance-based transfer methods reuse data from the source tasks to...
Eric Eaton, Marie desJardins
ICML
1999
IEEE
14 years 5 months ago
Lazy Bayesian Rules: A Lazy Semi-Naive Bayesian Learning Technique Competitive to Boosting Decision Trees
Lbr is a lazy semi-naive Bayesian classi er learning technique, designed to alleviate the attribute interdependence problem of naive Bayesian classi cation. To classify a test exa...
Zijian Zheng, Geoffrey I. Webb, Kai Ming Ting
NECO
2006
157views more  NECO 2006»
13 years 4 months ago
Experiments with AdaBoost.RT, an Improved Boosting Scheme for Regression
The application of boosting technique to the regression problems has received relatively little attention in contrast to the research aimed at classification problems. This paper ...
Durga L. Shrestha, Dimitri P. Solomatine