Sciweavers

3556 search results - page 545 / 712
» Can machine learning be secure
Sort
View
IJON
2008
116views more  IJON 2008»
13 years 10 months ago
Discovering speech phones using convolutive non-negative matrix factorisation with a sparseness constraint
Discovering a representation that allows auditory data to be parsimoniously represented is useful for many machine learning and signal processing tasks. Such a representation can ...
Paul D. O'Grady, Barak A. Pearlmutter
IJON
2008
156views more  IJON 2008»
13 years 10 months ago
Structural identifiability of generalized constraint neural network models for nonlinear regression
Identifiability becomes an essential requirement for learning machines when the models contain physically interpretable parameters. This paper presents two approaches to examining...
Shuang-Hong Yang, Bao-Gang Hu, Paul-Henry Courn&eg...
JMLR
2006
135views more  JMLR 2006»
13 years 10 months ago
Quantile Regression Forests
Random forests were introduced as a machine learning tool in Breiman (2001) and have since proven to be very popular and powerful for high-dimensional regression and classificatio...
Nicolai Meinshausen
MT
1998
91views more  MT 1998»
13 years 10 months ago
A Controlled Skip Parser
Real-world natural language sentences are long and complex, and always contain unexpected grammatical constructions. It even includes noise and ungrammaticality. This paper descri...
Kenji Yamada
IEICET
2010
132views more  IEICET 2010»
13 years 9 months ago
Direct Importance Estimation with a Mixture of Probabilistic Principal Component Analyzers
Estimating the ratio of two probability density functions (a.k.a. the importance) has recently gathered a great deal of attention since importance estimators can be used for solvi...
Makoto Yamada, Masashi Sugiyama, Gordon Wichern, J...