Sciweavers

620 search results - page 28 / 124
» Learning with Temporary Memory
Sort
View
213
Voted
VLDB
2006
ACM
162views Database» more  VLDB 2006»
16 years 2 months ago
Dependency trees in sub-linear time and bounded memory
We focus on the problem of efficient learning of dependency trees. Once grown, they can be used as a special case of a Bayesian network, for PDF approximation, and for many other u...
Dan Pelleg, Andrew W. Moore
AGI
2008
15 years 3 months ago
Extending the Soar Cognitive Architecture
One approach in pursuit of general intelligent agents has been to concentrate on the underlying cognitive architecture, of which Soar is a prime example. In the past, Soar has reli...
John E. Laird
105
Voted
AUSAI
2006
Springer
15 years 6 months ago
Voting Massive Collections of Bayesian Network Classifiers for Data Streams
Abstract. We present a new method for voting exponential (in the number of attributes) size sets of Bayesian classifiers in polynomial time with polynomial memory requirements. Tra...
Remco R. Bouckaert
MAICS
2003
15 years 3 months ago
Grounded Concept Development Using Introspective Atoms
In this paper we present a system that uses its underlying physiology, a hierarchical memory and a collection of memory management algorithms to learn concepts as cases and to bui...
Eric G. Berkowitz, Brian E. Mastenbrook
91
Voted
ICANN
2005
Springer
15 years 7 months ago
Short Term Memories and Forcing the Re-use of Knowledge for Generalization
Despite the well-known performances and the theoretical power of neural networks, learning and generalizing are sometimes very difficult. In this article, we investigate how short ...
Laurent Orseau