Sciweavers

168 search results - page 4 / 34
» Feature selection focused within error clusters
Sort
View
ICASSP
2009
IEEE
14 years 27 days ago
Voronoi cell shaping for feature selection with discrete HMMs
In this paper, we introduce a novel vector quantization (VQ) scheme for distributing the quantization error equally among the quantized dimensions. Afterwards, the proposed VQ sch...
Joachim Schenk, Gerhard Rigoll
ESANN
2007
13 years 7 months ago
Kernel PCA based clustering for inducing features in text categorization
We study dimensionality reduction or feature selection in text document categorization problem. We focus on the first step in building text categorization systems, that is the cho...
Zsolt Minier, Lehel Csató
BIOINFORMATICS
2006
92views more  BIOINFORMATICS 2006»
13 years 6 months ago
What should be expected from feature selection in small-sample settings
Motivation: High-throughput technologies for rapid measurement of vast numbers of biological variables offer the potential for highly discriminatory diagnosis and prognosis; howev...
Chao Sima, Edward R. Dougherty
CLUSTER
2007
IEEE
14 years 15 days ago
CHAF - an object-oriented framework for configuring applications in a clustered environment
- In high availability clustering solutions, an application must be configured properly to run within the framework of the high availability solution. This configuration is often c...
Augustus F. Diraviam, Ritu Agrawal, Madhur Bansal,...
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
14 years 21 days ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario