Sciweavers

540 search results - page 16 / 108
» Efficient Similarity Search for Hierarchical Data in Large D...
Sort
View
SIGMOD
1998
ACM
99views Database» more  SIGMOD 1998»
15 years 1 months ago
CURE: An Efficient Clustering Algorithm for Large Databases
Clustering, in data mining, is useful for discovering groups and identifying interesting distributions in the underlying data. Traditional clustering algorithms either favor clust...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
81
Voted
EDBT
2004
ACM
141views Database» more  EDBT 2004»
15 years 9 months ago
HEAVEN: A Hierarchical Storage and Archive Environment for Multidimensional Array Database Management Systems
Abstract. The intention of this paper is to present HEAVEN, a solution of intelligent management of large-scale datasets held on tertiary storage systems. We introduce the common s...
Bernd Reiner, Karl Hahn
SIGMOD
2009
ACM
190views Database» more  SIGMOD 2009»
15 years 10 months ago
DataLens: making a good first impression
When a database query has a large number of results, the user can only be shown one page of results at a time. One popular approach is to rank results such that the "best&quo...
Bin Liu, H. V. Jagadish
ICDE
2010
IEEE
268views Database» more  ICDE 2010»
15 years 9 months ago
Techniques for Efficiently Searching in Spatial, Temporal, Spatio-temporal, and Multimedia Databases
This tutorial provides a comprehensive and comparative overview of general techniques to efficiently support similarity queries in spatial, temporal, spatio-temporal, and multimedi...
Hans-Peter Kriegel, Matthias Renz, Peer Kröge...
BIODATAMINING
2008
96views more  BIODATAMINING 2008»
14 years 9 months ago
Fast approximate hierarchical clustering using similarity heuristics
Background: Agglomerative hierarchical clustering (AHC) is a common unsupervised data analysis technique used in several biological applications. Standard AHC methods require that...
Meelis Kull, Jaak Vilo