Sciweavers

338 search results - page 23 / 68
» On the Complexity of Termination Inference for Processes
Sort
View
GRC
2010
IEEE
14 years 10 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
WDAG
2000
Springer
87views Algorithms» more  WDAG 2000»
15 years 1 months ago
A Probabilistically Correct Leader Election Protocol for Large Groups
This paper presents a scalable leader election protocol for large process groups with a weak membership requirement. The underlying network is assumed to be unreliable but characte...
Indranil Gupta, Robbert van Renesse, Kenneth P. Bi...
GECCO
2009
Springer
148views Optimization» more  GECCO 2009»
14 years 7 months ago
Genetic programming for quantitative stock selection
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
Ying L. Becker, Una-May O'Reilly
DAGM
2008
Springer
14 years 11 months ago
Approximate Parameter Learning in Conditional Random Fields: An Empirical Investigation
We investigate maximum likelihood parameter learning in Conditional Random Fields (CRF) and present an empirical study of pseudo-likelihood (PL) based approximations of the paramet...
Filip Korc, Wolfgang Förstner
BICA
2010
14 years 4 months ago
Application Feedback in Guiding a Deep-Layered Perception Model
Deep-layer machine learning architectures continue to emerge as a promising biologically-inspired framework for achieving scalable perception in artificial agents. State inference ...
Itamar Arel, Shay Berant