1813 search results - page 241 / 363 » Calculi of Approximation Spaces |
131
click to vote
IJCAI
2007
15 years 5 months ago
2007
We introduce an approach to autonomously creating state space abstractions for an online reinforcement learning agent using a relational representation. Our approach uses a tree-b...
139
click to vote
NIPS
2007
15 years 5 months ago
2007
Clustering is often formulated as a discrete optimization problem. The objective is to find, among all partitions of the data set, the best one according to some quality measure....
124
click to vote
SODA
2007
ACM
15 years 5 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
137
click to vote
NIPS
2004
15 years 5 months ago
2004
Linear Discriminant Analysis (LDA) is a well-known method for feature extraction and dimension reduction. It has been used widely in many applications such as face recognition. Re...
145
click to vote
NIPS
2003
15 years 5 months ago
2003
Many problems in information processing involve some form of dimensionality reduction. In this paper, we introduce Locality Preserving Projections (LPP). These are linear projecti...