Sciweavers

434 search results - page 16 / 87
» Dimensionality Reduction of Clustered Data Sets
Sort
View
ICONIP
2004
13 years 10 months ago
Non-linear Dimensionality Reduction by Locally Linear Isomaps
Algorithms for nonlinear dimensionality reduction (NLDR) find meaningful hidden low-dimensional structures in a high-dimensional space. Current algorithms for NLDR are Isomaps, Loc...
Ashutosh Saxena, Abhinav Gupta, Amitabha Mukerjee
SDM
2012
SIAM
261views Data Mining» more  SDM 2012»
11 years 11 months ago
Combining Active Learning and Dynamic Dimensionality Reduction
To date, many active learning techniques have been developed for acquiring labels when training data is limited. However, an important aspect of the problem has often been neglect...
Mustafa Bilgic
SSD
2005
Springer
122views Database» more  SSD 2005»
14 years 2 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
CIKM
2000
Springer
14 years 28 days ago
Dimensionality Reduction and Similarity Computation by Inner Product Approximations
—As databases increasingly integrate different types of information such as multimedia, spatial, time-series, and scientific data, it becomes necessary to support efficient retri...
Ömer Egecioglu, Hakan Ferhatosmanoglu
SDM
2003
SIAM
184views Data Mining» more  SDM 2003»
13 years 10 months ago
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
The problem of finding clusters in data is challenging when clusters are of widely differing sizes, densities and shapes, and when the data contains large amounts of noise and out...
Levent Ertöz, Michael Steinbach, Vipin Kumar