NIPS 1998 - PDF Preprint Papers

NIPS 1998

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed NIPS-1998 Paper

click to vote

NIPS
1998

227views Information Technology» more NIPS 1998»

Controlling the Complexity of HMM Systems by Regularization

14 years 23 days ago

Download www.mmk.e-technik.tu-muenchen.de

This paper introduces a method for regularization of HMM systems that avoids parameter overfitting caused by insufficient training data. Regularization is done by augmenting the E...

Christoph Neukirchen, Gerhard Rigoll

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Related Conferences

Id	Views	Title	Status

1	227	Controlling the Complexity of HMM Systems by Regularization	claim
2	184	Facial Memory Is Kernel Density Estimation (Almost)	claim
3	164	Making Templates Rotationally Invariant. An Application to Rotated Digit Recognition	claim
4	164	Approximate Learning of Dynamic Models	claim
5	164	Finite-Sample Convergence Rates for Q-Learning and Indirect Algorithms	claim
6	156	Learning Nonlinear Dynamical Systems Using an EM Algorithm	claim
7	155	Batch and On-Line Parameter Estimation of Gaussian Mixtures Based on the Joint Entropy	claim
8	154	Semi-Supervised Support Vector Machines	claim
9	153	Outcomes of the Equivalence of Adaptive Ridge with Least Absolute Shrinkage	claim
10	151	Probabilistic Image Sensor Fusion	claim
11	147	Convergence of the Wake-Sleep Algorithm	claim
12	147	Coding Time-Varying Signals Using Sparse, Shift-Invariant Representations	claim
13	146	Bayesian Modeling of Facial Similarity	claim
14	140	Gradient Descent for General Reinforcement Learning	claim
15	138	Dynamically Adapting Kernels in Support Vector Machines	claim
16	138	Call-Based Fraud Detection in Mobile Communication Networks Using a Hierarchical Regime-Switching Model	claim
17	137	Risk Sensitive Reinforcement Learning	claim
18	133	Support Vector Machines Applied to Face Recognition	claim
19	132	Learning a Continuous Hidden Variable Model for Binary Data	claim
20	131	Lazy Learning Meets the Recursive Least Squares Algorithm	claim
21	130	Modeling Surround Suppression in V1 Neurons with a Statistically Derived Normalization Model	claim
22	129	Probabilistic Modeling for Face Orientation Discrimination: Learning from Labeled and Unlabeled Data	claim
23	129	Learning to Estimate Scenes from Images	claim
24	121	Inference in Multilayer Networks via Large Deviation Bounds	claim
25	117	Fisher Scoring and a Mixture of Modes Approach for Approximate Inference and Learning in Nonlinear State Space Models	claim
26	117	A High Performance k-NN Classifier Using a Binary Correlation Matrix Memory	claim
27	112	Learning from Dyadic Data	claim
28	112	Computational Differences between Asymmetrical and Symmetrical Networks	claim
29	111	Shrinking the Tube: A New Support Vector Regression Algorithm	claim
30	108	Using Analytic QP and Sparseness to Speed Training of Support Vector Machines	claim
31	107	Example-Based Image Synthesis of Articulated Figures	claim
32	107	Exploring Unknown Environments with Real-Time Search or Reinforcement Learning	claim
33	107	SMEM Algorithm for Mixture Models	claim
34	106	A Polygonal Line Algorithm for Constructing Principal Curves	claim
35	106	Robot Docking Using Mixtures of Gaussians	claim
36	105	Divisive Normalization, Line Attractor Networks and Ideal Observers	claim
37	102	An Entropic Estimator for Structure Discovery	claim
38	102	Analyzing and Visualizing Single-Trial Event-Related Potentials	claim
39	102	Reinforcement Learning Based on On-Line EM Algorithm	claim
40	101	Bayesian Modeling of Human Concept Learning	claim
41	100	Almost Linear VC Dimension Bounds for Piecewise Polynomial Networks	claim
42	95	Maximum Conditional Likelihood via Bound Maximization and the CEM Algorithm	claim
43	90	Computation of Smooth Optical Flow in a Feedback Connected Analog Network	claim
44	89	Evidence for a Forward Dynamics Model in Human Adaptive Motor Control	claim
45	89	Orientation, Scale, and Discontinuity as Emergent Properties of Illusory Contour Shape	claim
46	88	Scheduling Straight-Line Code Using Reinforcement Learning and Rollouts	claim
47	85	Global Optimisation of Neural Network Models via Sequential Sampling	claim
48	80	Efficient Bayesian Parameter Estimation in Large Discrete Domains	claim
49	80	Distributional Population Codes and Multiple Motion Models	claim
50	79	Replicator Equations, Maximal Cliques, and Graph Isomorphism	claim
51	79	A Theory of Mean Field Approximation	claim
52	77	Optimizing Correlation Algorithms for Hardware-Based Transient Classification	claim
53	74	Restructuring Sparse High Dimensional Data for Effective Retrieval	claim
54	73	Multi-Electrode Spike Sorting by Clustering Transfer Functions	claim
55	67	A Phase Space Approach to Minimax Entropy Learning and the Minutemax Approximations	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers