Sciweavers

889 search results - page 143 / 178
» Observational Learning in Random Networks
Sort
View
PR
2008
85views more  PR 2008»
13 years 7 months ago
Quadratic boosting
This paper presents a strategy to improve the AdaBoost algorithm with a quadratic combination of base classifiers. We observe that learning this combination is necessary to get be...
Thang V. Pham, Arnold W. M. Smeulders
JMLR
2010
191views more  JMLR 2010»
13 years 2 months ago
Noise-contrastive estimation: A new estimation principle for unnormalized statistical models
We present a new estimation principle for parameterized statistical models. The idea is to perform nonlinear logistic regression to discriminate between the observed data and some...
Michael Gutmann, Aapo Hyvärinen
CAV
2011
Springer
216views Hardware» more  CAV 2011»
12 years 11 months ago
Malware Analysis with Tree Automata Inference
Abstract. The underground malware-based economy is flourishing and it is evident that the classical ad-hoc signature detection methods are becoming insufficient. Malware authors ...
Domagoj Babic, Daniel Reynaud, Dawn Song
ACL
2012
11 years 10 months ago
Building Trainable Taggers in a Web-based, UIMA-Supported NLP Workbench
Argo is a web-based NLP and text mining workbench with a convenient graphical user interface for designing and executing processing workflows of various complexity. The workbench...
Rafal Rak, BalaKrishna Kolluru, Sophia Ananiadou
TKDE
2008
123views more  TKDE 2008»
13 years 7 months ago
Explaining Classifications For Individual Instances
We present a method for explaining predictions for individual instances. The presented approach is general and can be used with all classification models that output probabilities...
Marko Robnik-Sikonja, Igor Kononenko