693 search results - page 33 / 139 » Minimization and Partitioning Method Reducing Input Sets |
166
Voted
TKDE
2012
13 years 6 months ago
2012
Feature selection is fundamental to knowledge discovery from massive amount of high-dimensional data. In an effort to establish theoretical justification for feature selection al...
128
Voted
ICCD
2002
IEEE
15 years 9 months ago
2002
IEEE
The exceedingly large size of fault dictionaries constitutes a fundamental obstacle to their usage. We outline a new method to reduce significantly the size of fault dictionaries...
120
click to vote
TAMC
2009
Springer
15 years 10 months ago
2009
Springer
We provide polynomial time data reduction rules for Connected Dominating Set in planar graphs and analyze these to obtain a linear kernel for the planar Connected Dominating Set pr...
141
click to vote
FGR
2006
IEEE
15 years 7 months ago
2006
IEEE
Non-linear subspaces derived using kernel methods have been found to be superior compared to linear subspaces in modeling or classification tasks of several visual phenomena. Such...
150
click to vote
ICML
2008
IEEE
16 years 4 months ago
2008
IEEE
Graph transduction methods label input data by learning a classification function that is regularized to exhibit smoothness along a graph over labeled and unlabeled samples. In pr...