460 search results - page 1 / 92 » An Index Structure for Data Mining and Clustering |
KAIS
2000
13 years 4 months ago
2000
Abstract. In this paper we present an index structure, called MetricMap, that takes a set of objects and a distance metric and then maps those objects to a k-dimensional space in s...
SISAP
2008
IEEE
13 years 11 months ago
2008
IEEE
Similarity search has been proved suitable for searching in very large collections of unstructured data objects. We are interested in efficient parallel query processing under si...
EUROPAR
2001
Springer
13 years 9 months ago
2001
Springer
We present a new result concerning the parallelisation of DBSCAN, a Data Mining algorithm for density-based spatial clustering. The overall structure of DBSCAN has been mapped to a...
DAWAK
1999
Springer
13 years 8 months ago
1999
Springer
Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on efficient quer...
JIIS
2000
13 years 4 months ago
2000
Abstract. Efficient query processing is one of the basic needs for data mining algorithms. Clustering algorithms, association rule mining algorithms and OLAP tools all rely on effi...