Sciweavers

371 search results - page 27 / 75
» Learning to match and cluster large high-dimensional data se...
Sort
View
DEXA
2007
Springer
154views Database» more  DEXA 2007»
14 years 1 months ago
Performance Oriented Schema Matching
Abstract. Semantic matching of schemas in heterogeneous data sharing systems is time consuming and error prone. Existing mapping tools employ semi-automatic techniques for mapping ...
Khalid Saleem, Zohra Bellahsene, Ela Hunt
CVPR
2010
IEEE
13 years 6 months ago
Transform Coding for Fast Approximate Nearest Neighbor Search in High Dimensions
We examine the problem of large scale nearest neighbor search in high dimensional spaces and propose a new approach based on the close relationship between nearest neighbor search...
Jonathan Brandt
CVPR
2010
IEEE
14 years 3 months ago
SPEC Hashing: Similarity Preserving algorithm for Entropy-based Coding
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
Ruei-Sung Lin, David Ross, Jay Yagnik
ICAI
2004
13 years 9 months ago
A Comparison of Resampling Methods for Clustering Ensembles
-- Combination of multiple clusterings is an important task in the area of unsupervised learning. Inspired by the success of supervised bagging algorithms, we propose a resampling ...
Behrouz Minaei-Bidgoli, Alexander P. Topchy, Willi...
CVPR
2008
IEEE
14 years 9 months ago
Incremental learning of nonparametric Bayesian mixture models
Clustering is a fundamental task in many vision applications. To date, most clustering algorithms work in a batch setting and training examples must be gathered in a large group b...
Ryan Gomes, Max Welling, Pietro Perona