Sciweavers

1923 search results - page 115 / 385
» Weighted Decision Trees
Sort
View
KDD
2009
ACM
173views Data Mining» more  KDD 2009»
16 years 6 months ago
The offset tree for learning with partial labels
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...
Alina Beygelzimer, John Langford
MFCS
2000
Springer
15 years 10 months ago
Bilinear Functions and Trees over the (max, +) Semiring
Abstract. We consider the iterates of bilinear functions over the semiring (max, +). Equivalently, our object of study can be viewed as recognizable tree series over the semiring (...
Sabrina Mantaci, Vincent D. Blondel, Jean Mairesse
CGF
2008
110views more  CGF 2008»
15 years 6 months ago
TimeRadarTrees: Visualizing Dynamic Compound Digraphs
The evolution of dependencies in information hierarchies can be modeled by sequences of compound digraphs with edge weights. In this paper we present a novel approach to visualize...
Michael Burch, Stephan Diehl
ADMA
2006
Springer
110views Data Mining» more  ADMA 2006»
15 years 10 months ago
Learning with Local Drift Detection
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
João Gama, Gladys Castillo
ICPR
2002
IEEE
15 years 11 months ago
Uniformity Testing Using Minimal Spanning Tree
Testing for uniformity of multivariate data is the initial step in exploratory pattern analysis. We propose a new uniformity testing method, which first computes the maximum (sta...
Anil K. Jain, Xiaowei Xu, Tin Kam Ho, Fan Xiao