Sciweavers

12194 search results - page 403 / 2439
» Numberings Optimal for Learning
Sort
View
202
Voted
ML
2008
ACM
156views Machine Learning» more  ML 2008»
15 years 6 months ago
On the connection between the phase transition of the covering test and the learning success rate in ILP
It is well-known that heuristic search in ILP is prone to plateau phenomena. An explanation can be given after the work of Giordana and Saitta: the ILP covering test is NP-complete...
Érick Alphonse, Aomar Osmani
PKDD
2010
Springer
183views Data Mining» more  PKDD 2010»
15 years 5 months ago
Fast Active Exploration for Link-Based Preference Learning Using Gaussian Processes
Abstract. In preference learning, the algorithm observes pairwise relative judgments (preference) between items as training data for learning an ordering of all items. This is an i...
Zhao Xu, Kristian Kersting, Thorsten Joachims
HAIS
2010
Springer
15 years 4 months ago
Reducing Dimensionality in Multiple Instance Learning with a Filter Method
In this article, we describe a feature selection algorithm which can automatically find relevant features for multiple instance learning. Multiple instance learning is considered a...
Amelia Zafra, Mykola Pechenizkiy, Sebastián...
AAAI
2011
14 years 6 months ago
Heterogeneous Transfer Learning with RBMs
A common approach in machine learning is to use a large amount of labeled data to train a model. Usually this model can then only be used to classify data in the same feature spac...
Bin Wei, Christopher Pal
ICML
2002
IEEE
16 years 7 months ago
Combining Labeled and Unlabeled Data for MultiClass Text Categorization
Supervised learning techniques for text classi cation often require a large number of labeled examples to learn accurately. One way to reduce the amountoflabeled datarequired is t...
Rayid Ghani