Sciweavers

9886 search results - page 1395 / 1978
» Learning Compressible Models
Sort
View
ALT
2010
Springer
15 years 3 months ago
A Spectral Approach for Probabilistic Grammatical Inference on Trees
We focus on the estimation of a probability distribution over a set of trees. We consider here the class of distributions computed by weighted automata - a strict generalization of...
Raphaël Bailly, Amaury Habrard, Franço...
PRL
2011
15 years 2 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
JMLR
2010
141views more  JMLR 2010»
15 years 1 months ago
FastInf: An Efficient Approximate Inference Library
The FastInf C++ library is designed to perform memory and time efficient approximate inference in large-scale discrete undirected graphical models. The focus of the library is pro...
Ariel Jaimovich, Ofer Meshi, Ian McGraw, Gal Elida...
ML
2010
ACM
147views Machine Learning» more  ML 2010»
15 years 1 months ago
An ensemble uncertainty aware measure for directed hill climbing ensemble pruning
This paper proposes a new measure for ensemble pruning via directed hill climbing, dubbed Uncertainty Weighted Accuracy (UWA), which takes into account the uncertainty of the decis...
Ioannis Partalas, Grigorios Tsoumakas, Ioannis P. ...
CISISSPAIN
2011
14 years 10 months ago
Testing Ensembles for Intrusion Detection: On the Identification of Mutated Network Scans
In last decades there have been many proposals from the machine learning community in the intrusion detection field. One of the main problems that Intrusion Detection Systems (IDSs...
Silvia González, Javier Sedano, Álva...
« Prev « First page 1395 / 1978 Last » Next »