Sciweavers

259 search results - page 32 / 52
» Clustering for Approximate Similarity Search in High-Dimensi...
Sort
View
SISAP
2009
IEEE
122views Data Mining» more  SISAP 2009»
15 years 4 months ago
Dynamic Spatial Approximation Trees for Massive Data
—Metric space searching is an emerging technique to address the problem of efficient similarity searching in many applications, including multimedia databases and other reposito...
Gonzalo Navarro, Nora Reyes
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
80
Voted
EUSFLAT
2003
145views Fuzzy Logic» more  EUSFLAT 2003»
14 years 11 months ago
Proximity fuzzy clustering for web context analysis
This study extends the web classification approach through a proximity-based fuzzy clustering sensible to the influence of the page. The proximity-based fuzzy clustering works in ...
Vincenzo Loia, Witold Pedrycz, Sabrina Senatore
ICDAR
2003
IEEE
15 years 2 months ago
Accelerating Large Character Set Recognition using Pivots
This paper proposes a method to accelerate character recognition of a large character set by employing pivots into the search space. We divide the feature space of character categ...
Yiping Yang, Ondrej Velek, Masaki Nakagawa
DATAMINE
2006
224views more  DATAMINE 2006»
14 years 9 months ago
Characteristic-Based Clustering for Time Series Data
With the growing importance of time series clustering research, particularly for similarity searches amongst long time series such as those arising in medicine or finance, it is cr...
Xiaozhe Wang, Kate A. Smith, Rob J. Hyndman