Sciweavers

103 search results - page 5 / 21
» Projective ART for clustering data sets in high dimensional ...
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...
ECEASST
2010
13 years 4 months ago
Self Organized Swarms for cluster preserving Projections of high-dimensional Data
: A new approach for topographic mapping, called Swarm-Organized Projection (SOP) is presented. SOP has been inspired by swarm intelligence methods for clustering and is similar to...
Alfred Ultsch, Lutz Herrmann
ECML
2006
Springer
13 years 11 months ago
Subspace Metric Ensembles for Semi-supervised Clustering of High Dimensional Data
A critical problem in clustering research is the definition of a proper metric to measure distances between points. Semi-supervised clustering uses the information provided by the ...
Bojun Yan, Carlotta Domeniconi
ICDE
1998
IEEE
163views Database» more  ICDE 1998»
14 years 8 months ago
Fast Nearest Neighbor Search in High-Dimensional Space
Similarity search in multimedia databases requires an efficient support of nearest-neighbor search on a large set of high-dimensional points as a basic operation for query process...
Stefan Berchtold, Bernhard Ertl, Daniel A. Keim, H...
ICDE
2008
IEEE
158views Database» more  ICDE 2008»
14 years 8 months ago
CARE: Finding Local Linear Correlations in High Dimensional Data
Finding latent patterns in high dimensional data is an important research problem with numerous applications. Existing approaches can be summarized into 3 categories: feature selec...
Xiang Zhang, Feng Pan, Wei Wang