3607 search results - page 200 / 722 » Learning with structured sparsity |
149
Voted
UAI
2008
15 years 5 months ago
2008
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...
157
click to vote
KDD
2004
ACM
16 years 4 months ago
2004
ACM
Many automated learning procedures lack interpretability, operating effectively as a black box: providing a prediction tool but no explanation of the underlying dynamics that driv...
120
Voted
NIPS
2003
15 years 5 months ago
2003
In this paper we obtain convergence bounds for the concentration of Bayesian posterior distributions (around the true distribution) using a novel method that simplifies and enhan...
156
click to vote
NIPS
1990
15 years 5 months ago
1990
A new class of data structures called "bumptrees" is described. These structures are useful for efficiently implementing a number of neural network related operations. A...
147
click to vote
ALT
2003
Springer
15 years 7 months ago
2003
Springer
Due to the rapid growth of tree structured data such as Web documents, efficient learning from tree structured data becomes more and more important. In order to represent structura...