Sciweavers

1683 search results - page 88 / 337
» Learning with Mixtures of Trees
Sort
View
ICML
2003
IEEE
14 years 2 months ago
Decision Tree with Better Ranking
AUC(Area Under the Curve) of ROC(Receiver Operating Characteristics) has been recently used as a measure for ranking performanceof learning algorithms. In this paper, wepresent a ...
Charles X. Ling, Robert J. Yan
ICML
2007
IEEE
14 years 10 months ago
Cluster analysis of heterogeneous rank data
Cluster analysis of ranking data, which occurs in consumer questionnaires, voting forms or other inquiries of preferences, attempts to identify typical groups of rank choices. Emp...
Ludwig M. Busse, Peter Orbanz, Joachim M. Buhmann
IJCV
2002
133views more  IJCV 2002»
13 years 9 months ago
Probabilistic Tracking with Exemplars in a Metric Space
Abstract. A new, exemplar-based, probabilistic paradigm for visual tracking is presented. Probabilistic mechanisms are attractive because they handle fusion of information, especia...
Kentaro Toyama, Andrew Blake
SAC
2005
ACM
14 years 2 months ago
Learning decision trees from dynamic data streams
: This paper presents a system for induction of forest of functional trees from data streams able to detect concept drift. The Ultra Fast Forest of Trees (UFFT) is an incremental a...
João Gama, Pedro Medas, Pedro Pereira Rodri...
ILP
1997
Springer
14 years 1 months ago
A Logical Framework for Graph Theoretical Decision Tree Learning
Abstract. We present a logical approach to graph theoretical learning that is based on using alphabetic substitutions for modelling graph morphisms. A classi ed graph is represente...
Peter Geibel, Fritz Wysotzki