Sciweavers

3051 search results - page 286 / 611
» Learning Internal Representations
Sort
View
ICANN
2011
Springer
14 years 8 months ago
Transforming Auto-Encoders
The artificial neural networks that are used to recognize shapes typically use one or more layers of learned feature detectors that produce scalar outputs. By contrast, the comput...
Geoffrey E. Hinton, Alex Krizhevsky, Sida D. Wang
151
Voted
CORR
2012
Springer
220views Education» more  CORR 2012»
14 years 10 days ago
Sparse Topical Coding
We present sparse topical coding (STC), a non-probabilistic formulation of topic models for discovering latent representations of large collections of data. Unlike probabilistic t...
Jun Zhu, Eric P. Xing
BMCBI
2004
113views more  BMCBI 2004»
15 years 4 months ago
Oligo kernels for datamining on biological sequences: a case study on prokaryotic translation initiation sites
Background: Kernel-based learning algorithms are among the most advanced machine learning methods and have been successfully applied to a variety of sequence classification tasks ...
Peter Meinicke, Maike Tech, Burkhard Morgenstern, ...
172
Voted
TNN
2011
200views more  TNN 2011»
14 years 11 months ago
Domain Adaptation via Transfer Component Analysis
Domain adaptation solves a learning problem in a target domain by utilizing the training data in a different but related source domain. Intuitively, discovering a good feature rep...
Sinno Jialin Pan, Ivor W. Tsang, James T. Kwok, Qi...
120
Voted
ICML
2009
IEEE
16 years 5 months ago
Generalization analysis of listwise learning-to-rank algorithms
This paper presents a theoretical framework for ranking, and demonstrates how to perform generalization analysis of listwise ranking algorithms using the framework. Many learning-...
Yanyan Lan, Tie-Yan Liu, Zhiming Ma, Hang Li