Sciweavers

84 search results - page 7 / 17
» Finding the Nearest Neighbors in Biological Databases Using ...
Sort
View
SSD
1999
Springer
197views Database» more  SSD 1999»
13 years 11 months 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...
VLSISP
2010
254views more  VLSISP 2010»
13 years 5 months ago
Manifold Based Local Classifiers: Linear and Nonlinear Approaches
Abstract In case of insufficient data samples in highdimensional classification problems, sparse scatters of samples tend to have many ‘holes’—regions that have few or no nea...
Hakan Cevikalp, Diane Larlus, Marian Neamtu, Bill ...
GIS
2002
ACM
13 years 7 months ago
A road network embedding technique for k-nearest neighbor search in moving object databases
A very important class of queries in GIS applications is the class of K-Nearest Neighbor queries. Most of the current studies on the K-Nearest Neighbor queries utilize spatial ind...
Cyrus Shahabi, Mohammad R. Kolahdouzan, Mehdi Shar...
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
SIGMOD
2008
ACM
124views Database» more  SIGMOD 2008»
13 years 7 months ago
Scalable network distance browsing in spatial databases
An algorithm is presented for finding the k nearest neighbors in a spatial network in a best-first manner using network distance. The algorithm is based on precomputing the shorte...
Hanan Samet, Jagan Sankaranarayanan, Houman Alborz...