Sciweavers

165 search results - page 27 / 33
» Adaptive dimension reduction for clustering high dimensional...
Sort
View
NIPS
2007
13 years 11 months ago
Random Projections for Manifold Learning
We propose a novel method for linear dimensionality reduction of manifold modeled data. First, we show that with a small number M of random projections of sample points in RN belo...
Chinmay Hegde, Michael B. Wakin, Richard G. Barani...
PAKDD
1998
ACM
103views Data Mining» more  PAKDD 1998»
14 years 2 months ago
Discovering Case Knowledge Using Data Mining
The use of Data Mining in removing current bottlenecks within Case-based Reasoning (CBR) systems is investigated along with the possible role of CBR in providing a knowledge manag...
Sarabjot S. Anand, David W. Patterson, John G. Hug...
GRC
2010
IEEE
13 years 11 months ago
Learning Multiple Latent Variables with Self-Organizing Maps
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
Lili Zhang, Erzsébet Merényi
CORR
1999
Springer
222views Education» more  CORR 1999»
13 years 9 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
JMLR
2010
165views more  JMLR 2010»
13 years 4 months ago
Feature Selection: An Ever Evolving Frontier in Data Mining
The rapid advance of computer technologies in data processing, collection, and storage has provided unparalleled opportunities to expand capabilities in production, services, comm...
Huan Liu, Hiroshi Motoda, Rudy Setiono, Zheng Zhao