Sciweavers

919 search results - page 58 / 184
» Generalizing over Several Learning Settings
Sort
View
ALT
2000
Springer
14 years 4 days ago
On the Hardness of Learning Acyclic Conjunctive Queries
A conjunctive query problem in relational database theory is a problem to determine whether or not a tuple belongs to the answer of a conjunctive query over a database. Here, a tup...
Kouichi Hirata
CHI
2011
ACM
12 years 11 months ago
Utilizing multimedia capabilities of mobile phones to support teaching in schools in rural panama
Providing good education is one of the major challenges for humanity. In many developing regions in the world improving educational standards is seen as a central building block f...
Elba del Carmen Valderrama Bahamóndez, Chri...
STOC
2000
ACM
174views Algorithms» more  STOC 2000»
14 years 4 days ago
Noise-tolerant learning, the parity problem, and the statistical query model
We describe a slightly subexponential time algorithm for learning parity functions in the presence of random classification noise, a problem closely related to several cryptograph...
Avrim Blum, Adam Kalai, Hal Wasserman
MLDM
2007
Springer
14 years 1 months ago
Transductive Learning from Relational Data
Transduction is an inference mechanism “from particular to particular”. Its application to classification tasks implies the use of both labeled (training) data and unlabeled (...
Michelangelo Ceci, Annalisa Appice, Nicola Barile,...
WWW
2008
ACM
14 years 8 months ago
Learning to classify short and sparse text & web with hidden topics from large-scale data collections
This paper presents a general framework for building classifiers that deal with short and sparse text & Web segments by making the most of hidden topics discovered from larges...
Xuan Hieu Phan, Minh Le Nguyen, Susumu Horiguchi