Sciweavers

2190 search results - page 101 / 438
» Learning with the Set Covering Machine
Sort
View
ICALT
2009
IEEE
14 years 3 months ago
Learning Activity Spaces: Towards Flexibility in Learning Design?
Designing a computer-supported learning scenario involving a constructivist approach of learning lays on a paradox. On the one hand, learning flows must be precisely described –...
Anne Lejeune, Muriel Ney, Armin Weinberger, Margus...
ICML
2007
IEEE
14 years 10 months ago
Learning to combine distances for complex representations
The k-Nearest Neighbors algorithm can be easily adapted to classify complex objects (e.g. sets, graphs) as long as a proper dissimilarity function is given over an input space. Bo...
Adam Woznica, Alexandros Kalousis, Melanie Hilario
ICML
2007
IEEE
14 years 10 months ago
Asymptotic Bayesian generalization error when training and test distributions are different
In supervised learning, we commonly assume that training and test data are sampled from the same distribution. However, this assumption can be violated in practice and then standa...
Keisuke Yamazaki, Klaus-Robert Müller, Masash...
SIGIR
2003
ACM
14 years 2 months ago
SETS: search enhanced by topic segmentation
We present SETS, an architecture for efficient search in peer-to-peer networks, building upon ideas drawn from machine learning and social network theory. The key idea is to arran...
Mayank Bawa, Gurmeet Singh Manku, Prabhakar Raghav...
SCIA
2009
Springer
161views Image Analysis» more  SCIA 2009»
14 years 3 months ago
A Fast Optimization Method for Level Set Segmentation
Abstract. Level set methods are a popular way to solve the image segmentation problem in computer image analysis. A contour is implicitly represented by the zero level of a signed ...
Thord Andersson, Gunnar Läthén, Reiner...