Sciweavers

1126 search results - page 3 / 226
» Strong Feature Sets from Small Samples
Sort
View
IDA
2011
Springer
12 years 11 months ago
A parallel, distributed algorithm for relational frequent pattern discovery from very large data sets
The amount of data produced by ubiquitous computing applications is quickly growing, due to the pervasive presence of small devices endowed with sensing, computing and communicatio...
Annalisa Appice, Michelangelo Ceci, Antonio Turi, ...
ICMLA
2008
13 years 6 months ago
Predicting Algorithm Accuracy with a Small Set of Effective Meta-Features
We revisit 26 meta-features typically used in the context of meta-learning for model selection. Using visual analysis and computational complexity considerations, we find 4 meta-f...
Jun Won Lee, Christophe G. Giraud-Carrier
ECCV
2006
Springer
14 years 6 months ago
Sampling Strategies for Bag-of-Features Image Classification
Abstract. Bag-of-features representations have recently become popular for content based image classification owing to their simplicity and good performance. They evolved from text...
Eric Nowak, Frédéric Jurie, Bill Tri...
CVPR
2004
IEEE
14 years 6 months ago
Invariant Operators, Small Samples, and the Bias-Variance Dilemma
Invariant features or operators are often used to shield the recognition process from the effect of "nuisance" parameters, such as rotations, foreshortening, or illumina...
Xiaojin Shi, Roberto Manduchi
BMCBI
2008
95views more  BMCBI 2008»
13 years 4 months ago
Unsupervised reduction of random noise in complex data by a row-specific, sorted principal component-guided method
Background: Large biological data sets, such as expression profiles, benefit from reduction of random noise. Principal component (PC) analysis has been used for this purpose, but ...
Joseph W. Foley, Fumiaki Katagiri