Sciweavers

2615 search results - page 515 / 523
» Predictive Hebbian Learning
Sort
View
NIPS
2003
13 years 11 months ago
Boosting versus Covering
We investigate improvements of AdaBoost that can exploit the fact that the weak hypotheses are one-sided, i.e. either all its positive (or negative) predictions are correct. In pa...
Kohei Hatano, Manfred K. Warmuth
SDM
2003
SIAM
123views Data Mining» more  SDM 2003»
13 years 11 months ago
Fast Online SVD Revisions for Lightweight Recommender Systems
The singular value decomposition (SVD) is fundamental to many data modeling/mining algorithms, but SVD algorithms typically have quadratic complexity and require random access to ...
Matthew Brand
NIPS
1998
13 years 11 months ago
An Entropic Estimator for Structure Discovery
We introduce a novel framework for simultaneous structure and parameter learning in hidden-variable conditional probability models, based on an entropic prior and a solution for i...
Matthew Brand
WSC
2000
13 years 11 months ago
Model abstraction for discrete event systems using neural networks and sensitivity information
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
Christos G. Panayiotou, Christos G. Cassandras, We...
ISMB
1994
13 years 11 months ago
Stochastic Motif Extraction Using Hidden Markov Model
In this paper, westudy the application of an ttMM(hidden Markov model) to the problem of representing protein sequencesby a stochastic motif. Astochastic protein motif represents ...
Yukiko Fujiwara, Minoru Asogawa, Akihiko Konagaya