Sciweavers

232 search results - page 10 / 47
» Fast High-Dimensional Data Search in Incomplete Databases
Sort
View
EDBT
2006
ACM
156views Database» more  EDBT 2006»
15 years 11 months ago
Indexing Incomplete Databases
Incomplete databases, that is, databases that are missing data, are present in many research domains. It is important to derive techniques to access these databases efficiently. We...
Guadalupe Canahuate, Michael Gibas, Hakan Ferhatos...
ICDE
1996
IEEE
228views Database» more  ICDE 1996»
16 years 29 days ago
Similarity Indexing with the SS-tree
Eficient indezing of high dimensional feature vectors is important to allow visual information systems and a number other applications to scale up to large databases. In this pape...
David A. White, Ramesh Jain
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
15 years 4 months ago
Similarity search and locality sensitive hashing using ternary content addressable memories
Similarity search methods are widely used as kernels in various data mining and machine learning applications including those in computational biology, web search/clustering. Near...
Rajendra Shinde, Ashish Goel, Pankaj Gupta, Debojy...
ICDE
2003
IEEE
146views Database» more  ICDE 2003»
16 years 29 days ago
Similarity Search in Sets and Categorical Data Using the Signature Tree
Data mining applications analyze large collections of set data and high dimensional categorical data. Search on these data types is not restricted to the classic problems of minin...
Nikos Mamoulis, David W. Cheung, Wang Lian
EDBT
2008
ACM
132views Database» more  EDBT 2008»
15 years 11 months ago
Indexing high-dimensional data in dual distance spaces: a symmetrical encoding approach
Due to the well-known dimensionality curse problem, search in a high-dimensional space is considered as a "hard" problem. In this paper, a novel symmetrical encoding-bas...
Yi Zhuang, Yueting Zhuang, Qing Li, Lei Chen 0002,...