Sciweavers

1252 search results - page 125 / 251
» Minimizing Learned Clauses
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Learning Fast Approximations of Sparse Coding
In Sparse Coding (SC), input vectors are reconstructed using a sparse linear combination of basis vectors. SC has become a popular method for extracting features from data. For a ...
Karol Gregor, Yann LeCun
126
Voted
CORR
2010
Springer
104views Education» more  CORR 2010»
15 years 4 months ago
Empirical learning aided by weak domain knowledge in the form of feature importance
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
Ridwan Al Iqbal
AIR
2006
107views more  AIR 2006»
15 years 4 months ago
Just enough learning (of association rules): the TAR2 "Treatment" learner
Abstract. An over-zealous machine learner can automatically generate large, intricate, theories which can be hard to understand. However, such intricate learning is not necessary i...
Tim Menzies, Ying Hu
TCBB
2008
120views more  TCBB 2008»
15 years 4 months ago
Learning Scoring Schemes for Sequence Alignment from Partial Examples
When aligning biological sequences, the choice of scoring scheme is critical. Even small changes in gap penalties, for example, can yield radically different alignments. A rigorous...
Eagu Kim, John D. Kececioglu
132
Voted
NN
2002
Springer
114views Neural Networks» more  NN 2002»
15 years 4 months ago
Learning the parts of objects by auto-association
Recognition-by-components is one of the possible strategies proposed for object recognition by the brain, but little is known about the low-level mechanism by which the parts of o...
Xijin Ge, Shuichi Iwata