Sciweavers

22 search results - page 2 / 5
» Planar Point Location for Large Data Sets: To Seek or Not to...
Sort
View
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
13 years 5 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
VLDB
2009
ACM
159views Database» more  VLDB 2009»
14 years 5 months ago
Anytime measures for top-k algorithms on exact and fuzzy data sets
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this article, we initiate research on the anytime ...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...
SSPR
1998
Springer
13 years 9 months ago
Distribution Free Decomposition of Multivariate Data
: We present a practical approach to nonparametric cluster analysis of large data sets. The number of clusters and the cluster centres are automatically derived by mode seeking wit...
Dorin Comaniciu, Peter Meer
CGF
2006
125views more  CGF 2006»
13 years 4 months ago
Translational Covering of Closed Planar Cubic B-Spline Curves
Spline curves are useful in a variety of geometric modeling and graphics applications and covering problems abound in practical settings. This work defines a class of covering dec...
Cristina Neacsu, Karen Daniels
VLDB
2007
ACM
129views Database» more  VLDB 2007»
13 years 11 months ago
Anytime Measures for Top-k Algorithms
Top-k queries on large multi-attribute data sets are fundamental operations in information retrieval and ranking applications. In this paper, we initiate research on the anytime b...
Benjamin Arai, Gautam Das, Dimitrios Gunopulos, Ni...