Sciweavers

1641 search results - page 220 / 329
» Termination Analysis with Algorithmic Learning
Sort
View
ML
2000
ACM
15 years 7 days ago
Enlarging the Margins in Perceptron Decision Trees
Capacity control in perceptron decision trees is typically performed by controlling their size. We prove that other quantities can be as relevant to reduce their flexibility and co...
Kristin P. Bennett, Nello Cristianini, John Shawe-...
ALT
2010
Springer
14 years 9 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...
105
Voted
CLEF
2007
Springer
15 years 6 months ago
Unsupervised Acquiring of Morphological Paradigms from Tokenized Text
This paper describes a rather simplistic method of unsupervised morphological analysis of words in an unknown language. All what is needed is a raw text corpus in the given langua...
Daniel Zeman
ICML
2007
IEEE
16 years 1 months ago
Relational clustering by symmetric convex coding
Relational data appear frequently in many machine learning applications. Relational data consist of the pairwise relations (similarities or dissimilarities) between each pair of i...
Bo Long, Zhongfei (Mark) Zhang, Xiaoyun Wu, Philip...
86
Voted
ICML
2008
IEEE
16 years 1 months ago
Bolasso: model consistent Lasso estimation through the bootstrap
We consider the least-square linear regression problem with regularization by the 1-norm, a problem usually referred to as the Lasso. In this paper, we present a detailed asymptot...
Francis R. Bach