Sciweavers

2750 search results - page 71 / 550
» The complexity of learning SUBSEQ(A)
Sort
View
ILP
2007
Springer
16 years 9 days ago
Combining Clauses with Various Precisions and Recalls to Produce Accurate Probabilistic Estimates
Statistical Relational Learning (SRL) combines the benefits of probabilistic machine learning approaches with complex, structured domains from Inductive Logic Programming (ILP). W...
Mark Goadrich, Jude W. Shavlik
ICML
2007
IEEE
16 years 7 months ago
Non-isometric manifold learning: analysis and an algorithm
In this work we take a novel view of nonlinear manifold learning. Usually, manifold learning is formulated in terms of finding an embedding or `unrolling' of a manifold into ...
Piotr Dollár, Serge J. Belongie, Vincent Ra...
AAAI
1993
15 years 7 months ago
Finding Accurate Frontiers: A Knowledge-Intensive Approach to Relational Learning
learning (EBL) component. In this paper we provide a brief review of FOIL and FOCL, then discuss how operationalizing a domain theory can adversely affect the accuracy of a learned...
Michael J. Pazzani, Clifford Brunk
JFR
2006
108views more  JFR 2006»
15 years 6 months ago
Learning in a hierarchical control system: 4D/RCS in the DARPA LAGR program
The Defense Applied Research Projects Agency (DARPA) Learning Applied to Ground Vehicles (LAGR) program aims to develop algorithms for autonomous vehicle navigation that learn how...
James S. Albus, Roger Bostelman, Tommy Chang, Tsai...
CVPR
2008
IEEE
16 years 8 months ago
Learning and using taxonomies for fast visual categorization
The computational complexity of current visual categorization algorithms scales linearly at best with the number of categories. The goal of classifying simultaneously Ncat = 104 -...
Gregory Griffin, Darya Perona