697 search results - page 22 / 140 » Approximation of Information Granule Sets |
ICML
2009
IEEE
15 years 6 months ago
2009
IEEE
Virtually all methods of learning dynamic systems from data start from the same basic assumption: that the learning algorithm will be provided with a sequence, or trajectory, of d...
111
click to vote
KDD
2000
ACM
15 years 3 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
117
click to vote
SODA
2010
ACM
14 years 9 months ago
2010
ACM
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
165
click to vote
SIGMOD
2008
ACM
15 years 12 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...
214
click to vote
ICDE
2001
IEEE
16 years 1 months ago
2001
IEEE
In this paper, we develop a general framework for approximate nearest neighbor queries. We categorize the current approaches for nearest neighbor query processing based on either ...