Sciweavers

434 search results - page 13 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
CIKM
2000
Springer
14 years 28 days 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...
APVIS
2010
13 years 6 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan
SDM
2009
SIAM
205views Data Mining» more  SDM 2009»
14 years 5 months ago
Identifying Information-Rich Subspace Trends in High-Dimensional Data.
Identifying information-rich subsets in high-dimensional spaces and representing them as order revealing patterns (or trends) is an important and challenging research problem in m...
Chandan K. Reddy, Snehal Pokharkar
KDD
2001
ACM
253views Data Mining» more  KDD 2001»
14 years 9 months ago
GESS: a scalable similarity-join algorithm for mining large data sets in high dimensional spaces
The similarity join is an important operation for mining high-dimensional feature spaces. Given two data sets, the similarity join computes all tuples (x, y) that are within a dis...
Jens-Peter Dittrich, Bernhard Seeger
CVPR
2007
IEEE
14 years 10 months ago
Integrating Global and Local Structures: A Least Squares Framework for Dimensionality Reduction
Linear Discriminant Analysis (LDA) is a popular statistical approach for dimensionality reduction. LDA captures the global geometric structure of the data by simultaneously maximi...
Jianhui Chen, Jieping Ye, Qi Li