Sciweavers

1403 search results - page 27 / 281
» Set cover algorithms for very large datasets
Sort
View
KDD
2003
ACM
180views Data Mining» more  KDD 2003»
14 years 8 months ago
Classifying large data sets using SVMs with hierarchical clusters
Support vector machines (SVMs) have been promising methods for classification and regression analysis because of their solid mathematical foundations which convey several salient ...
Hwanjo Yu, Jiong Yang, Jiawei Han
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 3 months ago
Covering Games: Approximation through Non-cooperation
We propose approximation algorithms under game-theoretic considerations. We indroduce and study the general covering problem which is a natural generalization of the well-studied m...
Martin Gairing
DOLAP
1999
ACM
14 years 23 days ago
A Cache Filtering Optimisation for Queries to Massive Datasets on Tertiary Storage
We consider a system in which many users run queries to examine subsets of a large object set. The object set is partitioned into files on tape. A single subset of objects will b...
Koen Holtman, Peter van der Stok, Ian Willers
AUTOID
2005
IEEE
14 years 2 months ago
Experiments with an Improved Iris Segmentation Algorithm
Iris is claimed to be one of the best biometrics. We have collected a large data set of iris images, intentionally sampling a range of quality broader than that used by current co...
Xiaomei Liu, Kevin W. Bowyer, Patrick J. Flynn
SAC
2010
ACM
14 years 3 months ago
A generative pattern model for mining binary datasets
In many application fields, huge binary datasets modeling real life-phenomena are daily produced. The dataset records are usually associated with observations of some events, and...
Claudio Lucchese, Salvatore Orlando, Raffaele Pere...