Sciweavers

1800 search results - page 233 / 360
» Learning Restart Strategies
Sort
View
ICML
2004
IEEE
16 years 6 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
ICML
1998
IEEE
16 years 6 months ago
An Efficient Boosting Algorithm for Combining Preferences
We study the problem of learning to accurately rank a set of objects by combining a given collection of ranking or preference functions. This problem of combining preferences aris...
Yoav Freund, Raj D. Iyer, Robert E. Schapire, Yora...
PKDD
2009
Springer
174views Data Mining» more  PKDD 2009»
15 years 12 months ago
Active and Semi-supervised Data Domain Description
Data domain description techniques aim at deriving concise descriptions of objects belonging to a category of interest. For instance, the support vector domain description (SVDD) l...
Nico Görnitz, Marius Kloft, Ulf Brefeld
WMTE
2005
IEEE
15 years 11 months ago
'Location is not enough!': an Empirical Study of Location-Awareness in Mobile Collaboration
: There is an ever growing number of mobile learning applications based on location-awareness, However, there is still a lack of information concerning how it might impact socio-co...
Nicolas Nova, Fabien Girardin, Pierre Dillenbourg
CVPR
2005
IEEE
15 years 7 months ago
Database-Guided Segmentation of Anatomical Structures with Complex Appearance
The segmentation of anatomical structures has been traditionally formulated as a perceptual grouping task, and solved through clustering and variational approaches. However, such ...
Bogdan Georgescu, Xiang Sean Zhou, Dorin Comaniciu...