Sciweavers

37 search results - page 6 / 8
» On-line exact shortest distance query processing
Sort
View
KAIS
2006
110views more  KAIS 2006»
14 years 9 months ago
Multi-step density-based clustering
Abstract. Data mining in large databases of complex objects from scientific, engineering or multimedia applications is getting more and more important. In many areas, complex dista...
Stefan Brecheisen, Hans-Peter Kriegel, Martin Pfei...
ICIP
2008
IEEE
15 years 11 months ago
Fast adaptive Mahalanobis distance-based search and retrieval in image databases
Motivated by the need to efficiently leverage user relevance feedback in content-based retrieval from image databases, we propose a fast, clustering-based indexing technique for e...
Sharadh Ramaswamy, Kenneth Rose
MDM
2010
Springer
281views Communications» more  MDM 2010»
14 years 11 months ago
Efficient Evaluation of k-Range Nearest Neighbor Queries in Road Networks
A k-Range Nearest Neighbor (or kRNN for short) query in road networks finds the k nearest neighbors of every point on the road segments within a given query region based on the net...
Jie Bao 0003, Chi-Yin Chow, Mohamed F. Mokbel, Wei...
ICCBR
2009
Springer
15 years 4 months ago
Conceptual Neighborhoods for Retrieval in Case-Based Reasoning
Abstract. We present a case-based reasoning technique based on conceptual neighborhoods of cases. The system applies domain knowledge to the case retrieval process in the form of r...
Ben G. Weber, Michael Mateas
SIGMOD
1998
ACM
143views Database» more  SIGMOD 1998»
15 years 1 months ago
Optimal Multi-Step k-Nearest Neighbor Search
For an increasing number of modern database applications, efficient support of similarity search becomes an important task. Along with the complexity of the objects such as images...
Thomas Seidl, Hans-Peter Kriegel