1489 search results - page 19 / 298 » Optimizing Feature Sets for Structured Data |
JMLR
2008
13 years 7 months ago
2008
We consider the problem of learning classifiers in structured domains, where some objects have a subset of features that are inherently absent due to complex relationships between...
PKDD
2009
Springer
14 years 2 months ago
2009
Springer
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...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We propose a modified discrete HMM that includes a feature weighting discrimination component. We assume that the feature space is partitioned into subspaces and that the relevan...
DCC
2006
IEEE
14 years 7 months ago
2006
IEEE
Abstract. We propose measures for compressed data structures, in which space usage is measured in a data-aware manner. In particular, we consider the fundamental dictionary problem...
ICDM
2002
IEEE
14 years 15 days ago
2002
IEEE
In view of the substantial number of existing feature selection algorithms, the need arises to count on criteria that enables to adequately decide which algorithm to use in certai...