Sciweavers

121 search results - page 18 / 25
» Anytime K-Nearest Neighbor Search for Database Applications
Sort
View
SSD
1999
Springer
197views Database» more  SSD 1999»
14 years 26 days ago
3D Shape Histograms for Similarity Search and Classification in Spatial Databases
Classification is one of the basic tasks of data mining in modern database applications including molecular biology, astronomy, mechanical engineering, medical imaging or meteorolo...
Mihael Ankerst, Gabi Kastenmüller, Hans-Peter...
SIGMOD
2011
ACM
202views Database» more  SIGMOD 2011»
12 years 11 months ago
Flexible aggregate similarity search
Aggregate similarity search, a.k.a. aggregate nearest neighbor (Ann) query, finds many useful applications in spatial and multimedia databases. Given a group Q of M query objects...
Yang Li, Feifei Li, Ke Yi, Bin Yao 0002, Min Wang
SIGMOD
2010
ACM
324views Database» more  SIGMOD 2010»
14 years 1 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
2010
IEEE
157views Database» more  ICDE 2010»
13 years 8 months ago
Subspace similarity search using the ideas of ranking and top-k retrieval
— There are abundant scenarios for applications of similarity search in databases where the similarity of objects is defined for a subset of attributes, i.e., in a subspace, onl...
Thomas Bernecker, Tobias Emrich, Franz Graf, Hans-...
VLDB
1997
ACM
170views Database» more  VLDB 1997»
14 years 4 days ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula