Sciweavers

9209 search results - page 418 / 1842
» Data Space Randomization
Sort
View
KDD
2009
ACM
156views Data Mining» more  KDD 2009»
16 years 7 months ago
Collusion-resistant anonymous data collection method
The availability and the accuracy of the data dictate the success of a data mining application. Increasingly, there is a need to resort to on-line data collection to address the p...
Mafruz Zaman Ashrafi, See-Kiong Ng
ICALP
2004
Springer
16 years 6 days ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
ICCV
2005
IEEE
16 years 8 months ago
Neighborhood Preserving Embedding
Recently there has been a lot of interest in geometrically motivated approaches to data analysis in high dimensional spaces. We consider the case where data is drawn from sampling...
Xiaofei He, Deng Cai, Shuicheng Yan, HongJiang Zha...
NIPS
2008
15 years 8 months ago
Robust Kernel Principal Component Analysis
Kernel Principal Component Analysis (KPCA) is a popular generalization of linear PCA that allows non-linear feature extraction. In KPCA, data in the input space is mapped to highe...
Minh Hoai Nguyen, Fernando De la Torre
IJCNN
2000
IEEE
15 years 10 months ago
A Training Method with Small Computation for Classification
A training data selection method for multi-class data is proposed. This method can be used for multilayer neural networks (MLNN). The MLNN can be applied to pattern classification...
Kazuyuki Hara, Kenji Nakayama