Sciweavers

2512 search results - page 87 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
COGSCI
2002
99views more  COGSCI 2002»
14 years 9 months ago
Learning words from sights and sounds: a computational model
This paper presents an implemented computational model of word acquisition which learns directly from raw multimodal sensory input. Set in an information theoretic framework, the ...
Deb Roy, Alex Pentland
CORR
2006
Springer
99views Education» more  CORR 2006»
14 years 10 months ago
Logical settings for concept learning from incomplete examples in First Order Logic
We investigate here concept learning from incomplete examples. Our first purpose is to discuss to what extent logical learning settings have to be modified in order to cope with da...
Dominique Bouthinon, Henry Soldano, Véroniq...
ICDE
2006
IEEE
166views Database» more  ICDE 2006»
15 years 11 months ago
WebIQ: Learning from the Web to Match Deep-Web Query Interfaces
Integrating Deep Web sources requires highly accurate semantic matches between the attributes of the source query interfaces. These matches are usually established by comparing th...
Wensheng Wu, AnHai Doan, Clement T. Yu
SACMAT
2009
ACM
15 years 4 months ago
Automating role-based provisioning by learning from examples
Role-based provisioning has been adopted as a standard component in leading Identity Management products due to its low administration cost. However, the cost of adjusting existin...
Qun Ni, Jorge Lobo, Seraphin B. Calo, Pankaj Rohat...
ICML
2005
IEEE
15 years 10 months ago
Analysis and extension of spectral methods for nonlinear dimensionality reduction
Many unsupervised algorithms for nonlinear dimensionality reduction, such as locally linear embedding (LLE) and Laplacian eigenmaps, are derived from the spectral decompositions o...
Fei Sha, Lawrence K. Saul