Sciweavers

114 search results - page 8 / 23
» OP-Cluster: Clustering by Tendency in High Dimensional Space
Sort
View
CIKM
2000
Springer
13 years 11 months ago
Vector Approximation based Indexing for Non-uniform High Dimensional Data Sets
With the proliferation of multimedia data, there is increasing need to support the indexing and searching of high dimensional data. Recently, a vector approximation based techniqu...
Hakan Ferhatosmanoglu, Ertem Tuncel, Divyakant Agr...
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
14 years 1 months ago
Mining Hierarchies of Correlation Clusters
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
Elke Achtert, Christian Böhm, Peer Kröge...
EDBT
2000
ACM
13 years 11 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
DASFAA
2007
IEEE
199views Database» more  DASFAA 2007»
14 years 1 months ago
Detection and Visualization of Subspace Cluster Hierarchies
Subspace clustering (also called projected clustering) addresses the problem that different sets of attributes may be relevant for different clusters in high dimensional feature sp...
Elke Achtert, Christian Böhm, Hans-Peter Krie...
SDM
2009
SIAM
176views Data Mining» more  SDM 2009»
14 years 4 months ago
Constraint-Based Subspace Clustering.
In high dimensional data, the general performance of traditional clustering algorithms decreases. This is partly because the similarity criterion used by these algorithms becomes ...
Élisa Fromont, Adriana Prado, Céline...