Sciweavers

1458 search results - page 73 / 292
» Practical Preference Relations for Large Data Sets
Sort
View
VLDB
2008
ACM
147views Database» more  VLDB 2008»
16 years 5 months ago
Tree-based partition querying: a methodology for computing medoids in large spatial datasets
Besides traditional domains (e.g., resource allocation, data mining applications), algorithms for medoid computation and related problems will play an important role in numerous e...
Kyriakos Mouratidis, Dimitris Papadias, Spiros Pap...
117
Voted
FLAIRS
2006
15 years 6 months ago
Mining the Web to Determine Similarity Between Words, Objects, and Communities
The World Wide Web provides a wealth of data that can be harnessed to help improve information retrieval and increase understanding of the relationships between different entities...
Mehran Sahami
CVPR
2010
IEEE
16 years 1 months ago
Outlier Removal Using Duality
In this paper we consider the problem of outlier removal for large scale multiview reconstruction problems. An efficient and very popular method for this task is RANSAC. However, a...
Carl Olsson, Anders Eriksson, Richard Hartley
154
Voted
COLT
2005
Springer
15 years 10 months ago
Generalization Error Bounds Using Unlabeled Data
We present two new methods for obtaining generalization error bounds in a semi-supervised setting. Both methods are based on approximating the disagreement probability of pairs of ...
Matti Kääriäinen
DAGM
2008
Springer
15 years 6 months ago
Boosting for Model-Based Data Clustering
In this paper a novel and generic approach for model-based data clustering in a boosting framework is presented. This method uses the forward stagewise additive modeling to learn t...
Amir Saffari, Horst Bischof