Sciweavers

WWIC
2010
Springer
193views Communications» more  WWIC 2010»
13 years 11 months ago
0day Anomaly Detection Made Possible Thanks to Machine Learning
Abstract. This paper proposes new cognitive algorithms and mechanisms for detecting 0day attacks targeting the Internet and its communication performances and behavior. For this pu...
Philippe Owezarski, Johan Mazel, Yann Labit
COLT
2007
Springer
13 years 11 months ago
An Efficient Re-scaled Perceptron Algorithm for Conic Systems
Abstract. The classical perceptron algorithm is an elementary algorithm for solving a homogeneous linear inequality system Ax > 0, with many important applications in learning t...
Alexandre Belloni, Robert M. Freund, Santosh Vempa...
COLT
2007
Springer
13 years 11 months ago
Robust Reductions from Ranking to Classification
Abstract. We reduce ranking, as measured by the Area Under the Receiver Operating Characteristic Curve (AUC), to binary classification. The core theorem shows that a binary classif...
Maria-Florina Balcan, Nikhil Bansal, Alina Beygelz...
COLT
2007
Springer
13 years 11 months ago
Resampling-Based Confidence Regions and Multiple Tests for a Correlated Random Vector
We study generalized bootstrapped confidence regions for the mean of a random vector whose coordinates have an unknown dependence structure, with a non-asymptotic control of the co...
Sylvain Arlot, Gilles Blanchard, Étienne Ro...
CF
2007
ACM
13 years 11 months ago
Fast compiler optimisation evaluation using code-feature based performance prediction
Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this p...
Christophe Dubach, John Cavazos, Björn Franke...
ASSETS
2007
ACM
13 years 11 months ago
Automated tactile graphics translation: in the field
We address the practical problem of automating the process of translating figures from mathematics, science, and engineering textbooks to a tactile form suitable for blind student...
Chandrika Jayant, Matthew Renzelmann, Dana Wen, Sa...
ALT
2007
Springer
13 years 11 months ago
Cluster Identification in Nearest-Neighbor Graphs
Abstract. Assume we are given a sample of points from some underlying distribution which contains several distinct clusters. Our goal is to construct a neighborhood graph on the sa...
Markus Maier, Matthias Hein, Ulrike von Luxburg
ACML
2009
Springer
13 years 11 months ago
Max-margin Multiple-Instance Learning via Semidefinite Programming
In this paper, we present a novel semidefinite programming approach for multiple-instance learning. We first formulate the multipleinstance learning as a combinatorial maximum marg...
Yuhong Guo
ECML
1998
Springer
13 years 11 months ago
Predicate Invention and Learning from Positive Examples Only
Previous bias shift approaches to predicate invention are not applicable to learning from positive examples only, if a complete hypothesis can be found in the given language, as ne...
Henrik Boström