Sciweavers

2512 search results - page 163 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
90
Voted
KDD
2008
ACM
153views Data Mining» more  KDD 2008»
15 years 10 months ago
Information extraction from Wikipedia: moving down the long tail
Not only is Wikipedia a comprehensive source of quality information, it has several kinds of internal structure (e.g., relational summaries known as infoboxes), which enable self-...
Fei Wu, Raphael Hoffmann, Daniel S. Weld
ICML
1997
IEEE
15 years 11 months ago
Characterizing the generalization performance of model selection strategies
Abstract: We investigate the structure of model selection problems via the bias/variance decomposition. In particular, we characterize the essential structure of a model selection ...
Dale Schuurmans, Lyle H. Ungar, Dean P. Foster
ISNN
2007
Springer
15 years 4 months ago
Extensions of Manifold Learning Algorithms in Kernel Feature Space
Manifold learning algorithms have been proven to be capable of discovering some nonlinear structures. However, it is hard for them to extend to test set directly. In this paper, a ...
Yaoliang Yu, Peng Guan, Liming Zhang
72
Voted
AAAI
2000
14 years 11 months ago
Self-Organization of Innate Face Preferences: Could Genetics Be Expressed through Learning?
Self-organizing models develop realistic cortical structures when given approximations of the visual environment as input, and are an effective way to model the development of fac...
James A. Bednar, Risto Miikkulainen
UAI
2008
14 years 11 months ago
Learning Inclusion-Optimal Chordal Graphs
Chordal graphs can be used to encode dependency models that are representable by both directed acyclic and undirected graphs. This paper discusses a very simple and efficient algo...
Vincent Auvray, Louis Wehenkel