697 search results - page 8 / 140 » Approximation of Information Granule Sets |
115
Voted
EUSFLAT
2009
14 years 7 months ago
2009
Besides the problem of searching for effective methods for extracting knowledge from large databases (KDD) there are some additional problems with handling ecological data, namely ...
CVPR
2000
IEEE
15 years 11 months ago
2000
IEEE
In this paper, we address the problem of curve and surface reconstruction from sets of points. We introduce regular interpolants which are polygonal approximations of planar curve...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We introduce a natural generalization of submodular set cover and exact active learning with a finite hypothesis class (query learning). We call this new problem interactive submo...
AUSAI
2004
Springer
15 years 2 months ago
2004
Springer
Most propagation-based set constraint solvers approximate the set of possible sets that a variable can take by upper and lower bounds, and perform so-called set bounds propagation....
FUZZIEEE
2007
IEEE
15 years 3 months ago
2007
IEEE
Abstract— Feature Selection (FS) is a technique for dimensionality reduction. Its aims are to select a subset of the original features of a dataset which are rich in the most use...