Sciweavers

1126 search results - page 31 / 226
» Strong Feature Sets from Small Samples
Sort
View
AI
2004
Springer
14 years 1 months ago
Distributed Data Mining vs. Sampling Techniques: A Comparison
To address the of mining a huge volume of geographically distributed databases, we propose two approaches. The first one is to download only a sample of each database. The second ...
Mohamed Aounallah, Sébastien Quirion, Guy W...
ICALP
2004
Springer
14 years 1 months ago
Sublinear-Time Approximation for Clustering Via Random Sampling
Abstract. In this paper we present a novel analysis of a random sampling approach for three clustering problems in metric spaces: k-median, min-sum kclustering, and balanced k-medi...
Artur Czumaj, Christian Sohler
NIPS
2003
13 years 9 months ago
Limiting Form of the Sample Covariance Eigenspectrum in PCA and Kernel PCA
We derive the limiting form of the eigenvalue spectrum for sample covariance matrices produced from non-isotropic data. For the analysis of standard PCA we study the case where th...
David C. Hoyle, Magnus Rattray
AAAI
2004
13 years 9 months ago
Bayesian Network Classifiers Versus k-NN Classifier Using Sequential Feature Selection
The aim of this paper is to compare Bayesian network classifiers to the k-NN classifier based on a subset of features. This subset is established by means of sequential feature se...
Franz Pernkopf
AUTOMATICA
2002
97views more  AUTOMATICA 2002»
13 years 7 months ago
Frequency-domain subspace system identification using non-parametric noise models
- In the general case of non-uniformly spaced frequency domain data and/or arbitrarily colored disturbing noise, the frequency domain subspace identification algorithms described i...
Rik Pintelon