Sciweavers

1850 search results - page 123 / 370
» classification 2010
Sort
View
ICML
2010
IEEE
15 years 5 months ago
Boosting Classifiers with Tightened L0-Relaxation Penalties
We propose a novel boosting algorithm which improves on current algorithms for weighted voting classification by striking a better balance between classification accuracy and the ...
Noam Goldberg, Jonathan Eckstein
JMLR
2010
104views more  JMLR 2010»
14 years 11 months ago
Increasing Feature Selection Accuracy for L1 Regularized Linear Models
L1 (also referred to as the 1-norm or Lasso) penalty based formulations have been shown to be effective in problem domains when noisy features are present. However, the L1 penalty...
Abhishek Jaiantilal, Gregory Z. Grudic
JMLR
2010
185views more  JMLR 2010»
14 years 11 months ago
HMMPayl: an application of HMM to the analysis of the HTTP Payload
Zero-days attacks are one of the most dangerous threats against computer networks. These, by definition, are attacks never seen before. Thus, defense tools based on a database of ...
Davide Ariu, Giorgio Giacinto
CLEF
2010
Springer
15 years 5 months ago
Augmenting Bag-of-Words - Category Specific Features and Concept Reasoning
In this paper we present our approach to the 2010 ImageClef PhotoAnnotation task. Based on the well-known bag-of-words approach we suggest two extensions. First, we analyzed the im...
Eugene Mbanya, Christian Hentschel, Sebastian Gerk...
COCO
2010
Springer
149views Algorithms» more  COCO 2010»
15 years 7 months ago
The Gaussian Surface Area and Noise Sensitivity of Degree-d Polynomial Threshold Functions
Abstract. We prove asymptotically optimal bounds on the Gaussian noise sensitivity of degree-d polynomial threshold functions. These bounds translate into optimal bounds on the Gau...
Daniel M. Kane