Sciweavers

232 search results - page 18 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
DMIN
2008
190views Data Mining» more  DMIN 2008»
15 years 1 months ago
Optimization of Self-Organizing Maps Ensemble in Prediction
The knowledge discovery process encounters the difficulties to analyze large amount of data. Indeed, some theoretical problems related to high dimensional spaces then appear and de...
Elie Prudhomme, Stéphane Lallich
118
Voted
SIGMOD
2012
ACM
209views Database» more  SIGMOD 2012»
13 years 2 months ago
Locality-sensitive hashing scheme based on dynamic collision counting
Locality-Sensitive Hashing (LSH) and its variants are wellknown methods for solving the c-approximate NN Search problem in high-dimensional space. Traditionally, several LSH funct...
Junhao Gan, Jianlin Feng, Qiong Fang, Wilfred Ng
VLDB
2002
ACM
161views Database» more  VLDB 2002»
14 years 11 months ago
Distributed Search over the Hidden Web: Hierarchical Database Sampling and Selection
Many valuable text databases on the web have non-crawlable contents that are "hidden" behind search interfaces. Metasearchers are helpful tools for searching over many s...
Panagiotis G. Ipeirotis, Luis Gravano
SIGMOD
2009
ACM
175views Database» more  SIGMOD 2009»
15 years 12 months ago
Keyword search on structured and semi-structured data
Empowering users to access databases using simple keywords can relieve the users from the steep learning curve of mastering a structured query language and understanding complex a...
Yi Chen, Wei Wang 0011, Ziyang Liu, Xuemin Lin
APBC
2007
110views Bioinformatics» more  APBC 2007»
15 years 1 months ago
Fast Structural Similarity Search Based on Topology String Matching
ibe an abstract data model of protein structures by representing the geometry of proteins using spatial data types and present a framework for fast structural similarity search bas...
Sung-Hee Park, David Gilbert, Keun Ho Ryu