Sciweavers

1921 search results - page 361 / 385
» Learning from sensor network data
Sort
View
59
Voted
GECCO
2007
Springer
149views Optimization» more  GECCO 2007»
15 years 3 months ago
Division blocks and the open-ended evolution of development, form, and behavior
We present a new framework for artificial life involving physically simulated, three-dimensional blocks called Division Blocks. Division Blocks can grow and shrink, divide and fo...
Lee Spector, Jon Klein, Mark Feinstein
ECML
2006
Springer
15 years 1 months ago
Deconvolutive Clustering of Markov States
In this paper we formulate the problem of grouping the states of a discrete Markov chain of arbitrary order simultaneously with deconvolving its transition probabilities. As the na...
Ata Kabán, Xin Wang
AAAI
2004
14 years 11 months ago
Online Parallel Boosting
This paper presents a new boosting (arcing) algorithm called POCA, Parallel Online Continuous Arcing. Unlike traditional boosting algorithms (such as Arc-x4 and Adaboost), that co...
Jesse A. Reichler, Harlan D. Harris, Michael A. Sa...
JMLR
2002
102views more  JMLR 2002»
14 years 9 months ago
Optimal Structure Identification With Greedy Search
In this paper we prove the so-called "Meek Conjecture". In particular, we show that if a DAG H is an independence map of another DAG G, then there exists a finite sequen...
David Maxwell Chickering
IJAR
2010
97views more  IJAR 2010»
14 years 8 months ago
Parameter estimation and model selection for mixtures of truncated exponentials
Bayesian networks with mixtures of truncated exponentials (MTEs) support efficient inference algorithms and provide a flexible way of modeling hybrid domains (domains containing ...
Helge Langseth, Thomas D. Nielsen, Rafael Rum&iacu...