Sciweavers

47 search results - page 3 / 10
» A Bound on the Performance of LDA in Randomly Projected Data...
Sort
View
IJUFKS
2006
64views more  IJUFKS 2006»
13 years 6 months ago
Cautious Analysis of Project Risks by Interval-Valued Initial Data
One of the most common performance measures in selection and management of projects is the Net Present Value (NPV). In the paper, we study a case when initial data about the NPV p...
Lev V. Utkin
MMM
2011
Springer
251views Multimedia» more  MMM 2011»
12 years 10 months ago
Randomly Projected KD-Trees with Distance Metric Learning for Image Retrieval
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
Pengcheng Wu, Steven C. H. Hoi, Duc Dung Nguyen, Y...
TKDE
2008
133views more  TKDE 2008»
13 years 6 months ago
Rotational Linear Discriminant Analysis Technique for Dimensionality Reduction
The linear discriminant analysis (LDA) technique is very popular in pattern recognition for dimensionality reduction. It is a supervised learning technique that finds a linear tran...
Alok Sharma, Kuldip K. Paliwal
KDD
2006
ACM
136views Data Mining» more  KDD 2006»
14 years 6 months ago
Very sparse random projections
There has been considerable interest in random projections, an approximate algorithm for estimating distances between pairs of points in a high-dimensional vector space. Let A Rn...
Ping Li, Trevor Hastie, Kenneth Ward Church
NIPS
2007
13 years 7 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...