1120 search results - page 155 / 224 » Visualization of Support Vector Machines with Unsupervised L... |
152
Voted
JMLR
2002
15 years 2 months ago
2002
Recently, sample complexity bounds have been derived for problems involving linear functions such as neural networks and support vector machines. In many of these theoretical stud...
170
Voted
ICASSP
2011
IEEE
14 years 6 months ago
2011
IEEE
This paper considers application of Deep Belief Nets (DBNs) to natural language call routing. DBNs have been successfully applied to a number of tasks, including image, audio and ...
153
click to vote
CVPR
2009
IEEE
16 years 9 months ago
2009
IEEE
Cross-domain learning methods have shown promising
results by leveraging labeled patterns from auxiliary domains
to learn a robust classifier for target domain, which
has a limi...
108
Voted
NIPS
2007
15 years 4 months ago
2007
The notion of algorithmic stability has been used effectively in the past to derive tight generalization bounds. A key advantage of these bounds is that they are designed for spec...
145
click to vote
BMCBI
2010
14 years 9 months ago
2010
Background: DNA Microarrays have become the standard method for large scale analyses of gene expression and epigenomics. The increasing complexity and inherent noisiness of the ge...