10419 search results - page 138 / 2084 » Relational information gain |
151
click to vote
WAIM
2004
Springer
15 years 12 months ago
2004
Springer
A top-N selection query against a relation is to find the N tuples that satisfy the query condition the best but not necessarily completely. In this paper, we propose a new method ...
179
click to vote
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
209
click to vote
KES
1998
Springer
15 years 10 months ago
1998
Springer
An agent must acquire internal representation appropriate for its task, environment, sensors. As a learning algorithm, reinforcement learning is often utilized to acquire the rela...
156
click to vote
SPATIALCOGNITION
1998
Springer
15 years 10 months ago
1998
Springer
Representations and processes involved in judgments of spatial relations after route learning are investigated. The main objective is to decide which relations are explicitly repre...
163
click to vote
ATAL
2008
Springer
15 years 8 months ago
2008
Springer
Virtual agents designed to establish relationships with more than one user must be able to identify and distinguish among those users with high reliability. We descr...