Sciweavers

3096 search results - page 389 / 620
» Theory and Use of the EM Algorithm
Sort
View
ICNC
2005
Springer
16 years 2 days ago
A Game-Theoretic Approach to Competitive Learning in Self-Organizing Maps
Abstract. Self-Organizing Maps (SOM) is a powerful tool for clustering and discovering patterns in data. Competitive learning in the SOM training process focusses on finding a neu...
Joseph P. Herbert, Jingtao Yao
MLCW
2005
Springer
16 years 1 days ago
Learning Textual Entailment on a Distance Feature Space
Textual Entailment recognition is a very difficult task as it is one of the fundamental problems in any semantic theory of natural language. As in many other NLP tasks, Machine Lea...
Maria Teresa Pazienza, Marco Pennacchiotti, Fabio ...
GECCO
2005
Springer
16 years 9 hour ago
Probing for limits to building block mixing with a tunably-difficult problem for genetic programming
This paper describes a tunably-difficult problem for genetic programming (GP) that probes for limits to building block mixing and assembly. The existence of such a problem can be ...
Jason M. Daida, Michael E. Samples, Matthew J. Byo...
HYBRID
2004
Springer
15 years 12 months ago
Bisimulation of Dynamical Systems
A general notion of bisimulation is studied for dynamical systems. An algebraic characterization of bisimulation together with an algorithm for computing the maximal bisimulation r...
A. J. van der Schaft
DCC
2003
IEEE
15 years 12 months ago
Rate-Distortion Bound for Joint Compression and Classification
- Rate-distortion theory is applied to the problem of joint compression and classification. A Lagrangian distortion measure is used to consider both the squared Euclidean error in ...
Yanting Dong, Lawrence Carin